This book constitutes the refereed proceedings of the 4th Theory of Cryptography Conference, TCC 2007, held in Amsterdam, The Netherlands in February 2007.
The 31 revised full papers presented were carefully reviewed and selected from 118 submissions. The papers are organized in topical sections on encryption, universally composable security, arguments and zero knowledge, notions of security, obfuscation, secret sharing and multiparty computation, signatures and watermarking, private approximation and black-box reductions, and key establishment.
Author(s): Carl Bosley, Yevgeniy Dodis (auth.), Salil P. Vadhan (eds.)
Series: Lecture Notes in Computer Science 4392
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2007
Language: English
Pages: 595
Tags: Data Encryption; Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Systems and Data Security; Management of Computing and Information Systems; Computers and Society
Front Matter....Pages -
Does Privacy Require True Randomness?....Pages 1-20
Tackling Adaptive Corruptions in Multicast Encryption Protocols....Pages 21-40
Long-Term Security and Universal Composability....Pages 41-60
Universally Composable Security with Global Setup....Pages 61-85
Parallel Repetition of Computationally Sound Protocols Revisited....Pages 86-102
Lower Bounds for Non-interactive Zero-Knowledge....Pages 103-117
Perfect NIZK with Adaptive Soundness....Pages 118-136
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries....Pages 137-156
On the Necessity of Rewinding in Secure Multiparty Computation....Pages 157-173
On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits....Pages 174-193
On Best-Possible Obfuscation....Pages 194-213
Obfuscation for Cryptographic Purposes....Pages 214-232
Securely Obfuscating Re-encryption....Pages 233-252
Weakly-Private Secret Sharing Schemes....Pages 253-272
On Secret Sharing Schemes, Matroids and Polymatroids....Pages 273-290
Secure Linear Algebra Using Linearly Recurrent Sequences....Pages 291-310
Towards Optimal and Efficient Perfectly Secure Message Transmission....Pages 311-322
Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions....Pages 323-341
Designated Confirmer Signatures Revisited....Pages 342-361
From Weak to Strong Watermarking....Pages 362-382
Private Approximation of Clustering and Vertex Cover....Pages 383-403
Robuster Combiners for Oblivious Transfer....Pages 404-418
One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments....Pages 419-433
Towards a Separation of Semantic and CCA Security for Public Key Encryption....Pages 434-455
Unifying Classical and Quantum Key Distillation....Pages 456-478
Intrusion-Resilient Key Exchange in the Bounded Retrieval Model....Pages 479-498
(Password) Authenticated Key Establishment: From 2-Party to Group....Pages 499-514
Multi-authority Attribute Based Encryption....Pages 515-534
Conjunctive, Subset, and Range Queries on Encrypted Data....Pages 535-554
How to Shuffle in Public....Pages 555-574
Evaluating Branching Programs on Encrypted Data....Pages 575-594
Back Matter....Pages -
