Abstract is missing.
- Rigorous Foundations for Dual Attacks in Coding TheoryCharles Meyer-Hilfiger, Jean-Pierre Tillich. 3-32 [doi]
- On the Multi-user Security of LWE-Based NIKERoman Langrehr. 33-62 [doi]
- Ideal-SVP is Hard for Small-Norm Uniform Prime IdealsJoël Felderhoff, Alice Pellet-Mary, Damien Stehlé, Benjamin Wesolowski. 63-92 [doi]
- Revocable Cryptography from Learning with ErrorsPrabhanjan Ananth, Alexander Poremba, Vinod Vaikuntanathan. 93-122 [doi]
- Pseudorandomness with Proof of Destruction and ApplicationsAmit Behera, Zvika Brakerski, Or Sattath, Omri Shmueli. 125-154 [doi]
- Semi-quantum Copy-Protection and MoreCéline Chevalier, Paul Hermouet, Quoc Huy Vu. 155-182 [doi]
- Weakening Assumptions for Publicly-Verifiable DeletionJames Bartusek, Dakshita Khurana, Giulio Malavolta, Alexander Poremba, Michael Walter. 183-197 [doi]
- Public-Key Encryption with Quantum KeysKhashayar Barooti, Alex B. Grilo, Loïs Huguenin-Dumittan, Giulio Malavolta, Or Sattath, Quoc Huy Vu, Michael Walter. 198-227 [doi]
- Publicly Verifiable Deletion from Minimal AssumptionsFuyuki Kitagawa, Ryo Nishimaki, Takashi Yamakawa. 228-245 [doi]
- One-Out-of-Many Unclonable Cryptography: Definitions, Constructions, and MoreFuyuki Kitagawa, Ryo Nishimaki. 246-275 [doi]
- Limits in the Provable Security of ECDSA SignaturesDominik Hartmann, Eike Kiltz. 279-309 [doi]
- Round-Robin is Optimal: Lower Bounds for Group Action Based ProtocolsDaniele Cozzo, Emanuele Giunta. 310-335 [doi]
- (Verifiable) Delay Functions from Lucas SequencesCharlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Tomás Krnák. 336-362 [doi]
- Algebraic Group Model with Oblivious SamplingHelger Lipmaa, Roberto Parisella, Janno Siim. 363-392 [doi]
- Zombies and Ghosts: Optimal Byzantine Agreement in the Presence of Omission FaultsJulian Loss, Gilad Stern. 395-421 [doi]
- Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, RevisitedRan Cohen, Pouyan Forghani, Juan A. Garay, Rutvik Patel, Vassilis Zikas. 422-451 [doi]
- Simplex Consensus: A Simple and Fast Consensus ProtocolBenjamin Y. Chan, Rafael Pass. 452-479 [doi]
- Agile Cryptography: A Universally Composable ApproachChristian Badertscher, Michele Ciampi, Aggelos Kiayias. 480-509 [doi]
- Composable Long-Term Security with RewindingRobin Berger, Brandon Broadnax, Michael Klooß, Jeremias Mechler, Jörn Müller-Quade, Astrid Ottenhues, Markus Raiber. 510-541 [doi]