Abstract is missing.
- Quantum Homomorphic Encryption for Polynomial-Sized CircuitsYfke Dulek, Christian Schaffner, Florian Speelman. 3-32 [doi]
- Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with ApplicationsFrédéric Dupuis, Serge Fehr, Philippe Lamontagne, Louis Salvail. 33-59 [doi]
- Semantic Security and Indistinguishability in the Quantum WorldTommaso Gagliardoni, Andreas Hülsing, Christian Schaffner. 60-89 [doi]
- Spooky Encryption and Its ApplicationsYevgeniy Dodis, Shai Halevi, Ron D. Rothblum, Daniel Wichs. 93-122 [doi]
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument SystemsCynthia Dwork, Moni Naor, Guy N. Rothblum. 123-145 [doi]
- Adaptively Secure Garbled Circuits from One-Way FunctionsBrett Hemenway, Zahra Jafargholi, Rafail Ostrovsky, Alessandra Scafuro, Daniel Wichs. 149-178 [doi]
- Rate-1, Linear Time and Additively Homomorphic UC CommitmentsIgnacio Cascudo, Ivan Damgård, Bernardo David, Nico Döttling, Jesper Buus Nielsen. 179-207 [doi]
- UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute TokensJan Camenisch, Maria Dubovitskaya, Alfredo Rial. 208-239 [doi]
- Probabilistic Termination and Composability of Cryptographic ProtocolsRan Cohen, Sandro Coretti, Juan A. Garay, Vassilis Zikas. 240-269 [doi]
- Concurrent Non-Malleable Commitments (and More) in 3 RoundsMichele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti. 270-299 [doi]
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key SizesJiang Zhang, Yu Chen, Zhenfeng Zhang. 303-332 [doi]
- Fully Secure Functional Encryption for Inner Products, from Standard AssumptionsShweta Agrawal, Benoît Libert, Damien Stehlé. 333-362 [doi]
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive SecurityZvika Brakerski, Vinod Vaikuntanathan. 363-384 [doi]
- Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion Using Integer ProgrammingMasayuki Abe, Fumitaka Hoshino, Miyako Ohkubo. 387-415 [doi]
- Linicrypt: A Model for Practical CryptographyBrent Carmer, Mike Rosulek. 416-445 [doi]
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized EncodingsBenny Applebaum, Pavel Raykov. 449-477 [doi]
- How to Prove Knowledge of Small SecretsCarsten Baum, Ivan Damgård, Kasper Green Larsen, Michael Nielsen. 478-498 [doi]
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving CredentialsMelissa Chase, Chaya Ganesh, Payman Mohassel. 499-530 [doi]
- Fine-Grained CryptographyAkshay Degwekar, Vinod Vaikuntanathan, Prashant Nalini Vasudevan. 533-562 [doi]
- TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable EncryptionSanjam Garg, Payman Mohassel, Charalampos Papamanthou. 563-592 [doi]
- Bounded Indistinguishability and the Complexity of Recovering SecretsAndrej Bogdanov, Yuval Ishai, Emanuele Viola, Christopher Williamson. 593-618 [doi]
- Two-Message, Oblivious Evaluation of Cryptographic FunctionalitiesNico Döttling, Nils Fleischhacker, Johannes Krupp, Dominique Schröder. 619-648 [doi]