Abstract is missing.
- The Randomized Slicer for CVPP: Sharper, Faster, Smaller, BatchierLéo Ducas, Thijs Laarhoven, Wessel P. J. van Woerden. 3-36 [doi]
- Tweaking the Asymmetry of Asymmetric-Key Cryptography on Lattices: KEMs and Signatures of Smaller SizesJiang Zhang, Yu Yu 0001, Shuqin Fan, Zhenfeng Zhang, Kang Yang. 37-65 [doi]
- MPSign: A Signature from Small-Secret Middle-Product Learning with ErrorsShi Bai, Dipayan Das 0001, Ryo Hiromasa, Miruna Rosca, Amin Sakzad, Damien Stehlé, Ron Steinfeld, Zhenfei Zhang. 66-93 [doi]
- Witness Indistinguishability for Any Single-Round Argument with Applications to Access ControlZvika Brakerski, Yael Kalai. 97-123 [doi]
- Boosting Verifiable Computation on Encrypted DataDario Fiore, Anca Nitulescu, David Pointcheval. 124-154 [doi]
- Lossy CSI-FiSh: Efficient Signature Scheme with Tight Reduction to Decisional CSIDH-512Ali El Kaafarani, Shuichi Katsumata, Federico Pintore. 157-186 [doi]
- Threshold Schemes from Isogeny AssumptionsLuca De Feo, Michael Meyer. 187-212 [doi]
- Topology-Hiding Computation for Networks with Unknown DelaysRio LaVigne, Chen-Da Liu Zhang, Ueli Maurer, Tal Moran, Marta Mularczyk, Daniel Tschudi. 215-245 [doi]
- Sublinear-Round Byzantine Agreement Under Corrupt MajorityT.-H. Hubert Chan, Rafael Pass, Elaine Shi. 246-265 [doi]
- Bandwidth-Efficient Threshold EC-DSAGuilhem Castagnos, Dario Catalano, Fabien Laguillaumie, Federico Savasta, Ida Tucker. 266-296 [doi]
- Blazing Fast OT for Three-Round UC OT ExtensionRan Canetti, Pratik Sarkar, Xiao Wang. 299-327 [doi]
- Going Beyond Dual Execution: MPC for Functions with Efficient VerificationCarmit Hazay, Abhi Shelat, Muthuramakrishnan Venkitasubramaniam. 328-356 [doi]
- Mon$\mathbb {Z}_{2^{k}}$a: Fast Maliciously Secure Two Party Computation on $\mathbb {Z}_{2^{k}}$Dario Catalano, Mario Di Raimondo, Dario Fiore, Irene Giacomelli. 357-386 [doi]
- Generic Authenticated Key Exchange in the Quantum Random Oracle ModelKathrin Hövelmanns, Eike Kiltz, Sven Schäge, Dominique Unruh. 389-422 [doi]
- Threshold Ring Signatures: New Definitions and Post-quantum SecurityAbida Haque, Alessandra Scafuro. 423-452 [doi]
- Tight and Optimal Reductions for Signatures Based on Average Trapdoor Preimage Sampleable Functions and Applications to Code-Based SignaturesAndré Chailloux, Thomas Debris-Alazard. 453-479 [doi]
- Faster Cofactorization with ECM Using Mixed RepresentationsCyril Bouvier, Laurent Imbert. 483-504 [doi]
- Improved Classical Cryptanalysis of SIKE in PracticeCraig Costello, Patrick Longa, Michael Naehrig, Joost Renes, Fernando Virdia. 505-534 [doi]
- A Short-List of Pairing-Friendly Curves Resistant to Special TNFS at the 128-Bit Security LevelAurore Guillevic. 535-564 [doi]
- Privacy-Preserving Authenticated Key Exchange and the Case of IKEv2Sven Schäge, Jörg Schwenk, Sebastian Lauer. 567-596 [doi]
- Linearly-Homomorphic Signatures and Scalable Mix-NetsChloé Hébant, Duong Hieu Phan, David Pointcheval. 597-627 [doi]
- Efficient Redactable Signature and Application to Anonymous CredentialsOlivier Sanders. 628-656 [doi]