Accepted Papers

• Revisiting the Gentry-Szydlo Algorithm
  Hendrik W. Lenstra; Alice Silverberg
  Universiteit Leiden; University of California, Irvine

• New and Improved Key-Homomorphic Pseudorandom Functions
  Abhishek Banerjee; Chris Peikert
  Georgia Institute of Technology; Georgia Institute of Technology

• FleXOR: Flexible garbling for XOR gates that beats free-XOR
  Vladimir Kolesnikov; Payman Mohassel; Mike Rosulek
  Bell Labs; University of Calgary; Oregon State University

• Dishonest Majority Multi-Party Computation for Binary Circuits
  Enrique Larraia; Emmanuela Orsini; Nigel P. Smart
  University of Bristol; University of Bristol; University of Bristol

• Amplifying Privacy in Privacy Amplification
  Divesh Aggarwal; Yevgeniy Dodis; Zahra Jafargholi; Eric Miles; Leonid Reyzin
  New York University; New York University; Northeastern University; Northeastern University; Boston University

• Faster Bootstrapping with Polynomial Error
  Jacob Alperin-Sheriff; Chris Peikert
  Georgia Institute of Technology; Georgia Institute of Technology

• Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
  Dan Boneh; Mark Zhandry
  Stanford University; Stanford University

• Single-shot security for one-time memories in the isolated qubits model
  Yi-Kai Liu
  National Institute of Standards and Technology (NIST)

• Round-Efficient Black-Box Construction of Composable Multi-Party Computation
  Susumu Kiyoshima
  NTT

• Hardness of k-LWE and Applications in Traitor Tracing
  San Ling; Duong Hieu Phan; Damien StehlÈ; Ron Steinfeld
  Nanyang Technological University; University of Paris VIII; …cole Normale SupÈrieure de Lyon; Monash University

• Minimizing the Two-Round Even-Mansour Cipher
  Shan Chen; Rodolphe Lampe; Jooyoung Lee; Yannick Seurin; John P. Steinberger
  Tsinghua University, P.R. China; University of Versailles, France; Sejong University, Seoul, Korea; ANSSI, France;

• Tight security bounds for multiple encryption
  Yuanxi Dai; Jooyoung Lee; Bart Mennink; John Steinberger
  Tsinghua University; Sejong University; KU Leuven; Tsinghua University

• RSA Key Extraction via Low-Bandwidth Acoustic Cryptanalysis
  Daniel Genkin; Adi Shamir; Eran Tromer
  Technion and Tel Aviv University; Weizmann Institute of Science; Tel Aviv University

• Switching Lemma for Bilinear Tests and Constant-size NIZK Proofs for Linear Subspaces
  Charanjit S. Jutla; Arnab Roy
  IBM TJ Watson Research Center; Fujitsu Laboratories of America

• Low Overhead Broadcast Encryption from Multilinear Maps
  Dan Boneh; Brent Waters; Mark Zhandry
  Stanford University; University of Texas at Austin; Stanford University

• On the Communication Complexity of Secure Computation
  Deepesh Data; Manoj M. Prabhakaran; Vinod M. Prabhakaran
  Tata Institute of Fundamental Research, Mumbai; University of Illinois, Urbana-Champaign; Tata Institute of Fundamental Research, Mumbai

• Structure-Preserving Signatures from Type II Pairings
  Masayuki Abe; Jens Groth; Miyako Ohkubo; Mehdi Tibouchi
  NTT Secure Platform Laboratories; University College London; NICT; NTT Secure Platform Laboratories

• On the Impossibility of Cryptography with Tamperable Randomness
  Per Austrin; Kai-Min Chung; Mohammad Mahmoody; Rafael Pass; Karn Seth
  KTH Royal Institute of Technology; Academia Sinica; University of Virginia; Cornell University; Cornell University

• Secure Multi-Party Computation with Identifiable Abort
  Yuval Ishai; Rafail Ostrovsky; Vassilis Zikas
  Technion; UCLA; UCLA

• How to Eat Your Entropy and Have it Too -- Optimal Recovery Strategies for Compromised RNGs
  Yevgeniy Dodis; Adi Shamir; Noah Stephens-Davidowitz; Daniel Wichs
  New York University; Weizmann Institute; New York University; Northeastern University

• On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
  Sanjam Garg; Craig Gentry; Shai Halevi; Daniel Wichs
  IBM; IBM; IBM; Northeastern Unviersity

• Memento: How to Reconstruct your Secrets from a Single Password in a Hostile Environment
  Jan Camenisch; Anja Lehmann; Anna Lysyanskaya; Gregory Neven
  IBM Research Zurich; IBM Research Zurich; Brown University; IBM Research Zurich

• Quantum position verification in the random oracle model
  Dominique Unruh
  University of Tartu

• Scalable Zero Knowledge via Cycles of Elliptic Curves
  Eli Ben-Sasson; Alessandro Chiesa; Eran Tromer; Madars Virza
  Technion; MIT; Tel Aviv University; MIT

• The Exact PRF-Security of NMAC and HMAC
  Peter Gazi; Krzysztof Pietrzak; Michal Ryb·r
  IST Austria; IST Austria; IST Austria

• Block Ciphers - Focus On The Linear Layer (feat. PRIDE)
  Martin R. Albrecht; Benedikt Driessen; Elif Bilge Kavun; Gregor Leander; Christof Paar; Tolga Yalcin
  DTU Compute; Infineon; HGI, Ruhr University Bochum; HGI, Ruhr University Bochum; HGI, Ruhr University Bochum; UIST, Macedonia

• Self-bilinear Map on Unknown Order Groups from Indistinguishability Obfuscation and Its Applications
  Takashi Yamakawa; Shota Yamada; Goichiro Hanaoka; Noboru Kunihiro
  The University of Tokyo; The University of Tokyo; RISEC, AIST; The University of Tokyo

• Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity
  Ran Canetti; Abhishek Jain; Omer Paneth
  Boston University and Tel-Aviv University; Boston University and MIT; Boston University

• Witness Encryption from Instance Independent Assumptions
  Craig Gentry; Allison B. Lewko; Brent Waters
  IBM Research; Columbia University; University of Texas at Austin

• Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations
  Gottfried Herold; Julia Hesse; Dennis Hofheinz; Carla R‡fols Salvador; Andy Rupp
  Horst Görtz Institute for IT Security and Faculty of Mathematics, Ruhr-Universität Bochum; Karlsruhe Institute of Technology; Karlsruhe Institute of Technology; Horst Görtz Institute for IT Security and Faculty of Mathematics, Ruhr-Universität Bochum; Karlsruhe Institute of Technology

• Non-Interactive Secure Multiparty Computation
  Amos Beimel; Ariel Gabizon; Yuval Ishai; Eyal Kushilevitz; Sigurd Meldgaard; Anat Paskin-Cherniavsky
  BGU; Technion; Technion; Technion; Google Aarhus; UCLA

• Automated Analysis of Cryptographic Assumptions in Generic Group Models
  Gilles Barthe; Edvard Fagerholm; Dario Fiore; John C. Mitchell; Andre Scedrov; Benedikt Schmidt
  IMDEA Software Institute; University of Pennsylvania; IMDEA Software Institute; Stanford University; University of Pennsylvania; IMDEA Software Institute

• The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
  Nir Bitansky; Ran Canetti; Henry Cohn; Shafi Goldwasser; Yael Tauman Kalai; Omer Paneth; Alon Rosen
  Tel Aviv University; Boston University and Tel Aviv University; Microsoft Research; MIT and the Weizmann Institute of Science; Microsoft Research; Boston University; IDC Herzliya

• Improved Short Lattice Signatures in the Standard Model
  Leo Ducas; Daniele Micciancio
  University of California San Diego; University of California San Diego

• Related Key Security for Pseudorandom Functions Beyond the Linear Barrier
  Michel Abdalla; Fabrice Benhamouda; Alain PasselËgue; Kenneth G. Paterson
  École Normale Supérieure; École Normale Supérieure; École Normale Supérieure; Royal Holloway, University of London

• Security of symmetric encryption against mass surveillance
  Mihir Bellare; Kenneth G. Paterson; Phillip Rogaway
  University of California, San Diego, USA; Royal Holloway, University of London, UK; University of California, Davis, USA

• Optimal Non-Perfect Uniform Secret Sharing Schemes
  Oriol Farràs; Torben Hansen; Tarik Kaced and Carles Padró
  Universitat Rovira i Virgili; Aarhus University; The Chinese University of Hong Kong; Nanyang Technological University

• Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources
  Christina Brzuska; Pooya Farshim; Arno Mittelbach
  Tel-Aviv University, Israel; Darmstadt University of Technology, Germany; Darmstadt University of Technology, Germany

• Homomorphic Signatures with Efficient Verification for Polynomial Functions
  Dario Catalano; Dario Fiore; Bogdan Warinschi
  University of Catania; IMDEA Software Institute; University of Bristol

• Improved Generic Attacks Against Hash-based MACs and HAIFA
  Itai Dinur; GaÎtan Leurent
  ENS; Inria

• Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups
  Masayuki Abe; Jens Groth; Miyako Ohkubo; Takeya Tango
  Secure Platform Laboratories, NTT Corporation, Japan; University College London, UK; Security Architecture Lab, NSRI, NICT, Japan; Kyoto University

• Efficient Three-Party Computation from Cut-and-Choose
  Seung Geol Choi; Jonathan Katz; Alex J. Malozemoff; Vassilis Zikas
  United States Naval Academy; University of Maryland; University of Maryland; UCLA

• Cryptography with Streaming Algorithms
  Periklis A. Papakonstantinou; Guang Yang
  ITCS, Tsinghua University; ITCS, Tsinghua University

• Leakage-Tolerant Computation with Input-Independent Preprocessing
  Nir Bitansky; Dana Dachman-Soled; Huijia Lin
  Tel Aviv University; University of Maryland; University of California Santa Barbara

• Feasibility and Infeasibility of Secure Computation with Malicious PUFs
  Dana Dachman-Soled; Nils Fleischhacker; Jonathan Katz; Anna Lysyanskaya; Dominique Schröder
  University of Maryland; Saarland University; University of Maryland; Brown University; Saarland University

• (Hierarchical) Identity-Based Encryption from Affine Message Authentication
  Olivier Blazy; Eike Kiltz; Jiaxin Pan
  Ruhr University Bochum; Ruhr University Bochum; Ruhr University Bochum

• Algorithms in HElib
  Shai Halevi; Victor Shoup
  IBM; NYU

• Physical Zero-Knowledge Proofs of Physical Properties
  Ben Fisch; Daniel Freund; Moni Naor
  Weizmann Institute of Science, Columbia University; Weizmann Institute of Science, Center for Applied Math at Cornell University; Weizmann Institute of Science

• Cryptography from Compression Functions: The UCE Bridge to the ROM
  Mihir Bellare; Viet Tung Hoang; Sriram Keelveedhi
  University of California San Diego; University of California San Diego; None

• Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in $\F_{2^{4 \cdot 1223}}$ and $\F_{2^{12 \cdot 367}}$)
  Robert Granger; Thorsten Kleinjung; Jens Zumbragel
  LACAL, EPFL; LACAL, EPFL; Institute of Algebra, TU Dresden

• Updates on Generic Attacks against HMAC and NMAC
  Jian Guo; Thomas Peyrin; Yu Sasaki; Lei Wang
  Nanyang Technological University, Singapore; Nanyang Technological University, Singapore; NTT Secure Platform Laboratories, Japan; Nanyang Technological University, Singapore

• On Virtual Grey Box Obfuscation for General Circuits
  Nir Bitansky; Ran Canetti; Yael Tauman Kalai; Omer Paneth
  Tel Aviv University; Boston University and Tel Aviv University; Microsoft Research; Boston University

• How to Use Bitcoin to Design Fair Protocols
  Iddo Bentov; Ranjit Kumaresan
  Technion; Technion

• Maliciously circuit private FHE
  Rafail Ostrovsky; Anat Paskin-Cherniavsky; Beni Paskin-Cherniavsky
  UCLA; UCLA; NONE

• Amortizing Garbled Circuits
  Yan Huang; Jonathan Katz; Vladimir Kolesnikov; Ranjit Kumaresan; Alex J. Malozemoff
  University of Maryland; University of Maryland; Bell Labs; Technion; University of Maryland

• Cut-and-Choose Yao-Based Two-Party Computation With Low Cost in the Online/Offline and Batch Settings
  Yehuda Lindell; Ben Riva
  Bar-Ilan University; Bar-Ilan University

• Interactive Proofs under Continual Memory Leakage
  Prabhanjan Ananth; Vipul Goyal; Omkant Pandey
  UCLA; Microsoft Research India; UIUC

• Security Analysis of Multilinear Maps over the Integers
  Hyung Tae Lee; Jae Hong Seo
  Nanyang Technological University; Myongji University

• Indistinguishability Obfuscation from Semantically-Secure Multi-linear Encodings
  Rafael Pass; Karn Seth; Sidharth Telang
  Cornell University/ Cornell NYC Tech; Cornell University; Cornell University