32. CRYPTO 2012: Santa Barbara, California, USA
Reihaneh Safavi-Naini, Ran Canetti (Eds.): Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings. Springer 2012 Lecture Notes in Computer Science ISBN 978-3-642-32008-8- Will Landecker, Thomas Shrimpton, R. Seth Terashima: Tweakable Blockciphers with Beyond Birthday-Bound Security. 14-30
- Mohamed Ahmed Abdelraheem, Martin Ågren, Peter Beelen, Gregor Leander: On the Distribution of Linear Biases: Three Instructive Examples. 50-67
- Eric Miles, Emanuele Viola: Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs. 68-85
- Jonathan Zittrain: The End of Crypto. 86
- Mike Rosulek: Must You Know the Code of f to Securely Compute f? 87-104
- Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee: Functional Encryption with Bounded Collusions via Multi-party Computation. 162-179
- Allison B. Lewko, Brent Waters: New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques. 180-198
- Amit Sahai, Hakan Seyalioglu, Brent Waters: Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption. 199-217
- Brent Waters: Functional Encryption for Regular Languages. 218-235
- Melissa Chase, Ivan Visconti: Secure Database Commitments and Universal Arguments of Quasi Knowledge. 236-254
- Nir Bitansky, Alessandro Chiesa: Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits. 255-272
- Tibor Jager, Florian Kohlar, Sven Schäge, Jörg Schwenk: On the Security of TLS-DHE in the Standard Model. 273-293
- Mihir Bellare, Thomas Ristenpart, Stefano Tessaro: Multi-instance Security and Its Application to Password-Based Cryptography. 312-329
- Bart Mennink, Bart Preneel: Hash Functions Based on Three Permutations: A Generic Security Analysis. 330-347
- Yevgeniy Dodis, Thomas Ristenpart, John P. Steinberger, Stefano Tessaro: To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC. 348-366
- John P. Steinberger, Xiaoming Sun, Zhe Yang: Stam's Conjecture and Threshold Phenomena in Collision Resistance. 384-405
- Mike Rosulek: Universal Composability from Essentially Any Trusted Setup. 406-423
- Sanjam Garg, Abishek Kumarasubramanian, Rafail Ostrovsky, Ivan Visconti: Impossibility Results for Static Input Secure Computation. 424-442
- Shweta Agrawal, Vipul Goyal, Abhishek Jain, Manoj Prabhakaran, Amit Sahai: New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation. 443-460
- Yevgeniy Dodis, Adriana López-Alt, Ilya Mironov, Salil P. Vadhan: Differential Privacy with Imperfect Randomness. 497-516
- Guy N. Rothblum: How to Compute under ${\cal{AC}}^{\sf0}$ Leakage without Secure Hardware. 552-569
- Ernie Brickell: Recent Advances and Existing Research Questions in Platform Security. 570
- Romain Bardou, Riccardo Focardi, Yusuke Kawamoto, Lorenzo Simionato, Graham Steel, Joe-Kai Tsay: Efficient Padding Oracle Attacks on Cryptographic Hardware. 608-625
- Arjen K. Lenstra, James P. Hughes, Maxime Augier, Joppe W. Bos, Thorsten Kleinjung, Christophe Wachter: Public Keys. 626-642
- Ivan Damgård, Valerio Pastro, Nigel P. Smart, Sarah Zakarias: Multiparty Computation from Somewhat Homomorphic Encryption. 643-662
- Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky: Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. 663-680
- Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, Sai Sheshank Burra: A New Approach to Practical Active-Secure Two-Party Computation. 681-700
- Mohammad Mahmoody, Rafael Pass: The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives. 701-718
- Itai Dinur, Orr Dunkelman, Nathan Keller, Adi Shamir: Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems. 719-740
- Asli Bay, Atefeh Mashatan, Serge Vaudenay: Resistance against Iterated Attacks by Decorrelation Revisited, . 741-757
- Mark Zhandry: Secure Identity-Based Encryption in the Quantum Random Oracle Model. 758-775
- Frédéric Dupuis, Jesper Buus Nielsen, Louis Salvail: Actively Secure Two-Party Evaluation of Any Quantum Operation. 794-811
- Goichiro Hanaoka, Takahiro Matsuda, Jacob C. N. Schuldt: On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups. 812-831
- Alexandre Duc, Dimitar Jetchev: Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves. 832-849
- Zvika Brakerski: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP. 868-886
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team