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.
Author(s): Johan Håstad, Rafael Pass, Douglas Wikström, Krzysztof Pietrzak (auth.), Daniele Micciancio (eds.)
Series: Lecture Notes in Computer Science 5978 : Security and Cryptology
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2010
Language: English
Pages: 607
City: Berlin ; Heidelberg New York, NY
Tags: Data Encryption; Computer Communication Networks; Systems and Data Security; Coding and Information Theory; Math Applications in Computer Science; Algorithm Analysis and Problem Complexity
Front Matter....Pages -
An Efficient Parallel Repetition Theorem....Pages 1-18
Parallel Repetition Theorems for Interactive Arguments....Pages 19-36
Almost Optimal Bounds for Direct Product Threshold Theorem....Pages 37-51
On Symmetric Encryption and Point Obfuscation....Pages 52-71
Obfuscation of Hyperplane Membership....Pages 72-89
Secure Computation and Its Diverse Applications....Pages 90-90
On Complete Primitives for Fairness....Pages 91-108
On the Necessary and Sufficient Assumptions for UC Computation....Pages 109-127
From Passive to Covert Security at Low Cost....Pages 128-145
A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems....Pages 146-164
Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs....Pages 165-182
Efficient, Robust and Constant-Round Distributed RSA Key Generation....Pages 183-200
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems....Pages 201-218
Ideal Hierarchical Secret Sharing Schemes....Pages 219-236
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretch....Pages 237-254
On Related-Secret Pseudorandomness....Pages 255-272
A Domain Extender for the Ideal Cipher....Pages 273-289
Delayed-Key Message Authentication for Streams....Pages 290-307
Founding Cryptography on Tamper-Proof Hardware Tokens....Pages 308-326
Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokens....Pages 327-342
Leakage-Resilient Signatures....Pages 343-360
Public-Key Encryption Schemes with Auxiliary Inputs....Pages 361-381
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum....Pages 382-400
Rationality in the Full-Information Model....Pages 401-418
Efficient Rational Secret Sharing in Standard Communication Networks....Pages 419-436
Bounds on the Sample Complexity for Private Learning and Private Data Release....Pages 437-454
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts....Pages 455-479
Robust Encryption....Pages 480-497
Privacy-Enhancing Cryptography: From Theory into Practice....Pages 498-498
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs....Pages 499-517
Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model....Pages 518-534
Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge....Pages 535-552
Efficiency Limitations for Σ-Protocols for Group Homomorphisms....Pages 553-571
Composition of Zero-Knowledge Proofs with Efficient Provers....Pages 572-587
Private Coins versus Public Coins in Zero-Knowledge Proof Systems....Pages 588-605
Back Matter....Pages -
