![]() |
Fifth IACR Theory of Cryptography ConferenceTCC 2008March 19-21 2008, New York UniversityNew York, USA |
Home Contact Submissions Call for papers Accepted papers Program Rump Session Special Event Venue Registration Accommodation Travel Info Restaurant list
Gold Sponsors: Silver Sponsors: |
Program Tuesday, March 1819:00-21:00 Welcome receptionLocation: 13th floor of Warren Weaver HallWednesday, March 198:00-9:00 Registration9:00-9:50 Session 1 (Chair: Ran Canetti)Incrementally Verifiable Computation or Knowledge Implies Time/Space EfficiencyPaul Valiant (MIT)
On Seed-Incompressible Functions
9:50-10:40 Session 2 (Chair: Ueli Maurer)Asymptotically Efficient Lattice-Based Digital SignaturesVadim Lyubashevsky (UCSD) and Daniele Micciancio (UCSD)
Basing weak public-key cryptography on strong one-way functions
10:40-11:10 Coffee Break11:10-12:25 Session 3 (Chair: Boaz Barak)Which Languages have 4-Round Zero-Knowledge Proofs?Jonathan Katz (U Maryland)
How to Achieve Perfect Simulation
General Properties of Quantum Zero-Knowledge Proofsa
12:25-2:15 Lunch2:15-3:55 Session 4 (Chair: Jens Groth)Layered Specifications, Design and Analysis of Security ProtocolsAmir Herzberg (Bar Ilan) and Igal Yoffe (Bar Ilan)
Universally Composable Multi-Party Computation with an
Unreliable Common Reference String
Efficient Protocols for Set Intersection and Pattern Matching
with Security Against Malicious and Covert Adversaries
Fast Private Norm Estimation and Heavy Hitters
3:55-4:25 Coffee Break4:25-5:40 Session 5 (Chair: Eyal Kushilevitz)Matroids Can Be Far From Ideal Secret SharingAmos Beimel (Ben Gurion), Noam Livne (Weizmann) and Carles Padro (U Catalunya)
Perfectly-Secure MPC with Linear Communication Complexity
MPC vs. SFE: Perfect Security in a Unified Corruption Model
Thursday, March 209:00-10:00 Invited Talk 1 (Chair: Moni Naor)A Survey of Game-Theoretic Approaches for the Design and Analysis of ProtocolsJonathan Katz (U Maryland)
10:00-10:30 Coffee Break10:30-11:45 Session 6 (Chair: abhi shelat)Verifiably Secure DevicesSergei Izmalkov (MIT), Matt Lepinski (BBN) and Silvio Micali (MIT)
Lower Bounds on Implementing Robust and Resilient Mediators
Cryptography and Game Theory: Designing Protocols for Exchanging
Information 11:50-12:50 Position Statements (Moderator: Tal Rabin)Game Theory and Cryptography --- Towards a Joint Point of View?Panlists: Jonathan Katz (U Maryland), Silvio Micali (MIT), Moni Naor (Weizmann)
12:50-2:30 Lunch2:30-3:20 Session 7 (Chair: Adriana Palacio)Equivocal Blind Signatures and Adaptive UC-SecurityAggelos Kiayias (U Conneticut) and Hong-Sheng Zhou (U Conneticut)
Non-interactive anonymous credentials
3:20-3:50 Coffee Break3:50-5:30 Session 8 (Chair: Chris Peikert)Multi-Property Preserving Combiners for Hash FunctionsMarc Fischlin (Darmstadt U. Tech.) and Anja Lehmann (Darmstadt U. Tech.)
OT-Combiners via Secure Computation
Semi-Honest to Malicious Oblivious Transfer - The Black-Box Way
Black-box Construction of a Non-Malleable Encryption Scheme
from Any Semantically Secure One
8:00-10:00 Business Meeting and Rump Session (Chair: Anna Lysyanskaya)For details check here.Friday, March 219:00-10:30 Invited Talk 2 (Chair: Tatsuaki Okamoto)Randomness Extractors and their Cryptographic ApplicationsSalil Vadhan (Harvard)
10:30-11:00 Coffee Break11:00-11:50 Session 9 (Chair: Hoeteck Wee)A Linear Lower Bound on the Communication Complexity of Single-Server Private Information RetrievalIftach Haitner (Weizmann), Jonathan J. Hoch (Weizmann) and Gil Segev (Weizmann)
Randomness Extraction via Delta-Biased Masking in the Presence
of a Quantum Attacker 11:50-12:40 Session 10 (Chair: Hoeteck Wee)An Equivalence between Zero Knowledge and CommitmentsShien Jin Ong (Harvard) and Salil Vadhan (Harvard)
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help
Model
12:40-2:30 Lunch2:30-3:20 Session 11 (Chair: Marc Fischlin)The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial CharacterizationDaniele Micciancio (UCSD) and Scott Yilek (UCSD)
On Constant-Round Concurrent Zero-Knowledge
3:20-3:50 Coffee Break3:50-4:40 Session 12 (Chair: Yevgeniy Dodis)Concurrent Non-Malleable Commitments from One-way FunctionsHuijia Lin (Cornell), Rafael Pass (Cornell) and Muthuramakrishnan Venkitasubramaniam (Cornell)
Faster and Shorter Password-Authenticated Key Exchange 4:40-5:30 Session 13 (Chair: Russell Impagliazzo)Saving Private Randomness in One-Way Functions and Pseudorandom GeneratorsNenad Dedic (BU), Danny Harnik (IBM Research) and Leonid Reyzin (BU)
Degradation and Amplification of Computational Hardness
|