Accepted papers

• Revisiting Oblivious Top-k Selection with Applications to Secure k-NN Classification – Kelong Cong, Robin Geelen, Jiayi Kang, and Jeongeun Park
  
• Simulation Secure Multi-Input Quadratic Functional Encryption – Ferran Alborch Escobar, Sébastien Canard, and Fabien Laguillaumie
  
• Generation of Authenticated Secret-Shared Scaled Unit Vectors for Beaver Triples – Vincent Rieder
  
• Multi-Key Homomorphic Encryption with Threshold Re-Encryption – Akira Nakashima, Yukimasa Sugizaki, Hikaru Tsuchida, Takuya Hayashi, Koji Nuida, Kengo Mori, and Toshiyuki Isshiki
  
• Multi-User Dynamic Searchable Encryption for Prefix-Fixing Predicates from Symmetric-Key Primitives – Takato Hirano, Yutaka Kawai, Yoshihiro Koseki, Satoshi Yasuda, Yohei Watanabe, Takumi Amada, Mitsugu Iwamoto, and Kazuo Ohta
  
• BUFFing FALCON without Increasing the Signature Size – Samed Düzlü, Rune Fiedler, and Marc Fischlin
  
• SILBE: an Updatable Public Key Encryption Scheme from Lollipop Attacks – Max Duparc, Tako Boris Fouotsa, and Serge Vaudenay
  
• Towards Optimally Small Smoothness Bounds for Cryptographic-Sized Smooth Twins and their Isogeny-based Applications – Bruno Sterner
  
• Bias from Uniform Nonce: Revised Fourier Analysis-based Attack on ECDSA – Shunsuke Osaki and Noboru Kunihiro
  
• Multivariate Blind Signatures Revisited – Ward Beullens
  
• Post-Quantum Backdoor for Kyber-KEM – Wenwen Xia, Geng Wang, and Dawu Gu
  
• Identity-Based Encryption from Lattices with More Compactness in the Standard Model – Weidan Ji, Zhedong Wang, Haoxiang Jin, Qi Wang, Geng Wang, and Dawu Gu
  
• Oblivious Identity-based Encryption (IBE Secure Against an Adversarial KGC) – Katerina Mitrokotsa, Sayantan Mukherjee, and Jenit Tomy
  
• Generic Security of the Ascon Mode: On the Power of Key Blinding – Charlotte Lefevre and Bart Mennink
  
• Fast Parallelizable Misuse-Resistant Authenticated Encryption: Low Latency (Decryption-Fast) SIV – Mustafa Khairallah
  
• Provably Secure Online Authenticated Encryption and Bidirectional Online Channels – Arghya Bhattacharjee, Ritam Bhaumik, Daniel Collins, and Mridul Nandi
  
• Classical and Quantum Generic Attacks on 6-round Feistel Schemes – Maya Chartouny, Benoît Cogliati, and Jacques Patarin
  
• Weightwise (Almost) Perfectly Balanced Functions Based on Total Orders – Pierrick Méaux
  
• Generalized Triangular Dynamical System: An Algebraic System for Constructing Cryptographic Permutations over Finite Fields – Arnab Roy and Matthias Johann Steiner
  
• A Univariate Attack against the Limited-Data Instance of Ciminion – Augustin Bariant
  
• Improved Algebraic Attacks on Round-Reduced LowMC with Single-Data Complexity – Xingwei Ren, Yongqiang Li, and Mingsheng Wang
  
• Minimize the Randomness in Rasta-Like Designs: How Far Can We Go? Application to PASTA – Lorenzo Grassi, Fukang Liu, Christian Rechberger, Fabian Schmid, Roman Walch, and Qingju Wang
  
• Koala: A Low-Latency Pseudorandom Function – Yanis Belkheyar, Parisa Amiri Eliasi, Joan Daemen, Santosh Ghosh, Daniël Kuijsters, Alireza Mehrdad, Silvia Mella, Shahram Rasoolzadeh, and Gilles Van Assche
  
• Modular Multiplication in the AMNS representation : Hardware Implementation – Louis Noyez, Nadia El Mrabet, Olivier Potin, and Pascal Veron
  
• Train Wisely: Multifidelity Bayesian Optimization Hyperparameter Tuning in Deep Learning-based Side-Channel Analysis – Trevor Hong Eng Yap, Shivam Bhasin, and Léo Weissbart