Accepted Papers

Applications

  1. Delayed Authentication: Preventing Replay and Relay Attacks in Private Contact Tracing

    Krzysztof Pietrzak (IST Austria)

  2. Proof-of-Reputation Blockchain with Nakamoto Fallback

    Leonard Kleinrock (UCLA), Rafail Ostrovsky (UCLA), and Vassilis Zikas (University of Edinburgh)

  3. Transciphering, using FiLIP and TFHE for an efficient delegation of computation

    Clément Hoffmann (Université catholique de Louvain), Pierrick Méaux (Université catholique de Louvain), Thomas Ricosset (Thales)

  4. Encrypted Key-Value Stores

    Archita Agarwal (Brown University) and Seny Kamara (Brown University)

Formal Methods

  1. Formal Verification of Fair Exchange based on Bitcoin Smart Contracts

    Cheng Shi (Ibaraki University) and Kazuki Yoneyama (Ibaraki University)

  2. Certified Compilation for Cryptography: Extended x86 Instructions and Constant-Time Verification

    José Bacelar Almeida (Universidade do Minho), Manuel Barbosa (Universidade do Porto), Gilles Barthe (Max Planck Institute for Security and Privacy), Vincent Laporte (Université de Lorraine), and Tiago Oliveira (Universidade do Porto)

  3. Protocol Analysis with Time

    Damián Aparicio-Sánchez (Universitat Politècnica de València), Santiago Escobar (Universitat Politècnica de València), Catherine Meadows (Naval Research Laboratory), José Meseguer (University of Illinois at Urbana-Champaign), and Julia Sapiña (Universitat Politècnica de València)

  4. Verifpal: Cryptographic Protocol Analysis for the Real World

    Nadim Kobeissi (Symbolic Software), Georgio Nicolas (Symbolic Software), and Mukesh Tiwari (University of Melbourne)

Implementing Elliptic Curve Cryptography

  1. On the Worst-Case Side-Channel Security of ECC Point Randomization in Embedded Devices

    Melissa Azouaoui (Université catholique de Louvain; NXP Semiconductors), François Durvaux (Université catholique de Louvain; Silex Insight), Romain Poussier (Nanyang Technological University), François-Xavier Standaert (Université catholique de Louvain), Kostas Papagiannopoulos (NXP Semiconductors), and Vincent Verneuil (NXP Semiconductors)

  2. Efficient Hardware Implementations for Elliptic Curve Cryptography over Curve448

    Mojtaba Bisheh Niasar (Florida Atlantic University), Reza Azarderakhsh (Florida Atlantic University; PQSecure Technologies), and Mehran Mozaffari Kermani (University of South Florida)

  3. Extending the Signed Non-zero Bit and Sign-Aligned Columns Methods to General Bases for Use in Cryptography

    Abhraneel Dutta (Florida Atlantic University), Aaron Hutchinson (University of Waterloo), and Koray Karabina (National Research Council Canada)

Ciphers and Cryptanalysis

  1. Cryptanalysis of the permutation based algorithm SpoC

    Liliya Kraleva (KU Leuven), Raluca Posteuca (KU Leuven), and Vincent Rijmen (KU Leuven; University of Bergen)

  2. More Glimpses of the RC4 Internal State Array

    Pranab Chakraborty (Wipro Limited) and Subhamoy Maitra (Indian Statistical Institute)

  3. Mixture Integral Attacks on Reduced-Round AES with a Known/Secret S-Box

    Lorenzo Grassi (Radboud University; Graz University of Technology) and Markus Schofnegger (Graz University of Technology)

  4. Counting Active S-Boxes is not Enough

    Orr Dunkelman (University of Haifa), Abhishek Kumar (Indian Institute of Technology Ropar), Eran Lambooij (University of Haifa), and Somitra Kumar Sanadhya (Indian Institute of Technology Ropar)

  5. Computing Expected Differential Probability of (Truncated) Differentials and Expected Linear Potential of (Multidimensional) Linear Hulls in SPN Block Ciphers

    Maria Eichlseder (Ruhr University Bochum; Graz University of Technology), Gregor Leander (Ruhr University Bochum), and Shahram Rasoolzadeh (Ruhr University Bochum)

Quantum Cryptanalysis

  1. Quantum Cryptanalysis on Contracting Feistel Structures and Observation on Related-key settings

    Carlos Cid (University of London; Simula UiB), Akinori Hosoyamada (NTT Secure Platform Laboratories), Yunwen Liu (National University of Defense Technology), and Siang Meng Sim (DSO National Laboratories)

  2. Evaluation of Quantum Cryptanalysis on SPECK

    Ravi Anand (Indian Institute of Technology Kharagpur), Arpita Maitra (TCG Centres for Research and Education in Science and Technology), and Sourav Mukhopadhyay (Indian Institute of Technology Kharagpur)

Learning With Errors

  1. Making the BKW Algorithm Practical for LWE

    Alessandro Budroni (University of Bergen), Qian Guo (Lund University; University of Bergen), Thomas Johansson (Lund University), Erik Mårtensson (Lund University), and Paul Stankovski Wagner (Lund University)

  2. On a dual/hybrid approach to small secret LWE

    Thomas Espitau (NTT Corporation), Antoine Joux (Sorbonne Université and Université de Paris; CISPA Helmholtz Center for Information Security Saarbrücken), and Natalia Kharchenko (Sorbonne Université)

Encryption and Signatures

  1. Adaptively secure Threshold Symmetric-key Encryption

    Pratyay Mukherjee (Visa Research)

  2. Vetted Encryption

    Martha Norberg Hovd (Simula UiB; University of Bergen) and Martijn Stam (Simula UiB)

  3. Security of Public Key Encryption against Resetting Attacks

    Juliane Krämer (Technische Universität Darmstadt) and Patrick Struck (Technische Universität Darmstadt)

  4. The Multi-Base Discrete Logarithm Problem

    Mihir Bellare (University of California San Diego) and Wei Dai (University of California San Diego)

  5. Skipping the q in Group Signatures

    Olivier Blazy (Université de Limoges) and Saqib A. Kakvi (Bergische Universität Wuppertal)

  6. Incremental Cryptography Revisited: PRFs, Nonces and Modular Design

    Vivek Arte (University of California San Diego), Mihir Bellare (University of California San Diego), and Louiza Khati (ANSSI)

Functional Encryption

  1. Gadget-Based iNTRU Lattice Trapdoors

    Nicholas Genise (SRI International) and Baiyu Li (University of California San Diego)

  2. Lattice-based IBE with Equality Test Supporting Flexible Authorization in the Standard Model

    Giang Linh Duc Nguyen (Futurify Software Development), Willy Susilo (University of Wollongong), Dung Hoang Duong (University of Wollongong), Huy Quoc Le (University of Wollongong; CSIRO Data61), and Fuchun Guo (University of Wollongong)

  3. Efficient Attribute-based Proxy Re-Encryption with Constant Size Ciphertexts

    Arinjita Paul (Indian Institute of Technology Madras), S. Sharmila Deva Selvi (Indian Institute of Technology Madras), and C. Pandu Rangan (Indian Institute of Technology Madras)

  4. Adaptive-Secure Identity-Based Inner-Product Functional Encryption and its Leakage-Resilience

    Linru Zhang (The University of Hong Kong), Xiangning Wang (The University of Hong Kong), Yuechen Chen (The University of Hong Kong), and Siu-Ming Yiu (The University of Hong Kong)

  5. CCA-Secure ABE using Tag and Pair Encoding

    Olivier Blazy (University of Limoges) and Sayantan Mukherjee (University of Limoges)

  6. Simpler Constructions of Asymmetric Primitives from Obfuscation

    Pooya Farshim (University of York), Georg Fuchsbauer (TU Wien), and Alain Passelègue (Inria and ENS Lyon)

Secure Multi-Party Computation

  1. Adaptive Security of Practical Garbling Schemes

    Zahra Jafargholi (Sepior) and Sabine Oechsner (Aarhus University)

  2. Constructive t-secure Homomorphic Secret Sharing for Low Degree Polynomials

    Kittiphop Phalakarn (The University of Tokyo), Vorapong Suppakitpaisarn (The University of Tokyo), Nuttapong Attrapadung (National Institute of Advanced Industrial Science and Technology), and Kanta Matsuura (The University of Tokyo)

  3. Perfectly-Secure Asynchronous MPC for General Adversaries (Extended Abstract)

    Ashish Choudhury (International Institute of Information Technology Bangalore) and Nikhil Pappu (International Institute of Information Technology Bangalore)

  4. Improving the Efficiency of Optimally-Resilient Statistically-Secure Asynchronous Multi-Party Computation

    Ashish Choudhury (International Institute of Information Technology Bangalore)

  5. High Throughput Secure MPC Over Small Population in Hybrid Networks (Extended Abstract)

    Ashish Choudhury (International Institute of Information Technology Bangalore) and Aditya Hegde (International Institute of Information Technology Bangalore)

Non-Interactive Zero-Knowledge Proofs

  1. Dual-Mode NIZKs: Possibility and Impossibility Results for Property Transfer

    Vivek Arte (University of California San Diego) and Mihir Bellare (University of California San Diego)

  2. On Black-Box Extension of a Non-Interactive Zero-Knowledge Proof System for Secret Equality

    Kyosuke Yamashita (Kyoto University; National Institute of Advanced Industrial Science and Technology), Mehdi Tibouchi (Kyoto University; NTT Corporation), and Masayuki Abe (Kyoto University; NTT Corporation)