+612 9045 4394
Theory of Cryptography : 7th Theory of Cryptography Conference, Tcc 2010, Zurich, Switzerland, February 9-11, 2010, Proceedings - Daniele Micciancio

Theory of Cryptography

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

By: Daniele Micciancio (Editor)

Paperback Published: 8th February 2010
ISBN: 9783642117985
Number Of Pages: 605

Share This Book:


or 4 easy payments of $53.31 with Learn more
Ships in 5 to 9 business days

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.

Parallel Repetition
An Efficient Parallel Repetition Theoremp. 1
Parallel Repetition Theorems for Interactive Argumentsp. 19
Almost Optimal Bounds for Direct Product Threshold Theoremp. 37
On Symmetric Encryption and Point Obfuscationp. 52
Obfuscation of Hyperplane Membershipp. 72
Invited Talk
Secure Computation and Its Diverse Applicationsp. 90
Multiparty Computation
On Complete Primitives for Fairnessp. 91
On the Necessary and Sufficient Assumptions for UC Computationp. 109
From Passive to Covert Security at Low Costp. 128
CCA Security
A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problemsp. 146
Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputsp. 165
Threshold Cryptography and Secret Sharing
Efficient, Robust and Constant-Round Distributed RSA Key Generationp. 183
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystemsp. 201
Ideal Hierarchical Secret Sharing Schemesp. 219
Symmetric Cryptography
A Hardcore Lemma for Computational Indistinguishability: Security Amplification for Arbitrarily Weak PRGs with Optimal Stretchp. 237
On Related-Secret Pseudorandomnessp. 255
A Domain Extender for the Ideal Cipherp. 273
Delayed-Key Message Authentication for Streamsp. 290
Key-Leakage and Tamper-Resistance
Founding Cryptography on Tamper-Proof Hardware Tokensp. 308
Truly Efficient String Oblivious Transfer Using Resettable Tamper-Proof Tokensp. 327
Leakage-Resilient Signaturesp. 343
Public-Key Encryption Schemes with Auxiliary Inputsp. 361
Public-Key Cryptographic Primitives Provably as Secure as Subset Sump. 382
Rationality and Privacy
Rationality in the Full-Information Modelp. 401
Efficient Rational Secret Sharing in Standard Communication Networksp. 419
Bounds on the Sample Complexity for Private Learning and Private Data Releasep. 437
Public-Key Encryption
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertextsp. 455
Robust Encryptionp. 480
Invited Talk
Privacy-Enhancing Cryptography: From Theory into Practicep. 498
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofsp. 499
Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Modelp. 518
Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledgep. 535
Efficiency Limitations for ¿-Protocols for Group Homomorphismsp. 553
Composition of Zero-Knowledge Proofs with Efficient Proversp. 572
Private Coins versus Public Coins in Zero-Knowledge Proof Systemsp. 588
Author Indexp. 607
Table of Contents provided by Ingram. All Rights Reserved.

ISBN: 9783642117985
ISBN-10: 3642117988
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 605
Published: 8th February 2010
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.37 x 15.49  x 3.56
Weight (kg): 0.93