Abstract is missing.
- Lunar: A Toolbox for More Efficient Universal and Updatable zkSNARKs and Commit-and-Prove ExtensionsMatteo Campanelli, Antonio Faonio, Dario Fiore 0001, Anaïs Querol, Hadrián Rodríguez. 3-33 [doi]
- Gentry-Wichs is Tight: a Falsifiable Non-adaptively Sound SNARGHelger Lipmaa, Kateryna Pavlyk. 34-64 [doi]
- Proofs for Inner Pairing Products and ApplicationsBenedikt Bünz, Mary Maller, Pratyush Mishra, Nirvan Tyagi, Psi Vesely. 65-97 [doi]
- Snarky CeremoniesMarkulf Kohlweiss, Mary Maller, Janno Siim, Mikhail Volkhov. 98-127 [doi]
- Efficient NIZKs for Algebraic SetsGeoffroy Couteau, Helger Lipmaa, Roberto Parisella, Arne Tobias Ødegaard. 128-158 [doi]
- Bit Security as Computational Cost for Winning Games with High ProbabilityShun Watanabe, Kenji Yasunaga. 161-188 [doi]
- Giving an Adversary Guarantees (Or: How to Model Designated Verifier Signatures in a Composable Framework)Ueli Maurer, Christopher Portmann, Guilherme Rito. 189-219 [doi]
- How to Build a Trapdoor Function from an Encryption SchemeSanjam Garg, Mohammad Hajiabadi, Giulio Malavolta, Rafail Ostrovsky. 220-249 [doi]
- Beyond Software Watermarking: Traitor-Tracing for Pseudorandom FunctionsRishab Goyal, Sam Kim, Brent Waters, David J. Wu. 250-280 [doi]
- Batching Base Oblivious TransfersIan McQuoid, Mike Rosulek, Lawrence Roy. 281-310 [doi]
- Algebraic Adversaries in the Universal Composability FrameworkMichel Abdalla, Manuel Barbosa, Jonathan Katz, Julian Loss, Jiayu Xu. 311-341 [doi]
- Luby-Rackoff Backwards with More Users and More SecuritySrimanta Bhattacharya, Mridul Nandi. 345-375 [doi]
- Double-Block-Length Hash Function for Minimum Memory SizeYusuke Naito 0001, Yu Sasaki, Takeshi Sugawara. 376-406 [doi]
- Toward a Fully Secure Authenticated Encryption Scheme from a Pseudorandom PermutationWonseok Choi, ByeongHak Lee, Jooyoung Lee 0001, Yeongmin Lee. 407-434 [doi]
- Tight Security for Key-Alternating Ciphers with Correlated Sub-keysStefano Tessaro, Xihu Zhang. 435-464 [doi]
- FAST: Secure and High Performance Format-Preserving Encryption and TokenizationF. Betül Durak, Henning Horst, Michael Horst, Serge Vaudenay. 465-489 [doi]
- Fine-Tuning the ISO/IEC Standard LightMACSoumya Chattopadhyay, Ashwin Jha, Mridul Nandi. 490-519 [doi]
- Categorization of Faulty Nonce Misuse Resistant Message AuthenticationYu Long Chen, Bart Mennink, Bart Preneel. 520-550 [doi]
- Balanced Non-adjacent FormsMarc Joye. 553-576 [doi]
- Efficient Boolean Search over Encrypted Data with Reduced LeakageSarvar Patel, Giuseppe Persiano, Joon Young Seo, Kevin Yeo. 577-607 [doi]
- Revisiting Homomorphic Encryption Schemes for Finite FieldsAndrey Kim, Yuriy Polyakov, Vincent Zucca. 608-639 [doi]
- Transciphering Framework for Approximate Homomorphic EncryptionJihoon Cho, Jincheol Ha, Seongkwang Kim, ByeongHak Lee, Joohee Lee, Jooyoung Lee 0001, Dukjae Moon, HyoJin Yoon. 640-669 [doi]
- Improved Programmable Bootstrapping with Larger Precision and Efficient Arithmetic Circuits for TFHEIlaria Chillotti, Damien Ligier, Jean-Baptiste Orfila, Samuel Tap. 670-699 [doi]