Accepted Papers


        Adaptive and Concurrent Secure Computation from New Adaptive, Non-Malleable Commitments

        Dana Dachman-Soled, Tal Malkin, Mariana Raykova, and Muthuramakrishnan Venkitasubramaniam


        Behind the Scene of Side Channel Attacks

        Victor Lomne and Emmanuel Prouff and Thomas Roche


        Between a Rock and a Hard Place: Interpolating Between MPC and FHE

        Ashish Choudhury and Jake Loftus and Emmanuela Orsini and Arpita Patra and Nigel P. Smart


        Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

        Ivan Damgaard and Sebastian Faust and Pratyay Mukherjee and Daniele Venturi


        Building Lossy Trapdoor Functions from Lossy Encryption

        Brett Hemenway and Rafail Ostrovsky


        Computational Fuzzy Extractors

        Benjamin Fuller and Xianrui Meng and Leonid Reyzin


        Constant-Round Concurrent Zero Knowledge in the Bounded Player Model

        Vipul Goyal and Abhishek Jain and Rafail Ostrovsky and Silas Richelson and Ivan Visconti


        Constrained Pseudorandom Functions and Their Applications

        Dan Boneh and Brent Waters


        Constructing Confidential Channels from Authenticated Channels---Public-Key Encryption Revisited

        Sandro Coretti and Ueli Maurer and Bjoern Tackmann


        Cryptanalysis of HMAC/NMAC-Whirlpool

        Jian Guo and Yu Sasaki and Lei Wang and Shuang Wu


        Discrete Gaussian Leftover Hash Lemma over Infinite Domains

        Shweta Agrawal and Craig Gentry and Shai Halevi and Amit Sahai


       Does My Device Leak Information? An a priori Statistical Power Analysis of Leakage Detection Tests

        Luke Mather and Elisabeth Oswald and Joe Bandenburg and Marcin Wojcik


        Efficient General-Adversary Multi-Party Computation

        Martin Hirt and Daniel Tschudi


        Efficient One-Way Secret-Key Agreement and Private Channel Coding via Polarization

        Joseph M. Renes and Renato Renner and David Sutter


        Factoring RSA keys from certified smart cards: Coppersmith in the wild

        Daniel J. Bernstein and Yun-An Chang and Chen-Mou Cheng and Li-Ping Chou and Nadia Heninger and Tanja Lange and Nicko van Someren


        Fair and Efficient Secure Multiparty Computation with Reputation Systems

        Gilad Asharov and Yehuda Lindell and Hila Zarosim


        Families of fast elliptic curves from Q-curves

        Benjamin Smith


        Four-Dimensional GLV via the Weil Restriction

        Aurore Guillevic and Sorina Ionica


        Fully Homomorphic Message Authenticators

        Rosario Gennaro and Daniel Wichs


        Function-Private Subspace-Membership Encryption and Its Applications

        Dan Boneh and Ananth Raghunathan and Gil Segev


        Functional Encryption from (Small) Hardware Tokens

        Kai-Min Chung and Jonathan Katz and Hong-Sheng Zhou


        Generic Key Recovery Attack on Feistel Scheme

        Takanori Isobe and Kyoji Shibutani


        A Heuristic for Finding Compatible Differential Paths with Application to HAS-160

        Aleksandar Kircanski, Riham AlTawy and Amr M. Youssef


        Hiding the Input-Size in Secure Two-Party Computation

        Yehuda Lindell and Kobbi Nissim and Claudio Orlandi


        How to Construct an Ideal Cipher from a Small Set of Public Permutations

        Rodolphe Lampe and Yannick Seurin


       Improved Cryptanalysis of Reduced RIPEMD-160

       Florian Mendel and Thomas Peyrin and Martin Schlaeffer and Lei Wang and Shuang Wu


        Key-Invariant Bias in Block Ciphers

        Andrey Bogdanov and Christina Boura and Vincent Rijmen and Meiqin Wang and Long Wen and Jingyuan Zhao


        Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES^2

        Itai Dinur and Orr Dunkelman and Nathan Keller and Adi Shamir


      Lattice-Based Group Signatures with Logarithmic Signature Size

       Fabien Laguillaumie and Adeline Langlois and Benoit Libert and Damien Stehle


        Leaked-State-Forgery Attack Against The Authenticated Encryption Algorithm ALE

        Shengbao Wu and Hongjun Wu and Tao Huang and Mingsheng Wang and Wenling Wu


        Limited-birthday Distinguishers for Hash Functions: Collisions Beyond the Birthday Bound can be Meaningful

        Mitsugu Iwamoto and Thomas Peyrin and Yu Sasaki


        A Modular Framework for Building Variable-Input-Length Tweakable Ciphers

        Thomas Shrimpton and R. Seth Terashima


        Naturally Rehearsing Passwords

        Jeremiah Blocki and Manuel Blum and Anupam Datta


        New Approach to Chosen-Ciphertext Security of Leakage-Resilient Public-Key Encryption

        Baodong Qin and Shengli Liu


        New Generic Attacks Against Hash-based MACs

        Gaetan Leurent and Thomas Peyrin and Lei Wang


        New Insight into the Isomorphism of Polynomial Problem IP1S and its Use in Cryptography

        Gilles Macario-Rat and Jerome Plut and Henri Gilbert


        Non-uniform cracks in the concrete: the power of free precomputation

        Daniel J. Bernstein and Tanja Lange


       Notions of Black-Box Reductions, Revisited

        Paul Baecher and Christina Brzuska and Marc Fischlin


       On Continual Leakage of Discrete Log Representations

       Shweta Agrawal and Yevgeniy Dodis and Vinod Vaikuntanathan and Daniel Wichs


       On Diamond Structures and Trojan Message Attacks

       Tuomas Kortelainen and Juha Kortelainen


      On the Security of One-Witness Blind Signature Schemes

       Foteini Baldimtsi and Anna Lysyanskaya


      Parallelizable (Authenticated) Online Ciphers

      Elena Andreeva and Andrey Bogdanov and Atul Luykx and Bart Mennink and Elmar Tischhauser and Kan Yasuda


       Pseudorandom Generators from Regular One-way Functions: New Constructions with Improved Parameters

        Yu Yu and Xiangxue Li and Jian Weng


      Random Projections, Graph Sparsification, and Differential Privacy.

       Jalaj Upadhyay


      Reset Indifferentiability and its Consequences

      Paul Baecher and Christina Brzuska and Arno Mittelbach


      SCARE of Secret Ciphers with SPN Structures

       Matthieu Rivain and Thomas Roche


      Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique

       Luis T. A. N. Brandao


      Self-Updatable Encryption: Time Constrained Access Control with Hidden Attributes and Better Efficiency

       Kwangsu Lee and Seung Geol Choi and Dong Hoon Lee and Jong Hwan Park and Moti Yung


      SPHF-Friendly Non-Interactive Commitment Schemes

       Michel Abdalla and Fabrice Benhamouda and Olivier Blazy and Celine Chevalier and David Pointcheval


      Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces

      Charanjit Jutla and Arnab Roy


      Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes

       Helger Lipmaa


      Tamper Resilient Circuits: The Adversary at the Gates

       Aggelos Kiayias and Yiannis Tselekounis


       The Fiat--Shamir Transformation in a Quantum World

       Oezguer Dagdelen and Marc Fischlin and Tommaso Gagliardoni


       Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

       Ivan Damgaard and Alessandra Scafuro