Abstract is missing.
- Universally Composable End-to-End Secure MessagingRan Canetti, Palak Jain 0004, Marika Swanberg, Mayank Varia. 3-33 [doi]
- On the Insider Security of MLSJoël Alwen, Daniel Jost 0001, Marta Mularczyk. 34-68 [doi]
- Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More GeneralVadim Lyubashevsky, Ngoc Khanh Nguyen 0001, Maxime Plançon. 71-101 [doi]
- Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable - (Extended Abstract)Martin R. Albrecht, Valerio Cini, Russell W. F. Lai, Giulio Malavolta, Sri Aravinda Krishnan Thyagarajan. 102-132 [doi]
- Practical Sublinear Proofs for R1CS from LatticesNgoc Khanh Nguyen 0001, Gregor Seiler. 133-162 [doi]
- On the Impossibility of Key Agreements from Quantum Random OraclesPer Austrin, Hao Chung, Kai-Min Chung, Shiuan Fu, Yao-Ting Lin, Mohammad Mahmoody. 165-194 [doi]
- Succinct Classical Verification of Quantum ComputationJames Bartusek, Yael Tauman Kalai, Alex Lombardi, Fermi Ma, Giulio Malavolta, Vinod Vaikuntanathan, Thomas Vidick, Lisa Yang 0001. 195-211 [doi]
- On the Feasibility of Unclonable Encryption, and MorePrabhanjan Ananth, Fatih Kaleoglu, Xingjian Li 0006, Qipeng Liu, Mark Zhandry. 212-241 [doi]
- Shorter Hash-and-Sign Lattice-Based SignaturesThomas Espitau, Mehdi Tibouchi, Alexandre Wallet, Yang Yu 0008. 245-275 [doi]
- MuSig-L: Lattice-Based Multi-signature with Single-Round Online PhaseCecilia Boschini, Akira Takahashi 0002, Mehdi Tibouchi. 276-305 [doi]
- A New Framework for More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor SamplingRafaël Del Pino, Shuichi Katsumata. 306-336 [doi]
- Ofelimos: Combinatorial Optimization via Proof-of-Useful-Work - A Provably Secure Blockchain ProtocolMatthias Fitzi, Aggelos Kiayias, Giorgos Panagiotakos, Alexander Russell. 339-369 [doi]
- Practical Statistically-Sound Proofs of Exponentiation in Any GroupCharlotte Hoffmann, Pavel Hubácek, Chethan Kamath, Karen Klein, Krzysztof Pietrzak. 370-399 [doi]
- Formalizing Delayed Adaptive Corruptions and the Security of Flooding NetworksChristian Matt 0002, Jesper Buus Nielsen, Søren Eller Thomsen. 400-430 [doi]
- Batch Arguments for sfNP and More from Standard Bilinear Group AssumptionsBrent Waters, David J. Wu 0001. 433-463 [doi]
- Breaking Rainbow Takes a Weekend on a LaptopWard Beullens. 464-479 [doi]
- Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack ProblemKatharina Boudgoust, Erell Gachon, Alice Pellet-Mary. 480-509 [doi]
- On Codes and Learning with Errors over Function FieldsMaxime Bombar, Alain Couvreur, Thomas Debris-Alazard. 513-540 [doi]
- Syndrome Decoding in the Head: Shorter Signatures from Zero-Knowledge ProofsThibauld Feneuil, Antoine Joux, Matthieu Rivain. 541-572 [doi]
- Beyond the Csiszár-Korner Bound: Best-Possible Wiretap Coding via ObfuscationYuval Ishai, Alexis Korb, Paul Lou, Amit Sahai. 573-602 [doi]
- Correlated Pseudorandomness from Expand-Accumulate CodesElette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl. 603-633 [doi]
- Public-Key Watermarking Schemes for Pseudorandom FunctionsRupeng Yang, Zuoxia Yu, Man Ho Au, Willy Susilo. 637-667 [doi]
- CHIP and CRISP: Protecting All Parties Against Compromise Through Identity-Binding PAKEsCas Cremers, Moni Naor, Shahar Paz, Eyal Ronen. 668-698 [doi]
- Password-Authenticated Key Exchange from Group ActionsMichel Abdalla, Thorsten Eisenhofer, Eike Kiltz, Sabrina Kunzweiler, Doreen Riepel. 699-728 [doi]
- Efficient NIZKs and Signatures from Commit-and-Open Protocols in the QROMJelle Don, Serge Fehr, Christian Majenz, Christian Schaffner. 729-757 [doi]
- Locally Verifiable Signature and Key AggregationRishab Goyal, Vinod Vaikuntanathan. 761-791 [doi]
- Multimodal Private SignaturesKhoa Nguyen, Fuchun Guo, Willy Susilo, Guomin Yang. 792-822 [doi]