Abstract is missing.
- Unique-Path Identity Based Encryption with Applications to Strongly Secure MessagingPaul Rösler, Daniel Slamanig, Christoph Striecks. 3-34 [doi]
- End-to-End Secure Messaging with Traceability Only for Illegal ContentJames Bartusek, Sanjam Garg, Abhishek Jain 0002, Guru-Vamsi Policharla. 35-66 [doi]
- Asymmetric Group Message Franking: Definitions and ConstructionsJunzuo Lai, Gongxian Zeng, Zhengan Huang, Siu-Ming Yiu, Xin Mu, Jian Weng 0001. 67-97 [doi]
- Password-Authenticated TLS via OPAQUE and Post-Handshake AuthenticationJulia Hesse, Stanislaw Jarecki, Hugo Krawczyk, Christopher Wood. 98-127 [doi]
- Randomized Half-Ideal Cipher on Groups with Applications to UC (a)PAKEBruno Freitas Dos Santos, Yanqi Gu, Stanislaw Jarecki. 128-156 [doi]
- End-to-End Encrypted Zoom Meetings: Proving Security and Strengthening LivenessYevgeniy Dodis, Daniel Jost 0001, Balachandar Kesavan, Antonio Marcedone. 157-189 [doi]
- Caveat Implementor! Key Recovery Attacks on MEGAMartin R. Albrecht, Miro Haller, Lenka Mareková, Kenneth G. Paterson. 190-218 [doi]
- Finding Many Collisions via Reusable Quantum Walks - Application to Lattice SievingXavier Bonnetain, André Chailloux, André Schrottenloher, Yixin Shen 0001. 221-251 [doi]
- Just How Hard Are Rotations of $\mathbb {Z}^n$? Algorithms and Cryptography with the Simplest LatticeHuck Bennett, Atul Ganju, Pura Peetathawatchai, Noah Stephens-Davidowitz. 252-281 [doi]
- M-SIDH and MD-SIDH: Countering SIDH Attacks by Masking InformationTako Boris Fouotsa, Tomoki Moriya, Christophe Petit 0001. 282-309 [doi]
- Disorientation Faults in CSIDHGustavo Banegas, Juliane Krämer, Tanja Lange 0001, Michael Meyer 0001, Lorenz Panny, Krijn Reijnders, Jana Sotáková, Monika Trimoska. 310-342 [doi]
- On the Hardness of the Finite Field Isomorphism ProblemDipayan Das 0001, Antoine Joux. 343-359 [doi]
- New Time-Memory Trade-Offs for Subset Sum - Improving ISD in Theory and PracticeAndre Esser, Floyd Zweydinger. 360-390 [doi]
- A New Algebraic Approach to the Regular Syndrome Decoding Problem and Implications for PCG ConstructionsPierre Briaud, Morten Øygarden. 391-422 [doi]
- An Efficient Key Recovery Attack on SIDHWouter Castryck, Thomas Decru. 423-447 [doi]
- A Direct Key Recovery Attack on SIDHLuciano Maino, Chloe Martindale, Lorenz Panny, Giacomo Pope, Benjamin Wesolowski. 448-471 [doi]
- Breaking SIDH in Polynomial TimeDamien Robert 0001. 472-503 [doi]
- A Lower Bound on the Length of Signatures Based on Group Actions and Generic IsogeniesDan Boneh, Jiaxin Guan, Mark Zhandry. 507-531 [doi]
- Short Signatures from Regular Syndrome Decoding in the HeadEliana Carozza, Geoffroy Couteau, Antoine Joux. 532-563 [doi]
- The Return of the SDitHCarlos Aguilar Melchor, Nicolas Gama, James Howe, Andreas Hülsing, David Joseph, Dongze Yue. 564-596 [doi]
- Chopsticks: Fork-Free Two-Round Multi-signatures from Non-interactive AssumptionsJiaxin Pan, Benedikt Wagner. 597-627 [doi]
- Threshold and Multi-signature Schemes from Linear Hash FunctionsStefano Tessaro, Chenzhi Zhu. 628-658 [doi]
- New Algorithms for the Deuring Correspondence - Towards Practical and Secure SQISign SignaturesLuca De Feo, Antonin Leroux, Patrick Longa, Benjamin Wesolowski. 659-690 [doi]
- Revisiting BBS SignaturesStefano Tessaro, Chenzhi Zhu. 691-721 [doi]
- Non-interactive Blind Signatures for Random MessagesLucjan Hanzlik. 722-752 [doi]
- Rai-Choo! Evolving Blind Signatures to the Next LevelLucjan Hanzlik, Julian Loss, Benedikt Wagner. 753-783 [doi]