Abstract is missing.
- PI-Cut-Choo and Friends: Compact Blind Signatures via Parallel Instance Cut-and-Choose and MoreRutchathon Chairattana-Apirom, Lucjan Hanzlik, Julian Loss, Anna Lysyanskaya, Benedikt Wagner. 3-31 [doi]
- Augmented Random OraclesMark Zhandry. 35-65 [doi]
- To Label, or Not To Label (in Generic Groups)Mark Zhandry. 66-96 [doi]
- Lower Bound on SNARGs in the Random Oracle ModelIftach Haitner, Daniel Nukrai, Eylon Yogev. 97-127 [doi]
- Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short CollisionsCody Freitag, Ashrujit Ghoshal, Ilan Komargodski. 131-160 [doi]
- On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård HashingAshrujit Ghoshal, Ilan Komargodski. 161-191 [doi]
- Time-Space Lower Bounds for Finding Collisions in Merkle-Damgård Hash FunctionsAkshima, Siyao Guo, Qipeng Liu. 192-221 [doi]
- Sustained Space and Cumulative Complexity Trade-Offs for Data-Dependent Memory-Hard FunctionsJeremiah Blocki, Blake Holman. 222-251 [doi]
- Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement ProtocolsShahar P. Cohen, Moni Naor. 252-281 [doi]
- Accelerating the Delfs-Galbraith Algorithm with Fast Subfield Root DetectionMaria Corte-Real Santos, Craig Costello, Jia Shi. 285-314 [doi]
- Secret Can Be Public: Low-Memory AEAD Mode for High-Order MaskingYusuke Naito 0001, Yu Sasaki, Takeshi Sugawara 0001. 315-345 [doi]
- Partial Key Exposure Attacks on BIKE, Rainbow and NTRUAndre Esser, Alexander May 0001, Javier A. Verbel, Weiqiang Wen. 346-375 [doi]
- Improving Support-Minors Rank Attacks: Applications to Gđisplaystyle eMSS and RainbowJohn Baena, Pierre Briaud, Daniel Cabarcas, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel. 376-405 [doi]
- *-Round Game-Theoretically-Fair Leader ElectionIlan Komargodski, Shin'ichiro Matsuo, Elaine Shi, Ke Wu. 409-438 [doi]
- Gossiping for Communication-Efficient BroadcastGeorgios Tsimos, Julian Loss, Charalampos Papamanthou. 439-469 [doi]
- Nearly Optimal Property Preserving HashingJustin Holmgren, Minghao Liu 0010, LaKyah Tyner, Daniel Wichs. 473-502 [doi]
- Collision-Resistance from Multi-Collision-ResistanceRon D. Rothblum, Prashant Nalini Vasudevan. 503-529 [doi]
- Post-quantum Simulatable Extraction with Minimal Assumptions: Black-Box and Constant-RoundNai-Hui Chia, Kai-Min Chung, Xiao Liang, Takashi Yamakawa. 533-563 [doi]
- The Gap Is Sensitive to Size of Preimages: Collapsing Property Doesn't Go Beyond Quantum Collision-Resistance for Preimages Bounded Hash FunctionsShujiao Cao, Rui Xue 0001. 564-595 [doi]
- New Constructions of Collapsing HashesMark Zhandry. 596-624 [doi]
- Statistically Sender-Private OT from LPN and DerandomizationNir Bitansky, Sapir Freizeit. 625-653 [doi]
- Constructive Post-Quantum ReductionsNir Bitansky, Zvika Brakerski, Yael Tauman Kalai. 654-683 [doi]
- Differential Cryptanalysis in the Fixed-Key ModelTim Beyne, Vincent Rijmen. 687-716 [doi]
- Simplified MITM Modeling for Permutations: New (Quantum) AttacksAndré Schrottenloher, Marc Stevens 0001. 717-747 [doi]
- Constructing and Deconstructing Intentional Weaknesses in Symmetric CiphersChristof Beierle, Tim Beyne, Patrick Felke, Gregor Leander. 748-778 [doi]
- Simon's Algorithm and Symmetric Crypto: Generalizations and Automatized ApplicationsFederico Canale, Gregor Leander, Lukas Stennes. 779-808 [doi]