Salil P. Vadhan (Volume ed.)
Theory of Cryptography
4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings
Herausgegeben:Vadhan, Salil P.
Salil P. Vadhan (Volume ed.)
Theory of Cryptography
4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings
Herausgegeben:Vadhan, Salil P.
- Broschiertes Buch
Andere Kunden interessierten sich auch für
- Omer Reingold (Volume editor)Theory of Cryptography74,99 €
- Moni Naor (ed.)Theory of Cryptography83,99 €
- Theory of Cryptography74,99 €
- Joe Kilian (ed.)Theory of Cryptography83,99 €
- Subhamoy Maitra / C.E. Veni Madhavan / Ramarathnam Venkatesan (eds.)Progress in Cryptology - INDOCRYPT 200542,99 €
- Advances in Cryptology -- CRYPTO 201538,99 €
- Advances in Cryptology -- CRYPTO 201138,99 €
-
-
-
Produktdetails
- Lecture Notes in Computer Science 4392
- Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
- Artikelnr. des Verlages: 978-3-540-70935-0
- Seitenzahl: 595
- Englisch
- Abmessung: 235mm x 155mm
- Gewicht: 848g
- ISBN-13: 9783540709350
- ISBN-10: 3540709355
- Artikelnr.: 22592217
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
Salil P. Vadhan, Harvard University, Cambridge, MA, USA
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.
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.