7. TCC 2010: Zurich, Switzerland

Daniele Micciancio (Ed.): Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9-11, 2010. Proceedings. Lecture Notes in Computer Science 5978 Springer 2010, ISBN 978-3-642-11798-5

Parallel Repetition

Johan Håstad, Rafael Pass, Douglas Wikström, Krzysztof Pietrzak:
An Efficient Parallel Repetition Theorem. 1-18
Kai-Min Chung, Feng-Hao Liu:
Parallel Repetition Theorems for Interactive Arguments. 19-36
Charanjit S. Jutla:
Almost Optimal Bounds for Direct Product Threshold Theorem. 37-51

Obfuscation

Ran Canetti, Yael Tauman Kalai, Mayank Varia, Daniel Wichs:
On Symmetric Encryption and Point Obfuscation. 52-71
Ran Canetti, Guy N. Rothblum, Mayank Varia:
Obfuscation of Hyperplane Membership. 72-89

Invited Talk

Yuval Ishai:
Secure Computation and Its Diverse Applications. 90

Multiparty Computation

S. Dov Gordon, Yuval Ishai, Tal Moran, Rafail Ostrovsky, Amit Sahai:
On Complete Primitives for Fairness. 91-108
Ivan Damgård, Jesper Buus Nielsen, Claudio Orlandi:
On the Necessary and Sufficient Assumptions for UC Computation. 109-127
Ivan Damgård, Martin Geisler, Jesper Buus Nielsen:
From Passive to Covert Security at Low Cost. 128-145

CCA Security

Ronald Cramer, Dennis Hofheinz, Eike Kiltz:
A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems. 146-164
Yevgeniy Vahlis:
Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs. 165-182

Threshold Cryptography and Secret Sharing

Ivan Damgård, Gert Læssøe Mikkelsen:
Efficient, Robust and Constant-Round Distributed RSA Key Generation. 183-200
Rikke Bendlin, Ivan Damgård:
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems. 201-218
Oriol Farràs, Carles Padró:
Ideal Hierarchical Secret Sharing Schemes. 219-236

Symmetric Cryptography

Ueli M. Maurer, Stefano Tessaro:
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch. 237-254
David Goldenberg, Moses Liskov:
On Related-Secret Pseudorandomness. 255-272
Jean-Sébastien Coron, Yevgeniy Dodis, Avradip Mandal, Yannick Seurin:
A Domain Extender for the Ideal Cipher. 273-289
Marc Fischlin, Anja Lehmann:
Delayed-Key Message Authentication for Streams. 290-307

Key-Leakage and Tamper-Resistance

Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam Venkatesan, Akshay Wadia:
Founding Cryptography on Tamper-Proof Hardware Tokens. 308-326
Vladimir Kolesnikov:
Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens. 327-342
Sebastian Faust, Eike Kiltz, Krzysztof Pietrzak, Guy N. Rothblum:
Leakage-Resilient Signatures. 343-360
Yevgeniy Dodis, Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, Vinod Vaikuntanathan:
Public-Key Encryption Schemes with Auxiliary Inputs. 361-381
Vadim Lyubashevsky, Adriana Palacio, Gil Segev:
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. 382-400

Rationality and Privacy

Ronen Gradwohl:
Rationality in the Full-Information Model. 401-418
Georg Fuchsbauer, Jonathan Katz, David Naccache:
Efficient Rational Secret Sharing in Standard Communication Networks. 419-436
Amos Beimel, Shiva Prasad Kasiviswanathan, Kobbi Nissim:
Bounds on the Sample Complexity for Private Learning and Private Data Release. 437-454

Public-Key Encryption

Allison B. Lewko, Brent Waters:
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts. 455-479
Michel Abdalla, Mihir Bellare, Gregory Neven:
Robust Encryption. 480-497

Invited Talk

Jan Camenisch:
Privacy-Enhancing Cryptography: From Theory into Practice. 498

Zero-Knowledge

Benoît Libert, Moti Yung:
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs. 499-517
Rafael Pass, Wei-Lung Dustin Tseng, Muthuramakrishnan Venkitasubramaniam:
Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model. 518-534
Rafail Ostrovsky, Omkant Pandey, Ivan Visconti:
Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge. 535-552
Endre Bangerter, Jan Camenisch, Stephan Krenn:
Efficiency Limitations for Σ-Protocols for Group Homomorphisms. 553-571
Eleanor Birrell, Salil P. Vadhan:
Composition of Zero-Knowledge Proofs with Efficient Provers. 572-587
Rafael Pass, Muthuramakrishnan Venkitasubramaniam:
Private Coins versus Public Coins in Zero-Knowledge Proof Systems. 588-605

Last update Wed Feb 15 05:19:13 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page