IACR Logo

List of Accepted Papers



  1. 1. Mersenne factorization factory
    Thorsten Kleinjung; Joppe W. Bos; Arjen K. Lenstra
    EPFL IC LACAL; NXP Semiconductors; EPFL IC LACAL
  2. 2. Automatic Security Evaluation and (Related-key) Differential Characteristic Search: Application to SIMON, PRESENT, LBlock, DES(L) and Other Bit-oriented Block Ciphers
    Siwei Sun; Lei Hu; Peng Wang; Kexin Qiao; Xiaoshuang Ma; Ling Song
    State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; Data Assurance and Communication Security Research Center, Chinese Academy of Sciences; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; Data Assurance and Communication Security Research Center, Chinese Academy of Sciences; State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences; Data Assurance and Communication Security Research Center, Chinese Academy of Sciences
  3. 3. Multi-Valued Byzantine Broadcast: the t < n Case
    Martin Hirt; Pavel Raykov
    ETH Zurich; ETH Zurich
  4. 4. Simulatable Leakage: Analysis, Pitfalls, and new Constructions
    Jake Longo Galea; Daniel P. Martin; Elisabeth Oswald; Daniel Page; Martijn Stam; Michael J. Tunstall
    University of Bristol; University of Bristol; University of Bristol; University of Bristol; University of Bristol; Cryptography Research Inc.
  5. 5. Jacobian Coordinates on Genus 2 Curves
    Huseyin Hisil; Craig Costello
    Yasar University, Turkey; Microsoft Research, Redmond, USA
  6. 6. Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation
    Ran Cohen; Yehuda Lindell
    Bar-Ilan University; Bar-Ilan University
  7. 7. Multi-target DPA attacks: Pushing DPA beyond the limits of a desktop computer
    Luke Mather; Elisabeth Oswald; Carolyn Whitnall
    University of Bristol; University of Bristol; University of Bristol
  8. 8. Actively Secure Private Function Evaluation
    Payman Mohassel; Saeed Sadeghian; Nigel P. Smart
    University of Calgary and Yahoo! Labs; University of Calgary; University of Bristol
  9. 9. Composable Security of Delegated Quantum Computation
    Vedran Dunjko; Joseph F. Fitzsimons; Christopher Portmann; Renato Renner
    University of Edinburgh and Ruder Boskovic Institute; Singapore University of Technology and Design and National University of Singapore; ETH Zurich and University of Geneva; ETH Zurich
  10. 10. Secret-Sharing for NP
    Ilan Komargodski; Moni Naor; Eylon Yogev
    Weizmann Institute; Weizmann Institute; Weizmann Institute
  11. 11. Multi-user collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE
    Pierre-Alain Fouque; Antoine Joux; Chrysanthi Mavromati
    Université Rennes 1, France and Institut Universitaire de France, France; CryptoExperts, France and Chaire de Cryptologie de la Fondation Partenariale de l’UPMC Laboratoire d’Informatique de Paris 6, UPMC Sorbonne Universités, France; Sogeti/ESEC R&D Lab, France and Université de Versailles Saint-Quentin-en-Yvelines, France
  12. 12. Tweaks and Keys for Block Ciphers: the TWEAKEY Framework
    Jérémy Jean; Ivica Nikolić; Thomas Peyrin
    Nanyang Technological University, Singapore; Nanyang Technological University, Singapore; Nanyang Technological University, Singapore
  13. 13. Structure-Preserving Signatures on Equivalence Classes and their Application to Anonymous Credentials
    Christian Hanser; Daniel Slamanig
    IAIK, Graz University of Technology; IAIK, Graz University of Technology
  14. 14. Forging Attacks on two Authenticated Encryptions Schemes COBRA and POET
    Mridul Nandi
    Indian Statistical Institute, Kolkata
  15. 15. Low Probability Differentials and the Cryptanalysis of Full-Round CLEFIA-128
    Sareh Emami; San Ling; Ivica Nikolić; Josef Pieprzyk; Huaxiong Wang
    Macquarie University, Australia; Nanyang Technological University, Singapore; Nanyang Technological University, Singapore; Queensland University of Technology, Australia; Nanyang Technological University, Singapore
  16. 16. Order-Preserving Encryption Secure Beyond One-Wayness
    Isamu Teranishi; Moti Yung; Tal Malkin;
    NEC; Google; Columbia University
  17. 17. XLS is not a Strong Pseudorandom Permutation
    Mridul Nandi
    Indian Statistical Institute, Kolkata
  18. 18. Homomorphic Authenticated Encryption Secure Against Chosen-Ciphertext Attack
    Chihong Joo; Aaram Yun
    Ulsan National Institute of Science and Technology (UNIST), Republic of Korea; Ulsan National Institute of Science and Technology (UNIST), Republic of Korea
  19. 19. Bivariate Polynomials Modulo Composites and their Applications
    Dan Boneh; Henry Corrigan-Gibbs
    Stanford University; Stanford University
  20. 20. Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite Fields
    Antoine Joux; Cécile Pierrot
    CryptoExperts and Chaire de Cryptologie de la Fondation de l'UPMC, Laboratoire d'Informatique de Paris 6, UPMC Sorbonnes Universités, France; CNRS, DGA, INRIA and Laboratoire d'Informatique de Paris 6, UPMC Sorbonnes Universités, France
  21. 21. On the Enumeration of Double-Base Chains with Applications to Elliptic Curve Cryptography
    Christophe Doche
    Macquarie University
  22. 22. Solving LPN Using Covering Codes
    Qian Guo; Thomas Johansson; Carl Löndahl
    Dept. of Electrical and Information Technology, Lund University, Lund, Sweden & School of Computer Science, Fudan University, Shanghai, China; Dept. of Electrical and Information Technology, Lund University, Lund, Sweden; Dept. of Electrical and Information Technology, Lund University, Lund, Sweden
  23. 23. All-But-Many Encryption: A New Framework for Fully-Equipped UC Commitments
    Eiichiro Fujisaki
    NTT Labs
  24. 24. Black-Box Separations for One-More (Static) CDH and Its Generalization
    Jiang Zhang; Zhenfeng Zhang; Yu Chen; Yanfei Guo; Zongyang Zhang
    Institute of Software, Chinese Academy of Sciences, China; Institute of Software, Chinese Academy of Sciences, China; Institute of Information Engineering, Chinese Academy of Sciences, China; Institute of Software, Chinese Academy of Sciences, China; National Institute of Advanced Industrial Science and Technology, Japan
  25. 25. GLV/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures With Single-Bit Nonce Bias
    Diego F. Aranha; Pierre-Alain Fouque; Benoît Gérard; Jean-Gabriel Kammerer; Mehdi Tibouchi; Jean-Christophe Zapalowicz
    Institute of Computing, University of Campinas; Université Rennes 1 and Institut Universitaire de France; DGA.MI, Rennes and IRISA; DGA.MI, Rennes and IRMAR, Université Rennes 1; NTT Secure Platform Laboratories; INRIA
  26. 26. Adaptive Security of Constrained PRFs
    Georg Fuchsbauer; Momchil Konstantinov; Krzysztof Pietrzak; Vanishree Rao
    IST Austria; London School of Geometry and Number Theory; IST Austria; UCLA
  27. 27. Meet-in-the-Middle Attacks on Generic Feistel Constructions
    Jian Guo; Jérémy Jean; Ivica Nikolić; Yu Sasaki
    Nanyang Technological University; Nanyang Technological University; Nanyang Technological University; NTT Secure Platform Laboratories
  28. 28. Soft Analytical Side-Channel Attacks
    Nicolas Veyrat-Charvillon; Benoît Gérard; François-Xavier Standaert
    IRISA-CAIRN; DGA Maîtrise de l'Information; UCL Crypto Group
  29. 29. Efficient, Oblivious Data Structures for MPC
    Marcel Keller; Peter Scholl
    University of Bristol; University of Bristol
  30. 30. Kummer strikes back: new DH speed records
    Daniel J. Bernstein; Chitchanok Chuengsatiansup; Tanja Lange; Peter Schwabe
    University of Illinois at Chicago and Technische Universiteit Eindhoven; Technische Universiteit Eindhoven; Technische Universiteit Eindhoven; Radboud University Nijmegen
  31. 31. Authenticating Computation on Groups: New Homomorphic Primitives and Applications
    Dario Catalano; Antonio Marcedone; Orazio Puglisi
    University of Catania; University of Catania, Scuola Superiore di Catania; University of Catania
  32. 32. Beyond 2^{c/2} Security in Sponge-Based Authenticated Encryption Modes
    Philipp Jovanovic; Atul Luykx; Bart Mennink
    Universität Passau, Germany; KU Leuven, Belgium; KU Leuven, Belgium
  33. 33. Memory-Demanding Password Scrambling
    Christian Forler; Stefan Lucks; Jakob Wenzel
    Bauhaus-Universität Weimar; Bauhaus-Universität Weimar; Bauhaus-Universität Weimar
  34. 34. Concise Multi-Challenge CCA-Secure Encryption and Signatures with Almost Tight Security
    Benoit Libert; Marc Joye; Moti Yung; Thomas Peters
    Ecole Normale Superieure de Lyon (France); Technicolor; Google and Columbia University (USA); Universite catholique de Louvain (Belgium)
  35. 35. Cryptanalysis of Iterated Even-Mansour Schemes with Two Keys
    Itai Dinur; Orr Dunkelman; Nathan Keller; Adi Shamir
    ENS, Paris, France; Computer Science Department, University of Haifa, Israel; Department of Mathematics, Bar-Ilan University, Israel; Computer Science department, The Weizmann Institute, Rehovot, Israel
  36. 36. On Tight Security Proofs for Schnorr Signatures
    Nils Fleischhacker; Tibor Jager; Dominique Schröder
    Saarland University; Ruhr-University Bochum; Saarland University
  37. 37. Compact VSS and Efficient Homomorphic UC Commitments
    Ivan Damgård; Bernardo David; Irene Giacomelli; Jesper Buus Nielsen
    Aarhus University; Aarhus University; Aarhus University; Aarhus University
  38. 38. Bootstrapping Obfuscators via Fast Pseudorandom Functions
    Benny Applebaum
    Tel Aviv University
  39. 39. Masks will Fall Off: Higher-Order Optimal Distinguishers
    Nicolas Bruneau; Sylvain Guilley; Annelie Heuser; Olivier Rioul
    Telecom ParisTech, STMicroelectronics; Telecom ParisTech, Secure-IC S.A.S.; Telecom ParisTech; Telecom ParisTech
  40. 40. Cryptographic Schemes Based on the ASASA Structure: Black-box, White-box, and Public-key
    Alex Biryukov; Charles Bouillaguet; Dmitry Khovratovich
    University of Luxembourg; University of Lille-1, France; University of Luxembourg
  41. 41. Efficient Identity-Based Encryption over NTRU Lattices
    Leo Ducas; Vadim Lyubashevsky; Thomas Prest
    University of California, San Diego; Ecole Normale Superieure, INRIA.; Ecole Normale Superieure, Thales Communications & Security
  42. 42. Side-Channel Analysis of Multiplications in $GF(2^{128})$: Application to AES-GCM
    Sonia Belaïd; Pierre-Alain Fouque; Benoît Gérard
    Ecole Normale Supérieure and Thales Communications and Security; Université de Rennes 1 and Institut Universitaire de France; DGA-MI and IRISA
  43. 43. Algebraic Attack against Variants of McEliece with Goppa Polynomial of a Special Form
    Jean-Charles Faugère; Ludovic Perret,; Fréderic de Portzamparc
    Inria/UPMC/CNRS; UPMC/Inria/CNRS; Gemalto/Inria/UPMC/CNRS
  44. 44. Higher-Order Threshold Implementations
    Begül Bilgin; Benedikt Gierlichs; Svetla Nikova; Ventzislav Nikov; Vincent Rijmen
    KU Leuven, UTwente; KU Leuven; KU Leuven; NXP Semiconductors; KU Leuven
  45. 45. Black-Box Separations for Differentially Private Protocols
    Dakshita Khurana; Hemanta K. Maji; Amit Sahai
    UCLA; UCLA; UCLA
  46. 46. Square Span Programs with Applications to Succinct NIZK Arguments
    George Danezis; Jens Groth; Cedric Fournet; Markulf Kohlweiss
    University College London; University College London; Microsoft Research; Microsoft Research
  47. 47. Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
    Mihir Bellare; Igors Stepanovs; Stefano Tessaro
    UC San Diego; UC San Diego; UC Santa Barbara
  48. 48. Using Indistinguishability Obfuscation via UCEs
    Christina Brzuska; Arno Mittelbach
    Tel-Aviv University; Darmstadt University of Technology, Germany
  49. 49. Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
    Fabrice Benhamouda; Jan Camenisch; Stephan Krenn; Vadim Lyubashevsky; Gregory Neven
    ENS Paris; IBM Research - Zurich; IBM Research - Zurich; ENS Paris and INRIA; IBM Research - Zurich
  50. 50. Indistinguishability Obfuscation versus Multi-Bit Point Obfuscation with Auxiliary Input
    Christina Brzuska; Arno Mittelbach
    Tel-Aviv University; Darmstadt University of Technology, Germany
  51. 51. How to Securely Release Unverified Plaintext in Authenticated Encryption
    Elena Andreeva; Andrey Bogdanov; Atul Luykx; Bart Mennink; Nicky Mouha; Kan Yasuda
    KU Leuven and iMinds, Belgium; Department of Mathematics, Technical University of Denmark, Denmark.; KU Leuven and iMinds, Belgium; KU Leuven and iMinds, Belgium; KU Leuven and iMinds, Belgium; NTT Secure Platform Laboratories, Japan.
  52. 52. Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
    Stanislaw Jarecki; Aggelos Kiayias; Hugo Krawczyk
    UC Irvine; National and Kapodistrian University of Athens; IBM Research
  53. 53. Scrutinizing and Improving Impossible Differential Attacks: Applications to CLEFIA, Camellia, LBlock and Simon
    Christina Boura; María Naya-Plasencia; Valentin Suder
    University of Versailles; Inria; Inria
  54. 54. A Simplified Representation of AES
    Henri Gilbert
    ANSSI
  55. 55. Statistically-secure ORAM with $¥tilde{O}(¥log^2 n)$ Overhead
    Kai-Min Chung; Zhenming Liu; Rafael Pass
    Academia Sinica; Princeton University; Cornell NYC Tech