Abstract is missing.
- Secure Quantum Computation with Classical CommunicationJames Bartusek. 1-30 [doi]
- Secure Software Leasing from Standard AssumptionsFuyuki Kitagawa, Ryo Nishimaki, Takashi Yamakawa. 31-61 [doi]
- Post-quantum Resettably-Sound Zero KnowledgeNir Bitansky, Michael Kellner, Omri Shmueli. 62-89 [doi]
- Secure Software Leasing Without AssumptionsAnne Broadbent, Stacey Jeffery, Sébastien Lord, Supartha Podder, Aarthi Sundaram. 90-120 [doi]
- The Round Complexity of Quantum Zero-KnowledgeOrestis Chardouvelis, Giulio Malavolta. 121-148 [doi]
- Rate-1 Quantum Fully Homomorphic EncryptionOrestis Chardouvelis, Nico Döttling, Giulio Malavolta. 149-176 [doi]
- Unifying Presampling via Concentration BoundsSiyao Guo, Qian Li, Qipeng Liu, Jiapeng Zhang. 177-208 [doi]
- Quantum Key-Length ExtensionJoseph Jaeger, Fang Song, Stefano Tessaro. 209-239 [doi]
- Relationships Between Quantum IND-CPA NotionsTore Vincent Carstens, Ehsan Ebrahimi, Gelo Noel Tabia, Dominique Unruh. 240-272 [doi]
- Classical Binding for Quantum CommitmentsNir Bitansky, Zvika Brakerski. 273-298 [doi]
- Unclonable Encryption, RevisitedPrabhanjan Ananth, Fatih Kaleoglu. 299-329 [doi]
- Somewhere Statistical Soundness, Post-Quantum Security, and SNARGsYael Tauman Kalai, Vinod Vaikuntanathan, Rachel Yun Zhang. 330-368 [doi]
- Black-Box Impossibilities of Obtaining 2-Round Weak ZK and Strong WI from Polynomial HardnessSusumu Kiyoshima. 369-400 [doi]
- Tight Security Bounds for Micali's SNARGsAlessandro Chiesa, Eylon Yogev. 401-434 [doi]
- Acyclicity Programming for Sigma-ProtocolsMasayuki Abe, Miguel Ambrona, Andrej Bogdanov, Miyako Ohkubo, Alon Rosen. 435-465 [doi]
- Statistical ZAPs from Group-Based AssumptionsGeoffroy Couteau, Shuichi Katsumata, Elahe Sadeghi, Bogdan Ursu. 466-498 [doi]
- Generalized Proofs of Knowledge with Fully Dynamic SetupChristian Badertscher, Daniel Jost 0001, Ueli Maurer. 499-528 [doi]
- Fully-Succinct Publicly Verifiable Delegation from Constant-Size AssumptionsAlonso-González, Alexandros Zacharakis. 529-557 [doi]
- On Expected Polynomial Runtime in CryptographyMichael Klooß. 558-590 [doi]
- Information-Theoretically Secure MPC Against Mixed Dynamic AdversariesIvan Damgård, Daniel Escudero 0001, Divya Ravi. 591-622 [doi]
- Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous FallbackGiovanni Deligios, Martin Hirt, Chen-Da Liu Zhang. 623-653 [doi]
- Two-Round Maliciously Secure Computation with Super-Polynomial SimulationAmit Agarwal, James Bartusek, Vipul Goyal, Dakshita Khurana, Giulio Malavolta. 654-685 [doi]
- Adaptive Security of Multi-party Protocols, RevisitedMartin Hirt, Chen-Da Liu Zhang, Ueli Maurer. 686-716 [doi]
- On Actively-Secure Elementary MPC ReductionsBenny Applebaum, Aarushi Goel. 717-749 [doi]
- Environmentally Friendly Composable Multi-party Computation in the Plain Model from Standard (Timed) AssumptionsBrandon Broadnax, Jeremias Mechler, Jörn Müller-Quade. 750-781 [doi]