TCC 2007February 21-24 2007, TrippenhuisAmsterdam, The Netherlands |
Home Contact Call for papers Accepted papers Program Rump Session Special Event Venue Registration Accommodation Travel Info Restaurant list |
TCC 2007 PROGRAM
All events (except welcome reception) take place in the KNAW Trippenhuis, see map. For the presentations we will provide a windows laptop with Powerpoint 2002, acrobat reader, and ghostview installed. You can transfer your presentation to this computer using a memory stick or email your presentation to [email protected] (and make sure it is on the laptop in the break before your session starts!).
Wednesday, 21 February19:00-21:00 Welcome receptionLocation: Restaurant de Waag (street address: Nieuwmarkt 4) picture, map (it's the castle-like structure in the center of the square)Thursday, 22 February8:00-8:45 Registration8:45-9:00 WelcomeFrans Saris, Dean of the Faculty of Mathematics and Natural Sciences, Leiden University9:00-9:50 Encryption I (Chair: Salil Vadhan)Does Privacy Require True Randomness?Carl Bosley (NYU) and Yevgeniy Dodis (NYU)
Tackling Adaptive Corruptions in Multicast Encryption Protocols 9:50-10:40 Universally Composable Security (Chair: Salil Vadhan)Long-term Security and Universal ComposabilityJörn Müller-Quade (U. Karlsruhe) and Dominique Unruh (Saarland U.)
Universally Composable Security with Global Setup
10:40-11:10 Coffee Break11:10-12:25 Arguments and Zero Knowledge (Chair: Rafael Pass)Parallel Repetition of Computationally Sound Protocols RevisitedKrzysztof Pietrzak (CWI Amsterdam) and Douglas Wikström (ETH Zürich)
Lower Bounds for Non-Interactive Zero-Knowledge
Perfect NIZK with Adaptive Soundness
12:25-2:00 Lunch2:00-3:15 Notions of Security (Chair: Ran Canetti)Security Against Covert Adversaries: Efficient Protocols for Realistic AdversariesYonatan Aumann (Bar-Ilan U.) and Yehuda Lindell (Bar-Ilan U.)
On the Necessity of Rewinding in Secure Multiparty Computation
On Expected Probabilistic Polynomial-Time Adversaries:
A Suggestion For Restricted Definitions And Their Benefits
3:15-3:45 Coffee Break3:45-5:25 Special Event: The Assumptions for Cryptography (Chair: Omer Reingold)Speakers: Dan Boneh, Shai Halevi, Daniele Micciancio.8:00-10:00 Panel Discussion: The Assumptions for Cryptography (Chair: Salil Vadhan)The panelists are: Dan Boneh, Ivan Damgard, Shai Halevi, Daniele Micciancio, and Moni Naor. For details check here.Friday, 23 February9:00-10:15 Obfuscation (Chair: Rafael Pass)On Best-Possible ObfuscationShafi Goldwasser (Weizmann Institute, MIT) and Guy N. Rothblum (MIT)
Obfuscation for Cryptographic Purposes
Securely Obfuscating Re-Encryption
10:15-10:45 Coffee Break10:45-12:25 Secret Sharing and Multiparty Computation (Chair: Serge Fehr)Weakly-Private Secret Sharing SchemesAmos Beimel (Ben-Gurion U.) and Matthew Franklin (UC Davis)
On Secret Sharing Schemes, Matroids and Polymatroids
Secure Linear Algebra Using Linearly Recurrent Sequences
Towards Optimal and Efficient Perfectly Secure Message Transmission
12:25-2:00 Lunch2:00-3:15 Signatures and Watermarking (Chair: Shafi Goldwasser)Concurrently-Secure Blind Signatures without Random Oracles or Setup AssumptionsCarmit Hazay (Bar-Ilan U.) and Jonathan Katz (U. Maryland) and Chiu-Yuen Koo (U. Maryland) and Yehuda Lindell (Bar-Ilan U.)
Designated Confirmer Signatures Revisited
From Weak to Strong Watermarking
3:15-3:45 Coffee Break3:45-5:25 Private Approximation and Black-Box Reductions (Chair: Moni Naor)Private Approximation of Clustering and Vertex CoverAmos Beimel (Ben-Gurion U.), Renen Hallak (Ben-Gurion U.), Kobbi Nissim (Ben-Gurion U.)
Robuster Combiners for Oblivious Transfer
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments
Towards a Separation of Semantic and CCA Security for Public Key Encryption
7:30-10:00 Business Meeting and Rump Session (Chairs: Yuval Ishai and Brent Waters)For details check here.Saturday, 24 February9:00-10:30 Tutorial (Chair: Ivan Damgard)Quantum CryptographyRenato Renner (U. Cambridge)
10:30-11:00 Coffee Break11:00-12:15 Key Establishment (Chair: Serge Fehr)Unifying Classical and Quantum Key DistillationMatthias Christandl (U. Cambridge) and Artur Ekert (National U. Singapore, U. Cambridge) and Michal Horodecki (U. Gdansk) and Pawel Horodecki (Gdansk U. Technology) and Jonathan Oppenheim (U. Cambridge) and Renato Renner (U. Cambridge)
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model
(Password) Authenticated Key Establishment: From 2-Party To Group
12:15-1:45 Lunch1:45-3:25 Encryption II (Chair: Ran Canetti)Multi-Authority Attribute Based EncryptionMelissa Chase (Brown U.)
Conjunctive, Subset, and Range Queries on Encrypted Data
How To Shuffle in Public
Evaluating Branching Programs on Encrypted Data
|