Abstract is missing.
- Universal Signature AggregatorsSusan Hohenberger, Venkata Koppula, Brent Waters. 3-34 [doi]
- Fully Structure-Preserving Signatures and Shrinking CommitmentsMasayuki Abe, Markulf Kohlweiss, Miyako Ohkubo, Mehdi Tibouchi. 35-65 [doi]
- Disjunctions for Hash Proof Systems: New Constructions and ApplicationsMichel Abdalla, Fabrice Benhamouda, David Pointcheval. 69-100 [doi]
- Quasi-Adaptive NIZK for Linear Subspaces RevisitedEike Kiltz, Hoeteck Wee. 101-128 [doi]
- Leakage-Resilient Circuits Revisited - Optimal Number of Computing Components Without Leak-Free HardwareDana Dachman-Soled, Feng-Hao Liu, Hong-Sheng Zhou. 131-158 [doi]
- Noisy Leakage RevisitedStefan Dziembowski, Sebastian Faust, Maciej Skorski. 159-188 [doi]
- Privacy-Free Garbled Circuits with Applications to Efficient Zero-KnowledgeTore Kasper Frederiksen, Jesper Buus Nielsen, Claudio Orlandi. 191-219 [doi]
- Two Halves Make a Whole - Reducing Data Transfer in Garbled Circuits Using Half GatesSamee Zahur, Mike Rosulek, David Evans. 220-250 [doi]
- One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a CoinJens Groth, Markulf Kohlweiss. 253-280 [doi]
- The Bitcoin Backbone Protocol: Analysis and ApplicationsJuan A. Garay, Aggelos Kiayias, Nikos Leonardos. 281-310 [doi]
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash FunctionsRonald Cramer, Ivan Bjerre Damgård, Nico Döttling, Serge Fehr, Gabriele Spini. 313-336 [doi]
- Function Secret SharingElette Boyle, Niv Gilboa, Yuval Ishai. 337-367 [doi]
- Cluster Computing in Zero KnowledgeAlessandro Chiesa, Eran Tromer, Madars Virza. 371-403 [doi]
- Hosting Services on an Untrusted CloudDan Boneh, Divya Gupta 0001, Ilya Mironov, Amit Sahai. 404-436 [doi]
- How to Obfuscate Programs DirectlyJoe Zimmerman. 439-467 [doi]
- End-to-End Verifiable Elections in the Standard ModelAggelos Kiayias, Thomas Zacharias 0001, Bingsheng Zhang. 468-498 [doi]
- Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted DataShashank Agrawal, Shweta Agrawal, Manoj Prabhakaran. 501-531 [doi]
- Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal WorldMelissa Chase, Rafail Ostrovsky, Ivan Visconti. 532-560 [doi]
- Semantically Secure Order-Revealing Encryption: Multi-input Functional Encryption Without ObfuscationDan Boneh, Kevin Lewi, Mariana Raykova 0001, Amit Sahai, Mark Zhandry, Joe Zimmerman. 563-594 [doi]
- Improved Dual System ABE in Prime-Order Groups via Predicate EncodingsJie Chen, Romain Gay, Hoeteck Wee. 595-624 [doi]
- Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard ModelMihir Bellare, Viet Tung Hoang. 627-656 [doi]
- Cryptographic Reverse FirewallsIlya Mironov, Noah Stephens-Davidowitz. 657-686 [doi]
- Mind the Gap: Modular Machine-Checked Proofs of One-Round Key Exchange ProtocolsGilles Barthe, Juan Manuel Crespo, Yassine Lakhnech, Benedikt Schmidt. 689-718 [doi]
- Authenticated Key Exchange from Ideal LatticesJiang Zhang, Zhenfeng Zhang, Jintai Ding, Michael Snook, Özgür Dagdelen. 719-751 [doi]
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle ModelDominique Unruh. 755-784 [doi]
- Privacy Amplification in the Isolated Qubits ModelYi-Kai Liu. 785-814 [doi]
- Generic Hardness of the Multiple Discrete Logarithm ProblemAaram Yun. 817-836 [doi]