Faster and Shorter Password-Authenticated Key Exchange Rosario Gennaro Which Languages have 4-Round Zero-Knowledge Proofs? Jonathan Katz General Properties of Quantum Zero-Knowledge Proofs Hirotada Kobayashi Saving Private Randomness in One-Way Functions and Pseudorandom Generators Nenad Dedic, Danny Harnik and Leonid Reyzin Semi-Honest to Malicious Oblivious Transfer - The Black-Box Way Iftach Haitner Layered Specifications, Design and Analysis of Security Protocols Amir Herzberg and Igal Yoffe A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval Iftach Haitner, Jonathan J. Hoch and Gil Segev Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries Carmit Hazay and Yehuda Lindell Randomness Extraction via Delta-Biased Masking in the Presence of a Quantum Attacker Serge Fehr and Christian Schaffner Multi-Property Preserving Combiners for Hash Functions Marc Fischlin and Anja Lehmann Lower Bounds on Implementing Robust and Resilient Mediators Ittai Abraham, Danny Dolev and Joe Halpern Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model Andre Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis and Salil Vadhan Universally Composable Multi-Party Computation with an Unreliable Common Reference String Vipul Goyal and Jonathan Katz On Seed-Incompressible Functions Shai Halevi, Steven Myers and Charles Rackoff How to Achieve Perfect Simulation and a Complete Problem for Non Interactive Perfect Zero Knowledge Lior Malka Incrementally Verifiable Computation or Knowledge Implies Time/Space Efficiency Paul Valiant Verifiably Secure Devices Sergei Izmalkov, Matt Lepinski and Silvio Micali MPC vs. SFE: Perfect Security in a Unified Corruption Model Zuzana Beerliova-Trubiniova, Matthias Fitzi, Martin Hirt, Ueli Maurer and Vassilis Zikas Degradation and Amplification of Computational Hardness Shai Halevi and Tal Rabin On Constant-Round Concurrent Zero-Knowledge Rafael Pass and Muthuramakrishnan Venkitasubramaniam Equivocal Blind Signatures and Adaptive UC-Security Aggelos Kiayias and Hong-Sheng Zhou Asymptotically Efficient Lattice-Based Digital Signatures Vadim Lyubashevsky and Daniele Micciancio Cryptography and Game Theory: Designing Protocols for Exchanging Information Gillat Kol and Moni Naor Black-box Construction of a Non-Malleable Encryption Scheme from Any Semantically Secure One Seung Geol Choi, Dana Dachman-Soled, Tal Malkin and Hoeteck Wee Matroids Can Be Far From Ideal Secret Sharing Amos Beimel, Noam Livne and Carles Padro Non-interactive anonymous credentials Mira Belenkiy, Melissa Chase, Markulf Kohlweiss and Anna Lysyanskaya Perfectly-Secure MPC with Linear Communication Complexity Zuzana Beerliova-Trubiniova and Martin Hirt Fast Private Norm Estimation and Heavy Hitters Joe Kilian, Andre Madeira, Martin J. Strauss and Xuan Zheng OT-Combiners via Secure Computation Danny Harnik, Yuval Ishai, Eyal Kushilevitz and Jesper Buus Nielsen An Equivalence between Zero Knowledge and Commitments Shien Jin Ong and Salil Vadhan Concurrent Non-Malleable Commitments from One-way Functions Huijia Lin, Rafael Pass and Muthuramakrishnan Venkitasubramaniam The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization Daniele Micciancio and Scott Yilek Basing weak public-key cryptography on strong one-way functions Eli Biham, Yaron Goren and Yuval Ishai