| 2017 | Resettably-Sound Resettable Zero Knowledge in Constant Rounds. | Wutichai Chongchitmate, Rafail Ostrovsky, Ivan Visconti |
| 2017 | Batched Multi-hop Multi-key FHE from Ring-LWE with Compact Ciphertext Extension. | Long Chen, Zhenfeng Zhang, Xueqing Wang |
| 2017 | Near-Optimal Secret Sharing and Error Correcting Codes in \mathsf AC^0 AC 0. | Kuan Cheng, Yuval Ishai, Xin Li |
| 2017 | Circuit OPRAM: Unifying Statistically and Computationally Secure ORAMs and OPRAMs. | T.-H. Hubert Chan, Elaine Shi |
| 2017 | Resource-Efficient OT Combiners with Active Security. | Ignacio Cascudo, Ivan Damgrd, Oriol Farrs, Samuel Ranellucci |
| 2017 | Towards Doubly Efficient Private Information Retrieval. | Ran Canetti, Justin Holmgren, Silas Richelson |
| 2017 | Position-Based Cryptography and Multiparty Communication Complexity. | Joshua Brody, Stefan Dziembowski, Sebastian Faust, Krzysztof Pietrzak |
| 2017 | Private Constrained PRFs (and More) from LWE. | Zvika Brakerski, Rotem Tsabary, Vinod Vaikuntanathan, Hoeteck Wee |
| 2017 | Four Round Secure Computation Without Setup. | Zvika Brakerski, Shai Halevi, Antigoni Polychroniadou |
| 2017 | Can We Access a Database Both Locally and Privately? | Elette Boyle, Yuval Ishai, Rafael Pass, Mary Wootters |
| 2017 | Constrained Keys for Invertible Pseudorandom Functions. | Dan Boneh, Sam Kim, David J. Wu |
| 2017 | On the Depth-Robustness and Cumulative Pebbling Cost of Argon2i. | Jeremiah Blocki, Samson Zhou |
| 2017 | Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs. | Nir Bitansky |
| 2017 | Zero Knowledge Protocols from Succinct Constraint Detection. | Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner |
| 2017 | Linear Secret-Sharing Schemes for Forbidden Graph Access Structures. | Amos Beimel, Oriol Farrs, Yuval Mintz, Naty Peter |
| 2017 | Round Optimal Concurrent MPC via Strong Simulation. | Saikrishna Badrinarayanan, Vipul Goyal, Abhishek Jain, Dakshita Khurana, Amit Sahai |
| 2017 | On Secure Two-Party Computation in Three Rounds. | Prabhanjan Ananth, Abhishek Jain |
| 2017 | Moderately Hard Functions: Definition, Instantiations, and Applications. | Jol Alwen, Bjrn Tackmann |
| 2017 | Functional Encryption for Bounded Collusions, Revisited. | Shweta Agrawal, Alon Rosen |
| 2017 | Inception Makes Non-malleable Codes Stronger. | Divesh Aggarwal, Tomasz Kazana, Maciej Obremski |
| 2017 | Barriers to Black-Box Constructions of Traitor Tracing Systems. | Bo Tang, Jiapeng Zhang |
| 2017 | Bandwidth Hard Functions for ASIC Resistance. | Ling Ren, Srinivas Devadas |
| 2016 | How to Avoid Obfuscation Using Witness PRFs. | Mark Zhandry |
| 2016 | Simplified Universal Composability Framework. | Douglas Wikstrm |
| 2016 | Dj Q: Encore! Un Petit IBE. | Hoeteck Wee |