Linear Algebra with Sub-linear Zero-Knowledge Arguments Jens Groth Position Based Cryptography Nishanth Chandran, Vipul Goyal, Ryan Moriarty, Rafail Ostrovsky Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate Marc Stevens, Alex Sotirov, Jake Appelbaum, Arjen Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem Vadim Lyubashevsky, Daniele Micciancio Practical Cryptanalysis of ISO 9796-2 and Europay-Mastercard-Visa Signatures Jean-Sebastien Coron, David Naccache, Mehdi Tibouchi, Ralf-Philipp Weinmann How to Hash onto Elliptic Curves Thomas Icart On the Amortized Complexity of Zero-knowledge Protocols Ronald Cramer, Ivan Damgard Utility Dependence in Correct and Fair Rational Secret Sharing Gilad Asharov, Yehuda Lindell Privacy-Enhancing Auctions Using Rational Cryptography Peter Bro Miltersen, Jesper Buus Nielsen, Nikos Triandopoulos Merkle Puzzles are Optimal - an O(n^2)-query attack on key exchange from a random oracle Boaz Barak, Mohammad Mahmoody-Ghidary Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over *Any* Fixed Finite Field Ignacio Cascudo, Hao Chen, Ronald Cramer, Chaoping Xing Collusion-Free Multiparty Computation in the Mediated Model Joel Alwen, Jonathan Katz, Yehuda Lindell, Giuseppe Persiano, Abhi Shelat, Ivan Visconti Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer Juan Garay, Daniel Wichs, Hong-Sheng Zhou Reconstructing RSA Private Keys from Random Key Bits Nadia Heninger, Hovav Shacham Public-Key Cryptosystems Resilient to Key Leakage Moni Naor, Gil Segev Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1 Kazumaro Aoki, Yu Sasaki Distinguisher and Related-Key Attack on the Full AES-256 Alex Biryukov, Dmitry Khovratovich, Ivica Nikolic Solving Hidden Number Problem with One Bit Oracle and Advice Adi Akavia Probabilistically Checkable Arguments Yael Tauman Kalai, Ran Raz Computational Indistinguishability Amplification: Tight Product Theorems for System Composition Ueli Maurer, Stefano Tessaro Improving the Security of Quantum Protocols Ivan Damgaard, Serge Fehr, Carolin Lunemann, Louis Salvail, Christian Schaffner Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems Benny Applebaum, David Cash, Chris Peikert, Amit Sahai Cryptanalysis of C2 Julia Borghoff, Lars Knudsen, Gregor Leander, Krystian Matusiewicz Short and Stateless Signatures from the RSA Assumption Susan Hohenberger, Brent Waters The Group of Signed Quadratic Residues and Applications Dennis Hofheinz, Eike Kiltz Message Authentication Codes from Unpredictable Block Ciphers Yevgeniy Dodis, John Steinberger Batch binary Edwards Daniel J. Bernstein The Round Complexity of Verifiable Secret Sharing Revisted Arpita Patra, Ashish Choudhary, Tal Rabin, Pandu Rangan On the Composition of Public-Coin Zero Knowledge Protocols Rafael Pass, Wei-Lung Dustin Tseng, Douglas Wikstr\"om Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions Brent Waters How Risky is the Random-Oracle Model? Gaetan Leurent, Phong Q. Nguyen How to Encipher Messages on a Small Domain: Deterministic Encryption and the Thorp Shuffle Ben Morris, Phillip Rogaway, Till Stegers New Birthday Attacks on Some MACs Based on Block Ciphers Zheng Yuan, Wei Wang, Keting Jia, Guangwu Xu, Xiaoyun Wang Computational Differential Privacy Ilya Mironov, Omkant Pandey, Omer Reingold, Salil Vadhan Smooth Projective Hashing for Conditionally Extractable Commitments Michel Abdalla, Celine Chevalier, David Pointcheval Private Mutual Authentication and Conditional Oblivious Transfer Stanislaw Jarecki, Xiaomin Liu Randomizable Proofs and Delegatable Anonymous Credentials Mira Belenkiy, Jan Camenisch, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya, Hovav Shacham Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model Joel Alwen, Yevgeniy Dodis, Daniel Wichs