CRYPTO 2012:

Reihaneh Safavi-Naini and Ran Canetti (Eds.):
Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference - CRYPTO 2012,
Santa Barbara,
CA, USA,
August 19-23, 2012
Proceedings.

• Symmetric Cryptosystems
  • An Enciphering Scheme Based on a Card Shuffle , 1-13, Phillip Rogaway , Ben Morris , Viet Tung Hoang
    bib info
  • Tweakable Blockciphers with Beyond Birthday-Bound Security , 14-30, Thomas Shrimpton , Will Landecker , R. Seth Terashima
    bib info
  • Breaking and Repairing GCM Security Proofs , 31-49, Tetsu Iwata , Kazuhiko Minematsu , Keisuke Ohashi
    bib info
  • On the Distribution of Linear Biases: Three Instructive Examples , 50-67, Gregor Leander , Mohamed Ahmed Abdelraheem , Martin Ågren , Peter Beelen
    bib info
  • Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs , 68-85, Emanuele Viola , Eric Miles
    bib info
• Invited Talk
  • The End of Crypto , 86, Jonathan Zittrain
    bib info
• Secure Computation I
  • Must You Know the Code of f to Securely Compute f? , 87-104, Mike Rosulek
    bib info
  • Adaptively Secure Multi-Party Computation with Dishonest Majority , 105-123, Amit Sahai , Sanjam Garg
    bib info
  • Collusion-Preserving Computation , 124-143, Ueli M. Maurer , Jonathan Katz , Joël Alwen , Vassilis Zikas
    bib info
  • Secret Sharing Schemes for Very Dense Graphs , 144-161, Amos Beimel , Oriol Farràs , Yuval Mintz
    bib info
• Attribute-based and Functional Encryption
  • Functional Encryption with Bounded Collusions via Multi-party Computation , 162-179, Vinod Vaikuntanathan , Hoeteck Wee , Sergey Gorbunov
    bib info
  • New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques , 180-198, Brent Waters , Allison B. Lewko
    bib info
  • Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption , 199-217, Amit Sahai , Hakan Seyalioglu , Brent Waters
    bib info
  • Functional Encryption for Regular Languages , 218-235, Brent Waters
    bib info
• Proof Systems
  • Secure Database Commitments and Universal Arguments of Quasi Knowledge , 236-254, Ivan Visconti , Melissa Chase
    bib info
  • Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits , 255-272, Nir Bitansky , Alessandro Chiesa
    bib info
• Protocols
  • On the Security of TLS-DHE in the Standard Model , 273-293, Jörg Schwenk , Tibor Jager , Sven Schäge , Florian Kohlar
    bib info
  • Semantic Security for the Wiretap Channel , 294-311, Mihir Bellare , Stefano Tessaro , Alexander Vardy
    bib info
  • Multi-instance Security and Its Application to Password-Based Cryptography , 312-329, Mihir Bellare , Thomas Ristenpart , Stefano Tessaro
    bib info
• Hash Functions
  • Hash Functions Based on Three Permutations: A Generic Security Analysis , 330-347, Bart Preneel , Bart Mennink
    bib info
  • To Hash or Not to Hash Again? (In)Differentiability Results for H 2 and HMAC , 348-366, Thomas Ristenpart , Yevgeniy Dodis , Stefano Tessaro , John P. Steinberger
    bib info
  • New Preimage Attacks against Reduced SHA-1 , 367-383, Dmitry Khovratovich , Simon Knellwolf
    bib info
  • Stam's Conjecture and Threshold Phenomena in Collision Resistance , 384-405, John P. Steinberger , Xiaoming Sun , Zhe Yang
    bib info
• Composable Security
  • Universal Composability from Essentially Any Trusted Setup , 406-423, Mike Rosulek
    bib info NULL
  • Impossibility Results for Static Input Secure Computation , 424-442, Ivan Visconti , Rafail Ostrovsky , Sanjam Garg , Abishek Kumarasubramanian
    bib info
  • New Impossibility Results for Concurrent Composition and a Non-interactive Completeness Theorem for Secure Computation , 443-460, Vipul Goyal , Amit Sahai , Manoj Prabhakaran , Shweta Agrawal , Abhishek Jain
    bib info
  • Black-Box Constructions of Composable Protocols without Set-Up , 461-478, Rafael Pass , Huijia Lin
    bib info
• Privacy
  • Crowd-Blending Privacy , 479-496, Rafael Pass , Johannes Gehrke , Edward Lui , Michael Hay
    bib info
  • Differential Privacy with Imperfect Randomness , 497-516, Ilya Mironov , Salil P. Vadhan , Yevgeniy Dodis , Adriana López-Alt
    bib info
• Leakage and Side-Channels
  • Tamper and Leakage Resilience in the Split-State Model , 517-532, Anna Lysyanskaya , Feng-Hao Liu
    bib info
  • Securing Circuits against Constant-Rate Tampering , 533-551, Yael Tauman Kalai , Dana Dachman-Soled
    bib info
  • Howto Compute under AC ⁰ Leakage without Secure Hardware , 552-569, Guy N. Rothblum
    bib info
• Invited Talk
  • Recent Advances and Existing Research Questions in Platform Security , 570, Ernie Brickell
    bib info
• Signatures
  • Group Signatures with Almost-for-Free Revocation , 571-589, Benoît Libert , Moti Yung , Thomas Peters
    bib info
  • Tightly Secure Signatures and Public-Key Encryption , 590-607, Dennis Hofheinz , Tibor Jager
    bib info
• Implementation Analysis
  • Efficient Padding Oracle Attacks on Cryptographic Hardware , 608-625, Romain Bardou , Riccardo Focardi , Yusuke Kawamoto , Lorenzo Simionato , Graham Steel , Joe-Kai Tsay
    bib info
  • Public Keys , 626-642, Arjen K. Lenstra , James P. Hughes , Thorsten Kleinjung , Joppe W. Bos , Maxime Augier , Christophe Wachter
    bib info
• Secure Computation II
  • Multiparty Computation from Somewhat Homomorphic Encryption , 643-662, Ivan Damgård , Nigel P. Smart , Sarah Zakarias , Valerio Pastro
    bib info
  • Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority , 663-680, Serge Fehr , Rafail Ostrovsky , Eli Ben-Sasson
    bib info
  • A New Approach to Practical Active-Secure Two-Party Computation , 681-700, Jesper Buus Nielsen , Claudio Orlandi , Peter Sebastian Nordholt , Sai Sheshank Burra
    bib info
• Black-Box Separation
  • The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives , 701-718, Rafael Pass , Mohammad Mahmoody
    bib info
• Cryptanalysis
  • Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems , 719-740, Orr Dunkelman , Nathan Keller , Adi Shamir , Itai Dinur
    bib info
  • Resistance against Iterated Attacks by Decorrelation Revisited, , 741-757, Serge Vaudenay , Atefeh Mashatan , Asli Bay
    bib info
• Quantum Cryptography
  • Secure Identity-Based Encryption in the Quantum Random Oracle Model , 758-775, Mark Zhandry
    bib info
  • Quantum to Classical Randomness Extractors , 776-793, Stephanie Wehner , Mario Berta , Omar Fawzi
    bib info
  • Actively Secure Two-Party Evaluation of Any Quantum Operation , 794-811, Jesper Buus Nielsen , Louis Salvail , Frédéric Dupuis
    bib info
• Key Encapsulation and One-way functions
  • On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups , 812-831, Goichiro Hanaoka , Jacob C. N. Schuldt , Takahiro Matsuda
    bib info
  • Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves , 832-849, Dimitar Jetchev , Alexandre Duc
    bib info
  • Homomorphic Evaluation of the AES Circuit , 850-867, Shai Halevi , Craig Gentry , Nigel P. Smart
    bib info
  • Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP , 868-886, Zvika Brakerski
    bib info
  
  

  ---

  
  Author Index