accepted papers

Secure obfuscation for encrypted signatures,
- Satoshi Hada.
Encryption schemes secure against chosen-ciphertext selective opening attacks,
- Serge Fehr,
- Dennis Hofheinz,
- Eike Kiltz,
- Hoeteck Wee.
Universally composable quantum multi-party computation,
- Dominique Unruh.
On the impossibility of three-move blind signature schemes,
- Marc Fischlin,
- Dominique Schröder.
Multi-property-preserving domain extension using polynomial-based modes of operation,
- Jooyoung Lee,
- John Steinberger.
A new generic algorithm for hard knapsacks,
- Nick Howgrave-Graham,
- Antoine Joux.
Constant-round non-malleable commitments from sub-exponential one-way functions,
- Rafael Pass,
- Hoeteck Wee.
Adaptive trapdoor functions and chosen-ciphertext security,
- Eike Kiltz,
- Payman Mohassel,
- Adam O'Neill.
Plaintext-dependent decryption: A formal security treatment of SSH-CTR,
- Kenneth G. Paterson,
- Gaven J. Watson.
Adaptively secure broadcast,
- Martin Hirt,
- Vassilis Zikas.
Key recovery attacks of practical complexity on AES-256 variants with up to 10 rounds,
- Alex Biryukov,
- Orr Dunkelman,
- Nathan Keller,
- Dmitry Khovratovich,
- Adi Shamir.
Stam's collision resistance conjecture,
- John Steinberger.
Constructing verifiable random functions with large input spaces,
- Susan Hohenberger,
- Brent Waters.
Automatic search for related-key differentials in byte-oriented block ciphers: Application to AES, Camellia, Khazad and others,
- Alex Biryukov,
- Ivica Nikolić.
Partial fairness in secure two-party computation,
- Dov Gordon,
- Jonathan Katz.
Cryptographic agility and its relation to circular encryption,
- Tolga Acar,
- Mira Belenkiy,
- Mihir Bellare,
- David Cash.
Secure message transmission with small public discussion,
- Juan Garay,
- Clint Givens,
- Rafail Ostrovsky.
Public-key encryption in the bounded-retrieval model,
- Joël Alwen,
- Yevgeniy Dodis,
- Moni Naor,
- Gil Segev,
- Shabsi Walfish,
- Daniel Wichs.
Converting pairing-based cryptosystems from composite-order groups to prime-order groups,
- David Mandell Freeman.
Efficient device-independent quantum key distribution,
- Esther Hänggi,
- Renato Renner,
- Stefan Wolf.
Bounded key-dependent message security,
- Boaz Barak,
- Iftach Haitner,
- Dennis Hofheinz,
- Yuval Ishai.
Computational soundness, co-induction, and encryption cycles,
- Daniele Micciancio.
Fully homomorphic encryption over the integers,
- Marten van Dijk,
- Craig Gentry,
- Shai Halevi,
- Vinod Vaikuntanathan.
Lattice enumeration using extreme pruning,
- Nicolas Gama,
- Phong Q. Nguyen,
- Oded Regev.
Perfectly secure multiparty computation and the computational overhead of cryptography,
- Ivan Damgård,
- Yuval Ishai,
- Mikkel Krøigaard.
A simple BGN-type cryptosystem from LWE,
- Craig Gentry,
- Shai Halevi,
- Vinod Vaikuntanathan.
Universal one-way hash functions via inaccessible entropy,
- Iftach Haitner,
- Thomas Holenstein,
- Omer Reingold,
- Salil Vadhan,
- Hoeteck Wee.
Efficient lattice (H)IBE in the standard model,
- Shweta Agrawal,
- Dan Boneh,
- Xavier Boyen.
Protecting circuits from leakage: The computationally-bounded and noisy cases,
- Sebastian Faust,
- Tal Rabin,
- Leonid Reyzin,
- Eran Tromer,
- Vinod Vaikuntanathan.
On ideal lattices and learning with errors over rings,
- Vadim Lyubashevsky,
- Chris Peikert,
- Oded Regev.
Algebraic cryptanalysis of McEliece variants with compact keys,
- Jean-Charles Faugère,
- Ayoub Otmani,
- Ludovic Perret,
- Jean-Pierre Tillich.
Bonsai trees, or how to delegate a lattice basis,
- David Cash,
- Dennis Hofheinz,
- Eike Kiltz,
- Chris Peikert.
Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption,
- Allison Lewko,
- Tatsuaki Okamoto,
- Amit Sahai,
- Katsuyuki Takashima,
- Brent Waters.