Accepted Papers


  1. Using MILP in Analysis of Feistel Structures and Improving Type II GFS by Switching Mechanism
    Mahdi Sajadieh; Mohammad Vaziri
    Department of Electrical Engineering , Khorasgan Branch, Islamic Azad University, Isfahan, Iran; Department of Mathematics, Iran University of Science and Technology (IUST), Tehran, Iran
  2. Tools in analyzing linear approximation for Boolean functions related to FLIP
    Subhamoy Maitra; Bimal Mandal; Thor Martinsen; Dibyendu Roy; Pantelimon Stanica
    Indian Statistical Institute, Kolkata, India; Indian Statistical Institute, Kolkata, India; Naval Postgraduate School, Monterey, USA; National Institute of Science Education and Research, Bhubaneswar, India; Naval Postgraduate School, Monterey, USA
  3. A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem
    Ayan Mahalanobis; Vivek Mallick; Ansari Abdullah
    IISER, Pune; IISER, Pune; Savitribai Phule Pune University
  4. Tweakable HCTR: A BBB Secure Tweakable Enciphering Scheme
    Avijit Dutta; Mridul Nandi
    Indian Statistical Institute, Kolkata; Indian Statistical Institute, Kolkata
  5. Non-Interactive and Fully Output Expressive Private Comparison
    Yu Ishimaki; Hayato Yamana
    Waseda University; Waseda University
  6. Pairing-Friendly Twisted Hessian Curves
    Chitchanok Chuengsatiansup; Chloe Martindale
    INRIA and ENS de Lyon, France; Technische Universiteit Eindhoven, The Netherlands
  7. A faster way to the CSIDH
    Michael Meyer; Steffen Reith
    University of Applied Sciences Wiesbaden, Germany; University of Würzburg, Germany; University of Applied Sciences Wiesbaden, Germany
  8. Cryptanalysis of 2 round Keccak-384
    Rajendra Kumar; Nikhil Mittal; Shashank Singh
    Center for Cybersecurity, Indian Institute of Technology, Kanpur; Center for Cybersecurity, Indian Institute of Technology, Kanpur; Indian Institute of Science Education and Research Bhopal
  9. More Efficient Lattice PRFs from Keyed Pseudorandom Synthesizers
    Hart W. Montgomery
    Fujitsu Laboratories of America
  10. A Family of FDH Signature Schemes Based on the Quadratic Residuosity Assumption
    Giuseppe Ateniese; Katharina Fech; Bernardo Magri
    Stevens Institute of Technology; Friedrich-Alexander-University Erlangen-Nuremberg; Friedrich-Alexander-University Erlangen-Nuremberg
  11. Secure Computation with Constant Communication Overhead using Multiplication Embeddings
    Alexander R. Block; Hemanta K. Maji; Hai H. Nguyen
    Purdue University; Purdue University; Purdue University
  12. Non-malleable Codes against Lookahead Tampering
    Divya Gupta; Hemanta K. Maji; Mingyuan Wang
    Microsoft Research India; Purdue University; Purdue University
  13. A note on the security of CSIDH
    Jean-François Biasse; Annamaria Iezzi; Michael J. Jacobson Jr
    University of South Florida; University of South Florida; University of Calgary
  14. Constructing Canonical Strategies For Parallel Implementation Of Isogeny Based Cryptography
    Aaron Hutchinson; Koray Karabina
    Florida Atlantic University; Florida Atlantic University
  15. Obfuscation from Low Noise Multilinear Maps
    Nico Döttling; Sanjam Garg; Divya Gupta; Peihan Miao; Pratyay Mukherjee
    CISPA Helmholtz Center; UC Berkeley; MSR India; UC Berkeley; VISA Research
  16. Differential Fault Attack on SIMON with Very Few Faults
    Ravi Anand; Akhilesh Siddhanti; Subhamoy Maitra; Sourav Mukhopadhyay
    Department of Mathematics, Indian Institute of Technology, Kharagpur, India; Department of Mathematics, Goa Campus, BITS Pilani, Zuarinagar, Goa, India; Applied Statistics Unit, Indian Statistical Institute, Kolkata, India; Department of Mathematics, Indian Institute of Technology, Kharagpur, India
  17. On Diffusion Layers Of SPN Based Format Preserving Encryption Schemes: Format Preserving Sets Revisited
    Rana Barua; Kishan Chand Gupta; Sumit Kumar Pandey; Indranil Ghosh Ray
    Indian Statistical Institute, Kolkata, India; Indian Statistical Institute, Kolkata, India; Ashoka University, Sonepat, India; City, University of London, UK
  18. Reconsidering Generic Composition: the Tag-then-Encrypt case
    Francesco Berti; Olivier Pereira; Thomas Peters
    ICTEAM/ELEN/Crypto Group, Université Catholique de Louvain; ICTEAM/ELEN/Crypto Group, Université Catholique de Louvain; ICTEAM/ELEN/Crypto Group, Université Catholique de Louvain
  19. Revisiting Single-server Algorithms for Outsourcing Modular Exponentiation
    Jothi Rangasamy; Lakshmi Kuppusamy
    Society for Electronic Transactions and Security (SETS), Chennai, India; Society for Electronic Transactions and Security (SETS), Chennai, India
  20. Keyword Search Meets Membership Testing: Adaptive Security from SXDH
    Sanjit Chatterjee; Sayantan Mukherjee
    Indian Institute of Science, Bangalore; Indian Institute of Science, Bangalore