This book constitutes the refereed proceedings of the 32nd Annual International Cryptology Conference, CRYPTO 2012, held in Santa Barbara, CA, USA, in August 2012. The 48 revised full papers presented were carefully reviewed and selected from 225 submissions. The volume also contains the abstracts of two invited talks. The papers are organized in topical sections on symmetric cryptosystems, secure computation, attribute-based and functional encryption, proofs systems, protocols, hash functions, composable security, privacy, leakage and side-channels, signatures, implementation analysis, black-box separation, cryptanalysis, quantum cryptography, and key encapsulation and one-way functions.
Author(s): Viet Tung Hoang, Ben Morris, Phillip Rogaway (auth.), Reihaneh Safavi-Naini, Ran Canetti (eds.)
Series: Lecture Notes in Computer Science 7417
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2012
Language: English
Pages: 888
City: Berlin ; Heidelberg [u.a.]
Tags: Data Encryption; Management of Computing and Information Systems; Computer Communication Networks; Systems and Data Security; Computers and Society; Discrete Mathematics in Computer Science
Front Matter....Pages -
An Enciphering Scheme Based on a Card Shuffle....Pages 1-13
Tweakable Blockciphers with Beyond Birthday-Bound Security....Pages 14-30
Breaking and Repairing GCM Security Proofs....Pages 31-49
On the Distribution of Linear Biases: Three Instructive Examples....Pages 50-67
Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs....Pages 68-85
The End of Crypto ....Pages 86-86
Must You Know the Code of f to Securely Compute f ?....Pages 87-104
Adaptively Secure Multi-Party Computation with Dishonest Majority....Pages 105-123
Collusion-Preserving Computation....Pages 124-143
Secret Sharing Schemes for Very Dense Graphs....Pages 144-161
Functional Encryption with Bounded Collusions via Multi-party Computation....Pages 162-179
New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques....Pages 180-198
Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption....Pages 199-217
Functional Encryption for Regular Languages....Pages 218-235
Secure Database Commitments and Universal Arguments of Quasi Knowledge....Pages 236-254
Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits....Pages 255-272
On the Security of TLS-DHE in the Standard Model....Pages 273-293
Semantic Security for the Wiretap Channel....Pages 294-311
Multi-instance Security and Its Application to Password-Based Cryptography....Pages 312-329
Hash Functions Based on Three Permutations: A Generic Security Analysis....Pages 330-347
To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC....Pages 348-366
New Preimage Attacks against Reduced SHA-1....Pages 367-383
Stam’s Conjecture and Threshold Phenomena in Collision Resistance....Pages 384-405
Universal Composability from Essentially Any Trusted Setup....Pages 406-423
Impossibility Results for Static Input Secure Computation....Pages 424-442
New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation....Pages 443-460
Black-Box Constructions of Composable Protocols without Set-Up....Pages 461-478
Crowd-Blending Privacy....Pages 479-496
Differential Privacy with Imperfect Randomness....Pages 497-516
Tamper and Leakage Resilience in the Split-State Model....Pages 517-532
Securing Circuits against Constant-Rate Tampering....Pages 533-551
How to Compute under ${\cal{AC}}^{\sf0}$ Leakage without Secure Hardware....Pages 552-569
Recent Advances and Existing Research Questions in Platform Security ....Pages 570-570
Group Signatures with Almost-for-Free Revocation....Pages 571-589
Tightly Secure Signatures and Public-Key Encryption....Pages 590-607
Efficient Padding Oracle Attacks on Cryptographic Hardware....Pages 608-625
Public Keys....Pages 626-642
Multiparty Computation from Somewhat Homomorphic Encryption....Pages 643-662
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority....Pages 663-680
A New Approach to Practical Active-Secure Two-Party Computation....Pages 681-700
The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives....Pages 701-718
Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems....Pages 719-740
Resistance against Iterated Attacks by Decorrelation Revisited,....Pages 741-757
Secure Identity-Based Encryption in the Quantum Random Oracle Model....Pages 758-775
Quantum to Classical Randomness Extractors....Pages 776-793
Actively Secure Two-Party Evaluation of Any Quantum Operation....Pages 794-811
On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups....Pages 812-831
Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves....Pages 832-849
Homomorphic Evaluation of the AES Circuit....Pages 850-867
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP....Pages 868-886
Back Matter....Pages -
