Abstract is missing.
- Single-Server Private Information Retrieval with Sublinear Amortized TimeHenry Corrigan-Gibbs, Alexandra Henzinger, Dmitry Kogan. 3-33 [doi]
- Anamorphic Encryption: Private Communication Against a DictatorGiuseppe Persiano, Duong Hieu Phan, Moti Yung. 34-63 [doi]
- A PCP Theorem for Interactive Proofs and ApplicationsGal Arnon, Alessandro Chiesa, Eylon Yogev. 64-94 [doi]
- Group Signatures and More from Isogenies and Lattices: Generic, Simple, and EfficientWard Beullens, Samuel Dobson, Shuichi Katsumata, Yi-Fu Lai, Federico Pintore. 95-126 [doi]
- Asymmetric PAKE with Low Computation and communicationBruno Freitas Dos Santos, Yanqi Gu, Stanislaw Jarecki, Hugo Krawczyk. 127-156 [doi]
- Batch-OT with Optimal RateZvika Brakerski, Pedro Branco 0005, Nico Döttling, Sihang Pu. 157-186 [doi]
- Adaptively Secure Computation for RAM ProgramsLaasya Bangalore, Rafail Ostrovsky, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam. 187-216 [doi]
- Optimal Broadcast Encryption and CP-ABE from Evasive Lattice AssumptionsHoeteck Wee. 217-241 [doi]
- Embedding the UC Model into the IITM ModelDaniel Rausch 0001, Ralf Küsters, Céline Chevalier. 242-272 [doi]
- Zero-Knowledge IOPs with Linear-Time Prover and Polylogarithmic-Time VerifierJonathan Bootle, Alessandro Chiesa, Siqi Liu. 275-304 [doi]
- Non-Interactive Zero-Knowledge Proofs with Fine-Grained SecurityYuyu Wang 0001, Jiaxin Pan. 305-335 [doi]
- On Succinct Non-interactive Arguments in Relativized WorldsMegan Chen, Alessandro Chiesa, Nicholas Spooner. 336-366 [doi]
- Families of SNARK-Friendly 2-Chains of Elliptic CurvesYoussef El Housni, Aurore Guillevic. 367-396 [doi]
- Fiat-Shamir Bulletproofs are Non-Malleable (in the Algebraic Group Model)Chaya Ganesh, Claudio Orlandi, Mahak Pancholi, Akira Takahashi 0002, Daniel Tschudi. 397-426 [doi]
- Gemini: Elastic SNARKs for Diverse EnvironmentsJonathan Bootle, Alessandro Chiesa, Yuncong Hu, Michele Orrù. 427-457 [doi]
- Stacking Sigmas: A Framework to Compose $\varSigma $-Protocols for DisjunctionsAarushi Goel, Matthew Green 0001, Mathias Hall-Andersen, Gabriel Kaptchuk. 458-487 [doi]
- One-Shot Fiat-Shamir-Based NIZK Arguments of Composite Residuosity and Logarithmic-Size Ring Signatures in the Standard ModelBenoît Libert, Khoa Nguyen, Thomas Peters, Moti Yung. 488-519 [doi]
- SNARGs for P from Sub-exponential DDH and QRJames Hulett, Ruta Jawale, Dakshita Khurana, Akshayaram Srinivasan. 520-549 [doi]
- Optimal Tightness for Chain-Based Unique SignaturesFuchun Guo, Willy Susilo. 553-583 [doi]
- On Building Fine-Grained One-Way Functions from Strong Average-Case HardnessChris Brzuska, Geoffroy Couteau. 584-613 [doi]
- On the Multi-user Security of Short Schnorr Signatures with PreprocessingJeremiah Blocki, Seunghoon Lee. 614-643 [doi]
- Multi-Designated Receiver Signed Public Key EncryptionUeli Maurer, Christopher Portmann, Guilherme Rito. 644-673 [doi]
- A Fast and Simple Partially Oblivious PRF, with ApplicationsNirvan Tyagi, Sofía Celi, Thomas Ristenpart, Nick Sullivan, Stefano Tessaro, Christopher A. Wood. 674-705 [doi]
- Hiding in Plain Sight: Memory-Tight Proofs via Randomness ProgrammingAshrujit Ghoshal, Riddhi Ghosal, Joseph Jaeger, Stefano Tessaro. 706-735 [doi]
- Dynamic Collusion Bounded Functional Encryption from Identity-Based EncryptionRachit Garg 0001, Rishab Goyal, George Lu, Brent Waters. 736-763 [doi]
- Property-Preserving Hash Functions for Hamming Distance from Standard AssumptionsNils Fleischhacker, Kasper Green Larsen, Mark Simkin 0001. 764-781 [doi]
- Short Pairing-Free Blind Signatures with Exponential SecurityStefano Tessaro, Chenzhi Zhu. 782-811 [doi]
- CoCoA: Concurrent Continuous Group Key AgreementJoël Alwen, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual-Perez, Krzysztof Pietrzak, Michael Walter 0001. 815-844 [doi]
- Efficient Schemes for Committing Authenticated EncryptionMihir Bellare, Viet Tung Hoang. 845-875 [doi]
- On the Concrete Security of TLS 1.3 PSK ModeHannah Davis, Denis Diemert, Felix Günther 0001, Tibor Jager. 876-906 [doi]