Theory of Cryptography 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings /
Theory of Cryptography 4th Theory of Cryptography Conference, TCC 2007, Amsterdam, The Netherlands, February 21-24, 2007, Proceedings / [electronic resource] :
edited by Salil P. Vadhan.
- 1st ed. 2007.
- XI, 595 p. online resource.
- Security and Cryptology, 4392 2946-1863 ; .
- Security and Cryptology, 4392 .
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.
9783540709367
10.1007/978-3-540-70936-7 doi
Cryptography.
Data encryption (Computer science).
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Data protection.
Electronic data processing--Management.
Computers and civilization.
Cryptology.
Algorithms.
Discrete Mathematics in Computer Science.
Data and Information Security.
IT Operations.
Computers and Society.
QA268
005.824
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.
9783540709367
10.1007/978-3-540-70936-7 doi
Cryptography.
Data encryption (Computer science).
Algorithms.
Computer science--Mathematics.
Discrete mathematics.
Data protection.
Electronic data processing--Management.
Computers and civilization.
Cryptology.
Algorithms.
Discrete Mathematics in Computer Science.
Data and Information Security.
IT Operations.
Computers and Society.
QA268
005.824