Theory of Cryptography: 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, by Salil P. VadhanTheory of Cryptography: 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, by Salil P. Vadhan

Theory of Cryptography: 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands…

bySalil P. Vadhan

Paperback | February 7, 2007

Pricing and Purchase Info

$233.50

Earn 1,168 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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 cover 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.

Title:Theory of Cryptography: 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands…Format:PaperbackDimensions:595 pages, 23.5 × 15.5 × 0.01 inPublished:February 7, 2007Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540709355

ISBN - 13:9783540709350

Reviews

Table of Contents

Encryption I.- Does Privacy Require True Randomness?.- Tackling Adaptive Corruptions in Multicast Encryption Protocols.- Universally Composable Security.- Long-Term Security and Universal Composability.- Universally Composable Security with Global Setup.- Arguments and Zero Knowledge.- Parallel Repetition of Computationally Sound Protocols Revisited.- Lower Bounds for Non-interactive Zero-Knowledge.- Perfect NIZK with Adaptive Soundness.- Notions of Security.- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries.- On the Necessity of Rewinding in Secure Multiparty Computation.- On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits.- Obfuscation.- On Best-Possible Obfuscation.- Obfuscation for Cryptographic Purposes.- Securely Obfuscating Re-encryption.- Secret Sharing and Multiparty Computation.- Weakly-Private Secret Sharing Schemes.- On Secret Sharing Schemes, Matroids and Polymatroids.- Secure Linear Algebra Using Linearly Recurrent Sequences.- Towards Optimal and Efficient Perfectly Secure Message Transmission.- Signatures and Watermarking.- Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions.- Designated Confirmer Signatures Revisited.- From Weak to Strong Watermarking.- Private Approximation and Black-Box Reductions.- Private Approximation of Clustering and Vertex Cover.- Robuster Combiners for Oblivious Transfer.- One-Way Permutations, Interactive Hashing and Statistically Hiding Commitments.- Towards a Separation of Semantic and CCA Security for Public Key Encryption.- Key Establishment.- Unifying Classical and Quantum Key Distillation.- Intrusion-Resilient Key Exchange in the Bounded Retrieval Model.- (Password) Authenticated Key Establishment: From 2-Party to Group.- Encryption II.- Multi-authority Attribute Based Encryption.- Conjunctive, Subset, and Range Queries on Encrypted Data.- How to Shuffle in Public.- Evaluating Branching Programs on Encrypted Data.