Publications of crypto 2012

Page	Title
1-13	An Enciphering Scheme Based on a Card Shuffle
14-30	Tweakable Blockciphers with Beyond Birthday-Bound Security
31-49	Breaking and Repairing GCM Security Proofs
50-67	On the Distribution of Linear Biases: Three Instructive Examples
68-85	Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
86	The End of Crypto
87-104	Must You Know the Code of f to Securely Compute f?
105-123	Adaptively Secure Multi-Party Computation with Dishonest Majority
124-143	Collusion-Preserving Computation
144-161	Secret Sharing Schemes for Very Dense Graphs
162-179	Functional Encryption with Bounded Collusions via Multi-party Computation
180-198	New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques
199-217	Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption
218-235	Functional Encryption for Regular Languages
236-254	Secure Database Commitments and Universal Arguments of Quasi Knowledge
255-272	Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
273-293	On the Security of TLS-DHE in the Standard Model
294-311	Semantic Security for the Wiretap Channel
312-329	Multi-instance Security and Its Application to Password-Based Cryptography
330-347	Hash Functions Based on Three Permutations: A Generic Security Analysis
348-366	To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC
367-383	New Preimage Attacks against Reduced SHA-1
384-405	Stam's Conjecture and Threshold Phenomena in Collision Resistance
406-423	Universal Composability from Essentially Any Trusted Setup
424-442	Impossibility Results for Static Input Secure Computation
443-460	New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation
461-478	Black-Box Constructions of Composable Protocols without Set-Up
479-496	Crowd-Blending Privacy
497-516	Differential Privacy with Imperfect Randomness
517-532	Tamper and Leakage Resilience in the Split-State Model
533-551	Securing Circuits against Constant-Rate Tampering
552-569	How to Compute under ${\cal{AC}}^{\sf0}$ Leakage without Secure Hardware
570	Recent Advances and Existing Research Questions in Platform Security
571-589	Group Signatures with Almost-for-Free Revocation
590-607	Tightly Secure Signatures and Public-Key Encryption
608-625	Efficient Padding Oracle Attacks on Cryptographic Hardware
626-642	Public Keys
643-662	Multiparty Computation from Somewhat Homomorphic Encryption
663-680	Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority
681-700	A New Approach to Practical Active-Secure Two-Party Computation
701-718	The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives
719-740	Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
741-757	Resistance against Iterated Attacks by Decorrelation Revisited,
758-775	Secure Identity-Based Encryption in the Quantum Random Oracle Model
776-793	Quantum to Classical Randomness Extractors
794-811	Actively Secure Two-Party Evaluation of Any Quantum Operation
812-831	On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
832-849	Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves
850-867	Homomorphic Evaluation of the AES Circuit
868-886	Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP