Abstract is missing.
- Lower Bounds on Anonymous WhistleblowingWilly Quach, LaKyah Tyner, Daniel Wichs. 3-32 [doi]
- Anonymous Permutation RoutingPaul Bunn, Eyal Kushilevitz, Rafail Ostrovsky. 33-61 [doi]
- Non-Interactive Anonymous Router with Quasi-Linear Router ComputationRex Fernando, Elaine Shi, Pratik Soni, Nikhil Vanjani, Brent Waters. 62-92 [doi]
- Multi-instance Randomness Extraction and Security Against Bounded-Storage Mass SurveillanceJiaxin Guan, Daniel Wichs, Mark Zhandry. 93-122 [doi]
- Efficiently Testable Circuits Without ConductivityMirza Ahad Baig, Suvradip Chakraborty, Stefan Dziembowski, Malgorzata Galazka, Tomasz Lizurej, Krzysztof Pietrzak. 123-152 [doi]
- Immunizing Backdoored PRGsMarshall Ball, Yevgeniy Dodis, Eli Goldin. 153-182 [doi]
- Communication Lower Bounds of Key-Agreement Protocols via Density Increment ArgumentsMi-Ying (Miryam) Huang, Xinyu Mao, Guangxu Yang, Jiapeng Zhang. 185-206 [doi]
- Searching for ELFs in the Cryptographic ForestMarc Fischlin, Felix Rohrbach. 207-236 [doi]
- On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash FunctionsAkshima, Xiaoqi Duan, Siyao Guo, Qipeng Liu 0001. 237-270 [doi]
- On the Cost of Post-compromise Security in Concurrent Continuous Group-Key AgreementBenedikt Auerbach, Miguel Cueto Noval, Guillermo Pascual-Perez, Krzysztof Pietrzak. 271-300 [doi]
- Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without PreprocessingBenedikt Auerbach, Charlotte Hoffmann, Guillermo Pascual-Perez. 301-330 [doi]
- Holographic SNARGs for P and Batch-NP from (Polynomially Hard) Learning with ErrorsSusumu Kiyoshima. 333-362 [doi]
- Chainable Functional Commitments for Unbounded-Depth CircuitsDavid Balbás, Dario Catalano, Dario Fiore 0001, Russell W. F. Lai. 363-393 [doi]
- Multilinear Schwartz-Zippel Mod N and Lattice-Based Succinct ArgumentsBenedikt Bünz, Ben Fisch. 394-423 [doi]
- Generalized Special-Sound Interactive Proofs and Their Knowledge SoundnessThomas Attema, Serge Fehr, Nicolas Resch. 424-454 [doi]
- From Polynomial IOP and Commitments to Non-malleable zkSNARKsAntonio Faonio, Dario Fiore 0001, Markulf Kohlweiss, Luigi Russo, Michal Zajac 0001. 455-485 [doi]
- How to Compile Polynomial IOP into Simulation-Extractable SNARKs: A Modular ApproachMarkulf Kohlweiss, Mahak Pancholi, Akira Takahashi 0002. 486-512 [doi]