Aug 19 – 23
Santa Barbara




Accepted Papers



New Impossibility Results for Concurrent Composition and a Non-Interactive Completeness Theorem for Secure Computation

Shweta Agrawal (UCLA)

Vipul Goyal (MSR, India)

Abhishek Jain (UCLA)
Manoj Prabhakaran (UIUC)

Amit Sahai (UCLA)


On the Distribution of Linear Biases: Three Instructive Examples
Mohamed Ahmed Abdelraheem (Technical University, Denmark)

Martin Ågren (Lund University, Sweden)

Peter Beelen (Technical University, Denmark)

Gregor Leander (Technical University, Denmark)

Collusion-Preserving Computation

Joel Alwen (ETH Zurich, Switzerland)

Jonathan Katz (University of Maryland)

Ueli Maurer (ETH Zurich, Switzerland)

Vassilis Zikas (University of Maryland)


Efficient Padding Oracle Attacks on Cryptographic Hardware

Romain Bardou (INRIA, France)

Riccardo Focardi (Università Ca' Foscari, Italy)

Yusuke Kawamoto (University of Birmingham, United Kingdom)

Lorenzo Simionato (Università Ca' Foscari, Venezia, Italy)

Graham Steel (INRIA, France)

Joe-Kai Tsay (NTNU, Norway)


Resistance Against Iterated Attacks Revisited

Asli Bay (EPFL, Switzerland)

Atefeh Mashatan (EPFL, Switzerland)

Serge Vaudenay (EPFL, Switzerland)


Secret Sharing Schemes for Very Dense Graphs

Amos Beimel (Ben Gurion University, Israel)

Yuval Mintz (Ben Gurion University, Israel)

Oriol Farras (Universitat Rovira i Virgili, Spain)


Semantic Security for the Wiretap Channel

Mihir Bellare (UCSD)

Stefano Tessaro (MIT)

Alexander Vardy (UCSD)


Multi-Instance Security and its Application to Password-Based Cryptography

Mihir Bellare (UCSD)

Thomas Ristenpart (University of Wisconsin-Madison)

Stefano Tessaro (MIT)


Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority

Eli Ben-Sasson (Technion , Israel)

Serge Fehr (CWI, The Netherlands)

Rafail Ostrovsky (UCLA)


Quantum to Classical Randomness Extractors

Mario Berta (ETH Zurich, Switzerland)

Omar Fawzi (McGill University, Canada)

Stephanie Wehner (National University of Singapore, Singapore)


Succinct Arguments from Multi-Prover Interactive Proofs and their Efficiency Benefits
Nir Bitansky (Tel Aviv University, Israel)

Alessandro Chiesa (MIT)

Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

Zvika Brakerski (Stanford University)


Securing Circuits Against Constant-Rate Tampering

Dana Dachman-Soled (Microsoft Research New England)

Yael Tauman Kalai (Microsoft Research New England)


Secure Database Commitments and Universal Arguments of Quasi Knowledge
Melissa Chase (Microsoft Research Redmond)

Ivan Visconti (University of Salerno, Italy)


Multiparty Computation from Somewhat Homomorphic Encryption

Ivan Damgard (Aarhus University, Denmark)

Valerio Pastro (Aarhus University, Denmark)

Nigel Smart (University of Bristol, United Kingdom)

Sarah Zakarias (Aarhus University, Denmark)


Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems

Itai Dinur (Weizmann Institute, Israel)

Orr Dunkelman (Weizmann Institute and University of Haifa, Israel)

Nathan Keller (Weizmann Institute and Bar-Ilan University, Israel)

Adi Shamir (Weizmann Institute, Israel)


Differential Privacy with Imperfect Randomness

Yevgeniy Dodis (NYU)

Adriana Lopez-Alt (NYU)

Ilya Mironov (Microsoft Research)

Salil Vadhan (Harvard University)


To Hash or Not to Hash Again? (In)differentiability Results for H^2 and HMAC

Yevgeniy Dodis (NYU)

Thomas Ristenpart (University of Wisconsin-Madison)

John Steinberger (Tsinghua University, China)

Stefano Tessaro (MIT)


Hardness of Computing Individual Bits for One-way Functions on Elliptic Curves

Alexandre Duc (EPFL, Switzerland)

Dimitar Jetchev (EPFL, Switzerland)


Actively Secure Two-Party Evaluation of any Quantum Operation

Frédéric Dupuis (ETH Zürich)

Louis Salvail (Université de Montréal, Canada)

Jesper Buus Nielsen (Aarhus University)


Impossibility Results for Static Input Secure Computation

Sanjam Garg (UCLA)

Abishek Kumarasubramanian (UCLA)

Rafail Ostrovsky (UCLA)

Ivan Visconti (University of Salerno, Italy)


Adaptively Secure Multi-Party Computation with Dishonest Majority

Sanjam Garg (UCLA)

Amit Sahai (UCLA)


Crowd-Blending Privacy

Johannes Gehrke (Cornell University)

Michael Hay (Cornell University)

Edward Lui (Cornell University)

Rafael Pass (Cornell University)


Homomorphic Evaluation of the AES Circuit

Craig Gentry (IBM Research)

Shai Halevi (IBM Research)

Nigel P. Smart (University of Bristol, United Kingdom)


Functional Encryption with Bounded Collusions via Multi-Party Computation

Sergey Gorbunov (University of Toronto, Canada)

Vinod Vaikuntanathan (University of Toronto, Canada)

Hoeteck Wee (George Washington University)


On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups

Goichiro Hanaoka (RISEC, AIST, Japan)

Takahiro Matsuda (RISEC, AIST, Japan)

Jacob C.N. Schuldt (RISEC, AIST, Japan)


Tightly Secure Signatures and Public-Key Encryption

Dennis Hofheinz (Karlsruhe Institute of Technology, Germany)

Tibor Jager (Karlsruhe Institute of Technology, Germany)


An Enciphering Scheme Based on a Card Shuffle

Viet Tung Hoang (University of California, Davis)

Ben Morris (University of California, Davis)

Phillip Rogaway (University of California, Davis)


Breaking and Repairing GCM Security Proofs
Tetsu Iwata (Nagoya University, Japan)

Keisuke Ohashi (Nagoya University, Japan)

Kazuhiko Minematsu (NEC Corporation, Japan)


On the Security of TLS-DHE in the Standard Model

Tibor Jager (Ruhr-University, Germany)

Florian Kohlar (Ruhr-University, Germany)

Sven Schäge (University College London, UK)

Jörg Schwenk (Ruhr-University, Germany)


New Preimage Attacks Against Reduced SHA-1

Simon Knellwolf (ETH Zurich and FHNW, Switzerland)

Dmitry Khovratovich (Microsoft Research Redmond)


Tweakable Blockciphers with Beyond Birthday-Bound Security

Will Landecker (Portland State University)

Thomas Shrimpton (Portland State University)

Seth Terashima (Portland State University)


Public Keys

Arjen K. Lenstra (EPFL, Switzerland)

James P. Hughes (Self, Palo Alto)

Maxime Augier (EPFL, Switzerland)

Joppe W. Bos (EPFL, Switzerland)

Thorsten Kleinjung (EPFL, Switzerland)

Christophe Wachter (EPFL, Switzerland)


New Proof Methods for Attribute-Based Encryption: Achieving Full Security through Selective Techniques

Allison Lewko (University of Texas, Austin)

Brent Waters (University of Texas, Austin)


Group Signatures with Almost-for-free Revocation

Benoit Libert (UCL, Belgium)

Thomas Peters (UCL, Belgium)

Moti Yung (Google Inc. and Columbia University)


Black-Box Constructions of Composable Protocols without Set-Up

Huijia Rachel Lin (MIT and Boston University)

Rafael Pass (Cornell University)


Tamper and Leakage Resilience in the Split-State Model

Feng-Hao Liu (Brown University)

Anna Lysyanskaya (Brown University)


The Curious Case of Non-Interactive Commitments

Mohammad Mahmoody (Cornell University)

Rafael Pass (Cornell University)


Hash Functions Based on Three Permutations: A Generic Security Analysis

Bart Mennink (KU Leuven, Belgium)

Bart Preneel (KU Leuven, Belgium)


Substitution-permutation networks, pseudorandom functions, and Natural Proofs

Eric Miles (Northeastern University)

Emanuele Viola (Northeastern University)


A New Approach to Practical Active-Secure Two-Party Computation

Jesper Buus Nielsen (Aarhus University, Denmark)

Peter Sebastian Nordholt (Aarhus University, Denmark)

Claudio Orlandi (Bar-Ilan University, Israel)

Sai Sheshank Burra (Indian Institute of Technology, Guwahati, India)


Must you know the code of f to securely compute f?

Mike Rosulek (University of Montana)


Universal Composability From Essentially Any Trusted Setup

Mike Rosulek (University of Montana)


How to Compute under AC^0 Leakage without Secure Hardware

Guy Rothblum (Microsoft Research Silicon Valley)


Dynamic Credentials and Ciphertext Delegation for Attribute-Based Encryption

Amit Sahai (UCLA)

Hakan Seyalioglu (UCLA)

Brent Waters (University of Texas, Austin)


Stam's Conjecture and Threshold Phenomena in Collision Resistance

John Steinberger (Tsinghua University, Beijing, China)

Xiaoming Sun (Chinese Academy of Sciences, China)

Zhe Yang (Hulu, Beijing, China)


Functional Encryption for Regular Languages

Brent Waters (University of Texas, Austin)


Secure Identity-based Encryption in the Quantum Random Oracle Model

Mark Zhandry (Stanford University)