Theory of Cryptography: 7th Theory of Cryptography Conference, Tcc 2010, Zurich, Switzerland, February 9-11, 2010, Proceedings

ISBN-13: 9783642117985 / Angielski / Miękka / 2010 / 610 str.

Daniele Micciancio

Opis

TCC2010, the7thTheoryofCryptographyConference, washeldatETHZurich, Zurich, Switzerland, during February 9-11, 2010. TCC 2010 was sponsored by theInternationalAssociationofCryptologicResearch(IACR)andwasorganized in cooperation with the Information Security and Cryptography group at ETH Zurich.The GeneralChairsof the conferencewereMartin Hirt andUeli Maurer. The conference received 100 submissions, of which the Program Committee selected 33 for presentation at the conference. The Best Student Paper Award was given to Kai-Min Chung and Feng-Hao Liu for their paper "ParallelRepe- tion Theorems for Interactive Arguments." These proceedings consist of revised versions of those 33 papers. The revisions were not reviewed, and the authors bearfull responsibility forthe contentsoftheir papers.Inadditionto the regular papers, the conference featured two invited talks: "Secure Computation and Its Diverse Applications," given by Yuval Ishai and "Privacy-Enhancing Crypt- raphy: From Theory Into Practice," given by Jan Camenisch. Abstracts of the invited talks are also included in this volume. As in previous years, TCC received a steady stream of high-quality s- missions. Consequently, the selection process was very rewarding, but also very challenging, as a number of good papers could not be accepted due to lack of space. I would like to thank the TCC Steering Committee, and its Chair Oded Goldreich, for entrusting me with the responsibility of selecting the conference program.Since its inception, TCChas been verysuccessfulin attracting someof the best work in theoretical cryptography every year and o?ering a compelling program to its audience. I am honored I had the opportunity to contribute to the continuation of the success of the conference.

Spis treści

Parallel Repetition.- An Efficient Parallel Repetition Theorem.- Parallel Repetition Theorems for Interactive Arguments.- Almost Optimal Bounds for Direct Product Threshold Theorem.- Obfuscation.- On Symmetric Encryption and Point Obfuscation.- Obfuscation of Hyperplane Membership.- Invited Talk.- Secure Computation and Its Diverse Applications.- Multiparty Computation.- On Complete Primitives for Fairness.- On the Necessary and Sufficient Assumptions for UC Computation.- From Passive to Covert Security at Low Cost.- CCA Security.- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems.- Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs.- Threshold Cryptography and Secret Sharing.- Efficient, Robust and Constant-Round Distributed RSA Key Generation.- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems.- Ideal Hierarchical Secret Sharing Schemes.- Symmetric Cryptography.- A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch.- On Related-Secret Pseudorandomness.- A Domain Extender for the Ideal Cipher.- Delayed-Key Message Authentication for Streams.- Key-Leakage and Tamper-Resistance.- Founding Cryptography on Tamper-Proof Hardware Tokens.- Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens.- Leakage-Resilient Signatures.- Public-Key Encryption Schemes with Auxiliary Inputs.- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum.- Rationality and Privacy.- Rationality in the Full-Information Model.- Efficient Rational Secret Sharing in Standard Communication Networks.- Bounds on the Sample Complexity for Private Learning and Private Data Release.- Public-Key Encryption.- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts.- Robust Encryption.- Invited Talk.- Privacy-Enhancing Cryptography: From Theory into Practice.- Zero-Knowledge.- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs.- Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model.- Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge.- Efficiency Limitations for ?-Protocols for Group Homomorphisms.- Composition of Zero-Knowledge Proofs with Efficient Provers.- Private Coins versus Public Coins in Zero-Knowledge Proof Systems.

Blurb

This book constitutes the refereed proceedings of the Seventh Theory of Cryptography Conference, TCC 2010, held in Zurich, Switzerland, February 9-11, 2010.

The 33 revised full papers presented together with two invited talks were carefully reviewed and selected from 100 submissions.The papers are organized in topical sections on parallel repetition, obfuscation, multiparty computation, CCA security, threshold cryptography and secret sharing, symmetric cryptography, key-leakage and tamper-resistance, rationality and privacy, public-key encryption, and zero-knowledge.