Abstract is missing.
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without TrapdoorsBenoît Libert, San Ling, Khoa Nguyen, Huaxiong Wang. 1-31 [doi]
- Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public ParametersShota Yamada. 32-62 [doi]
- Online/Offline OR Composition of Sigma ProtocolsMichele Ciampi, Giuseppe Persiano, Alessandra Scafuro, Luisa Siniscalchi, Ivan Visconti. 63-92 [doi]
- Constant-Round Leakage-Resilient Zero-Knowledge from Collision ResistanceSusumu Kiyoshima. 93-123 [doi]
- Constrained Pseudorandom Functions for Unconstrained InputsApoorvaa Deshpande, Venkata Koppula, Brent Waters. 124-153 [doi]
- Pseudorandom Functions in Almost Constant Depth from Low-Noise LPNYu Yu, John P. Steinberger. 154-183 [doi]
- Secure Computation from Elastic Noisy ChannelsDakshita Khurana, Hemanta K. Maji, Amit Sahai. 184-212 [doi]
- All Complete Functionalities are ReversibleDakshita Khurana, Daniel Kraschewski, Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai. 213-242 [doi]
- On the Power of Hierarchical Identity-Based EncryptionMohammad Mahmoody, Ameer Mohammed. 243-272 [doi]
- On the Impossibility of Tight Cryptographic ReductionsChristoph Bader, Tibor Jager, Yong Li, Sven Schäge. 273-304 [doi]
- On the Size of Pairing-Based Non-interactive ArgumentsJens Groth. 305-326 [doi]
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log SettingJonathan Bootle, Andrea Cerulli, Pyrros Chaidos, Jens Groth, Christophe Petit. 327-357 [doi]
- On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle ModelJoël Alwen, Binyi Chen, Chethan Kamath, Vladimir Kolmogorov, Krzysztof Pietrzak, Stefano Tessaro. 358-387 [doi]
- Anonymous Traitor Tracing: How to Embed Arbitrary Information in a KeyRyo Nishimaki, Daniel Wichs, Mark Zhandry. 388-419 [doi]
- Unconditionally Secure Computation with Reduced InteractionIvan Damgård, Jesper Buus Nielsen, Rafail Ostrovsky, Adi Rosén. 420-447 [doi]
- The Exact Round Complexity of Secure ComputationSanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou. 448-476 [doi]
- On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic CommitmentsSerge Fehr, Max Fillinger. 477-496 [doi]
- Computationally Binding Quantum CommitmentsDominique Unruh. 497-527 [doi]
- Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic CryptosystemsNicolas Gama, Malika Izabachène, Phong Q. Nguyen, Xiang Xie. 528-558 [doi]
- Recovering Short Generators of Principal Ideals in Cyclotomic RingsRonald Cramer, Léo Ducas, Chris Peikert, Oded Regev. 559-585 [doi]
- Circuit Compilers with O(1/\log (n)) Leakage RateMarcin Andrychowicz, Stefan Dziembowski, Sebastian Faust. 586-615 [doi]
- Randomness Complexity of Private Circuits for MultiplicationSonia Belaïd, Fabrice Benhamouda, Alain Passelègue, Emmanuel Prouff, Adrian Thillard, Damien Vergnaud. 616-648 [doi]
- 10-Round Feistel is Indifferentiable from an Ideal CipherDana Dachman-Soled, Jonathan Katz, Aishwarya Thiruvengadam. 649-678 [doi]
- Indifferentiability of Confusion-Diffusion NetworksYevgeniy Dodis, Martijn Stam, John P. Steinberger, Tianren Liu. 679-704 [doi]
- Fair and Robust Multi-party Computation Using a Global Transaction LedgerAggelos Kiayias, Hong-Sheng Zhou, Vassilis Zikas. 705-734 [doi]
- Two Round Multiparty Computation via Multi-key FHEPratyay Mukherjee, Daniel Wichs. 735-763 [doi]
- Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive CircuitsSaikrishna Badrinarayanan, Eric Miles, Amit Sahai, Mark Zhandry. 764-791 [doi]
- New Negative Results on Differing-Inputs ObfuscationMihir Bellare, Igors Stepanovs, Brent Waters. 792-821 [doi]
- Automated Unbounded Analysis of Cryptographic Constructions in the Generic Group ModelMiguel Ambrona, Gilles Barthe, Benedikt Schmidt. 822-851 [doi]
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker AssumptionsZvika Brakerski, Ilan Komargodski, Gil Segev. 852-880 [doi]
- Non-malleable Codes for Bounded Depth, Bounded Fan-In CircuitsMarshall Ball, Dana Dachman-Soled, Mukul Kulkarni, Tal Malkin. 881-908 [doi]