Accepted Papers

• Higher Order Masking of Look-up Tables

  Jean-Sebastien Coron (University of Luxembourg, Luxembourg)

• Efficient Round Optimal Blind Signatures

  Sanjam Garg (IBM Research, USA) and Divya Gupta (UCLA, USA)

• A Bound For Multiparty Secret Key Agreement And Implications For A Problem Of Secure Computing

  Himanshu Tyagi (University of California, San Diego, USA) and Shun Watanabe (University of Tokushima, Japan and University of Maryland, College Park, USA)

• Deja Q: Using Dual Systems to Revisit q-Type Assumptions

  Melissa Chase (MSR Redmond, USA) and Sarah Meiklejohn (UC San Diego, USA)

• Faster Compact Diffie-Hellman: Endomorphisms on the x-line

  Craig Costello (Microsoft Research, USA) and Huseyin Hisil (Yasar University, Turkey) and Benjamin Smith (Ecole Polytechnique and INRIA, France)

• Reconsidering Generic Composition

  Chanathip Namprempre (Thammasat University, Thailand) and Phillip Rogaway (University of California, Davis, USA) and Thomas Shrimpton (Portland State University, USA)

• Sometimes-Recurse Shuffle: Almost-Random Permutations in Logarithmic Expected Time

  Ben Morris (University of California, Davis, USA) and Phillip Rogaway (University of California, Davis, USA)

• Honey Encryption: Security Beyond the Brute-Force Bound

  Ari Juels (USA) and Thomas Ristenpart (University of Wisconsin - Madison, USA)

• Generic Universal Forgery Attack on Iterative Hash-based MACs

  Thomas Peyrin and Lei Wang (Nanyang Technological University, Singapore)

• Parallelizable Rate-1 Authenticated Encryption from Pseudorandom Functions

  Kazuhiko Minematsu (NEC Corporation, Japan)

• Universally Composable Symbolic Analysis for Two-Party Protocols based on Homomorphic Encryption

  Morten Dahl and Ivan Damgård (Department of Computer Science, Aarhus University, Denmark)

• Unifying leakage models: from probing attacks to noisy leakage

  Alexandre Duc (Ecole Polytechnique Fédérale de Lausanne, Switzerland) and Stefan Dziembowski (Warsaw University, Poland and Rome La Sapienza, Italy) and Sebastian Faust (Ecole Polytechnique Fédérale de Lausanne, Switzerland)

• Tight Security Bounds for Key-Alternating Ciphers

  Shan Chen and John Steinberger (Tsinghua University, China)

• On the Complexity of UC Commitments

  Juan A. Garay (Yahoo Labs, USA) and Yuval Ishai (Technion, Israel) and Ranjit Kumaresan (Technion, Israel) and Hoeteck Wee (CNRS and ENS, France)

• Dual System Encryption via Doubly Selective Security: Framework, Fully Secure Functional Encryption for Regular Languages, and More

  Nuttapong Attrapadung (AIST, Japan)

• Key-Versatile Signatures and Applications: RKA, KDM and Joint Enc/Sig

  Mihir Bellare (UCSD, USA), Sarah Meiklejohn (UCSD, USA), Susan Thomson (University of Bristol, UK)

• Protecting Obfuscation Against Algebraic Attacks

  Boaz Barak (Microsoft Research, USA) and Sanjam Garg (IBM Research, USA) and Yael Tauman Kalai (Microsoft Research, USA) and Omer Paneth (Boston University, USA) and Amit Sahai (University of California Los Angeles, USA)

• Symmetrized summation polynomials: using small order torsion points to speed up elliptic curve index calculus

  Jean-Charles Faugère (INRIA Paris-Rocquencourt PolSys Project, Sorbonne Universités UPMC Univ Paris 06, CNRS UMR 7606, LIP6, France), Louise Huot (Sorbonne Universités UPMC Univ Paris 06, INRIA Paris-Rocquencourt PolSys Project, CNRS UMR 7606, LIP6, France), Antoine Joux (CryptoExperts, Fondation UPMC, LIP6, France), Guénaël Renault (Sorbonne Universités UPMC Univ Paris 06, INRIA Paris-Rocquencourt PolSys Project, CNRS UMR 7606, LIP6, France), Vanessa Vitse (Institut Fourier, Université de Grenoble, France).

• Efficient Non-Malleable Codes and Key-Derivation for Poly-Size Tampering Circuits

  Sebastian Faust (EPFL, Switzerland) and Pratyay Mukherjee (Aarhus University, Denmark) and Daniele Venturi (Sapienza University, Italy) and Daniel Wichs (Northeastern, USA)

• Key Derivation Without Entropy Waste

  Yevgeniy Dodis (NYU, USA) and Krzysztof Pietrzak (IST, Austria) and Daniel Wichs (Northeastern, USA)

• Distributed Point Functions and Their Applications

  Niv Gilboa (Ben-Gurion University, Israel) and Yuval Ishai (Technion, Israel)

• Replacing a Random Oracle: Full Domain Hash From Indistinguishability Obfuscation

  Susan Hohenberger (Johns Hopkins University, USA) and Amit Sahai (UCLA, USA) and Brent Waters (University of Texas at Austin, USA)

• A Full Characterization of Completeness for Two-party Randomized Function Evaluation

  Daniel Kraschewski (Technion, Israel) and Hemanta K. Maji (UCLA, USA) and Manoj Prabhakaran (UIUC, USA) and Amit Sahai (UCLA, USA)

• GGHLite: More Efficient Multilinear Maps from Ideal Lattices

  Adeline Langlois (ENS de Lyon, France) and Damien Stehle (ENS de Lyon, France) and Ron Steinfeld (Monash University, Australia)

• Polynomial Time Attack on Wild McEliece Over Quadratic Extensions

  Alain Couvreur (INRIA and LIX, France) and Ayoub Otmani (Normandie Univ, France) and Jean-Pierre Tillich (INRIA, France)

• How to Certify the Leakage of a Chip?

  François Durvaux (UCL Crypto Group, Belgium) and François-Xavier Standaert (UCL Crypto Group, Belgium) and Nicolas Veyrat-Charvillon (IRISA-CAIRN, France)

• Identity-Based Encryption Secure Against Selective Opening Chosen-Ciphertext Attack

  Junzuo Lai (Jinan Unversity, China) and Robert H. Deng (Singapore Management University, Singapore) and Shengli Liu (Shanghai Jiao Tong University, China) Jian Weng (Jinan Unversity, China) and Yunlei Zhao (Fudan University, China)

• Why Proving HIBE Systems Secure is Difficult

  Allison Bishop Lewko (Columbia University, USA) and Brent Waters (University of Texas at Austin, USA)

• Non-Malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures

  Benoît Libert (Technicolor, France) and Thomas Peters (Université catholique de Louvain, Belgium) and Marc Joye (Technicolor, France) and Moti Yung (Google and Columbia University, USA)

• The Locality of Searchable Symmetric Encryption

  David Cash (Rutgers University, USA) and Stefano Tessaro (University of California, Santa Barbara, USA)

• Salvaging Indifferentiability in a Multi-stage Setting

  Arno Mittelbach (Technische Universität Darmstadt / CASED, Germany)

• Non-Interactive Secure Computation Based on Cut-and-Choose

  Arash Afshar (University of Calgary, Canada) and Payman Mohassel (University of Calgary, Canada) and Benny Pinkas (Bar Ilan University, Israel) and Ben Riva (Tel Aviv University, Israel)

• A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic

  Razvan Barbulescu (Université de Lorraine, France) and Pierrick Gaudry (CNRS Nancy, France) and Antoine Joux (CryptoExperts and Fondation Université Paris 6, France) and Emmanuel Thomé (INRIA Nancy, France)

• Links Between Truncated Differential and Multidimensional Linear Properties of Block Ciphers and Underlying Attack Complexities

  Céline Blondeau and Kaisa Nyberg (Department of Information and Computer Science, Aalto University School of Science, Finland)

• Revocable quantum timed-release encryption

  Dominique Unruh (University of Tartu, Estonia)

• Garbled RAM Revisited

  Craig Gentry (IBM, USA) and Shai Halevi (IBM, USA) and Steve Lu (UCLA, USA) and Rafail Ostrovsky (UCLA, USA) and Mariana Raykova (SRI, USA) and Daniel Wichs (Northeastern Univ., USA)

• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

  Dan Boneh (Stanford, USA) and Craig Gentry (IBM, USA) and Sergey Gorbunov (MIT, USA) and Shai Halevi (IBM, USA) and Valeria Nikolaenko (Stanford, USA) and Gil Segev (Hebrew University, Isarel) and Vinod Vaikuntanathan (MIT, USA) and Dhinakaran Vinayagamurthy (University of Toronto, Canada)

• Multi-Input Functional Encryption

  Shafi Goldwasser (MIT, USA and Weizmann, Israel) and S. Dov Gordon (Applied Communication Sciences) and Vipul Goyal (MSR India, India) and Abhishek Jain (MIT and BU, USA) and Jonathan Katz (University of Maryland, USA) and Feng-Hao Liu (University of Maryland, USA) and Amit Sahai (UCLA, USA) and Elaine Shi (University of Maryland, USA) and Hong-Sheng Zhou (Virginia Commonwealth University, USA)