TCC 2010:
Daniele Micciancio (Ed.):
Theory of Cryptography - TCC 2010,
7th Theory of Cryptography Conference,
TCC 2010, Zurich, Switzerland,
February 9-11, 2010
Proceedings.
TCC 2010
TCC 2010, Zurich, Switzerland,
February 9-11, 2010
Organizational Committee
Program Chairs : | Daniele Micciancio | |
General Chair : | Ueli M. Maurer and Martin Hirt |
Program Committee
Michael Backes |
Amos Beimel |
Alexandra Boldyreva |
Dario Catalano |
Nelly Fazio |
Jens Groth |
Iftach Haitner |
Johan Håstad |
Susan Hohenberger |
Phong Q. Nguyen |
Rafail Ostrovsky |
Alon Rosen |
Victor Shoup |
Adam Smith |
Vinod Vaikuntanathan |
Bogdan Warinschi |
Stefan Wolf |
External Referees
-
Parallel Repetition
-
An Efficient Parallel Repetition Theorem.
, 1-18,
Johan Håstad
,
Rafael Pass
,
Douglas Wikström
,
Krzysztof Pietrzak
bib info -
Parallel Repetition Theorems for Interactive Arguments.
, 19-36,
Kai-Min Chung
,
Feng-Hao Liu
bib info -
Almost Optimal Bounds for Direct Product Threshold Theorem.
, 37-51,
Charanjit S. Jutla
bib info
-
An Efficient Parallel Repetition Theorem.
, 1-18,
Johan Håstad
,
Rafael Pass
,
Douglas Wikström
,
Krzysztof Pietrzak
- Obfuscation
- Invited Talk
-
Multiparty Computation
-
On Complete Primitives for Fairness.
, 91-108,
Rafail Ostrovsky
,
Amit Sahai
,
Yuval Ishai
,
Tal Moran
,
S. Dov Gordon
bib info -
On the Necessary and Sufficient Assumptions for UC Computation.
, 109-127,
Ivan Damgård
,
Jesper Buus Nielsen
,
Claudio Orlandi
bib info -
From Passive to Covert Security at Low Cost.
, 128-145,
Ivan Damgård
,
Jesper Buus Nielsen
,
Martin Geisler
bib info
-
On Complete Primitives for Fairness.
, 91-108,
Rafail Ostrovsky
,
Amit Sahai
,
Yuval Ishai
,
Tal Moran
,
S. Dov Gordon
-
CCA Security
-
A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems.
, 146-164,
Ronald Cramer
,
Eike Kiltz
,
Dennis Hofheinz
bib info -
Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs.
, 165-182,
Yevgeniy Vahlis
bib info
-
A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems.
, 146-164,
Ronald Cramer
,
Eike Kiltz
,
Dennis Hofheinz
-
Threshold Cryptography and Secret Sharing
-
Efficient, Robust and Constant-Round Distributed RSA Key Generation.
, 183-200,
Ivan Damgård
,
Gert Læssøe Mikkelsen
bib info -
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems.
, 201-218,
Ivan Damgård
,
Rikke Bendlin
bib info -
Ideal Hierarchical Secret Sharing Schemes.
, 219-236,
Carles Padró
,
Oriol Farràs
bib info
-
Efficient, Robust and Constant-Round Distributed RSA Key Generation.
, 183-200,
Ivan Damgård
,
Gert Læssøe Mikkelsen
-
Symmetric Cryptography
-
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch.
, 237-254,
Ueli M. Maurer
,
Stefano Tessaro
bib info -
On Related-Secret Pseudorandomness.
, 255-272,
Moses Liskov
,
David Goldenberg
bib info -
A Domain Extender for the Ideal Cipher.
, 273-289,
Jean-Sébastien Coron
,
Yannick Seurin
,
Yevgeniy Dodis
,
Avradip Mandal
bib info -
Delayed-Key Message Authentication for Streams.
, 290-307,
Marc Fischlin
,
Anja Lehmann
bib info
-
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch.
, 237-254,
Ueli M. Maurer
,
Stefano Tessaro
-
Key-Leakage and Tamper-Resistance
-
Founding Cryptography on Tamper-Proof Hardware Tokens.
, 308-326,
Ramarathnam Venkatesan
,
Vipul Goyal
,
Amit Sahai
,
Yuval Ishai
,
Akshay Wadia
bib info -
Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens.
, 327-342,
Vladimir Kolesnikov
bib info -
Leakage-Resilient Signatures.
, 343-360,
Eike Kiltz
,
Krzysztof Pietrzak
,
Guy N. Rothblum
,
Sebastian Faust
bib info -
Public-Key Encryption Schemes with Auxiliary Inputs.
, 361-381,
Chris Peikert
,
Vinod Vaikuntanathan
,
Shafi Goldwasser
,
Yevgeniy Dodis
,
Yael Tauman Kalai
bib info -
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum.
, 382-400,
Adriana Palacio
,
Gil Segev
,
Vadim Lyubashevsky
bib info
-
Founding Cryptography on Tamper-Proof Hardware Tokens.
, 308-326,
Ramarathnam Venkatesan
,
Vipul Goyal
,
Amit Sahai
,
Yuval Ishai
,
Akshay Wadia
-
Rationality and Privacy
-
Rationality in the Full-Information Model.
, 401-418,
Ronen Gradwohl
bib info -
Efficient Rational Secret Sharing in Standard Communication Networks.
, 419-436,
David Naccache
,
Jonathan Katz
,
Georg Fuchsbauer
bib info -
Bounds on the Sample Complexity for Private Learning and Private Data Release.
, 437-454,
Amos Beimel
,
Kobbi Nissim
,
Shiva Prasad Kasiviswanathan
bib info
-
Rationality in the Full-Information Model.
, 401-418,
Ronen Gradwohl
- Public-Key Encryption
- Invited Talk
-
Zero-Knowledge
-
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs.
, 499-517,
Benoît Libert
,
Moti Yung
bib info -
Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model.
, 518-534,
Rafael Pass
,
Wei-Lung Dustin Tseng
,
Muthuramakrishnan Venkitasubramaniam
bib info -
Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge.
, 535-552,
Ivan Visconti
,
Rafail Ostrovsky
,
Omkant Pandey
bib info -
Efficiency Limitations for Σ-Protocols for Group Homomorphisms.
, 553-571,
Jan Camenisch
,
Endre Bangerter
,
Stephan Krenn
bib info -
Composition of Zero-Knowledge Proofs with Efficient Provers.
, 572-587,
Salil P. Vadhan
,
Eleanor Birrell
bib info -
Private Coins versus Public Coins in Zero-Knowledge Proof Systems.
, 588-605,
Rafael Pass
,
Muthuramakrishnan Venkitasubramaniam
bib info
Author Index -
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs.
, 499-517,
Benoît Libert
,
Moti Yung