| 2018 | Static-Memory-Hard Functions, and Modeling the Cost of Space vs. Time. | Thaddeus Dryja, Quanquan C. Liu, Sunoo Park |
| 2018 | Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. | Ivan Damgrd, Tomasz Kazana, Maciej Obremski, Varun Raj, Luisa Siniscalchi |
| 2018 | Game Theoretic Notions of Fairness in Multi-party Coin Toss. | Kai-Min Chung, Yue Guo, Wei-Kai Lin, Rafael Pass, Elaine Shi |
| 2018 | Information-Theoretic Broadcast with Dishonest Majority for Long Messages. | Wutichai Chongchitmate, Rafail Ostrovsky |
| 2018 | Traitor-Tracing from LWE Made Simple and Attribute-Based. | Yilei Chen, Vinod Vaikuntanathan, Brent Waters, Hoeteck Wee, Daniel Wichs |
| 2018 | Perfectly Secure Oblivious Parallel RAM. | T.-H. Hubert Chan, Kartik Nayak, Elaine Shi |
| 2018 | A Ciphertext-Size Lower Bound for Order-Preserving Encryption with Limited Leakage. | David Cash, Cong Zhang |
| 2018 | Certifying Trapdoor Permutations, Revisited. | Ran Canetti, Amit Lichtenberg |
| 2018 | Fine-Grained Secure Computation. | Matteo Campanelli, Rosario Gennaro |
| 2018 | Two-Message Statistically Sender-Private OT from LWE. | Zvika Brakerski, Nico Dttling |
| 2018 | Exploring Crypto Dark Matter: - New Simple PRF Candidates and Their Applications. | Dan Boneh, Yuval Ishai, Alain Passelgue, Amit Sahai, David J. Wu |
| 2018 | Secure Computation Using Leaky Correlations (Asymptotically Optimal Constructions). | Alexander R. Block, Divya Gupta, Hemanta K. Maji, Hai H. Nguyen |
| 2018 | One-Message Zero Knowledge and Non-malleable Commitments. | Nir Bitansky, Huijia Lin |
| 2018 | Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions. | Fabrice Benhamouda, Huijia Lin, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam |
| 2018 | Return of GGH15: Provable Security Against Zeroizing Attacks. | James Bartusek, Jiaxin Guan, Fermi Ma, Mark Zhandry |
| 2018 | Upgrading to Functional Encryption. | Saikrishna Badrinarayanan, Dakshita Khurana, Amit Sahai, Brent Waters |
| 2018 | Perfect Secure Computation in Two Rounds. | Benny Applebaum, Zvika Brakerski, Rotem Tsabary |
| 2018 | On the Power of Amortization in Secret Sharing: d-Uniform Secret Sharing and CDS with Constant Information Rate. | Benny Applebaum, Barak Arkis |
| 2018 | Succinct Garbling Schemes from Functional Encryption Through a Local Simulation Paradigm. | Prabhanjan Ananth, Alex Lombardi |
| 2018 | FE and iO for Turing Machines from Minimal Assumptions. | Shweta Agrawal, Monosij Maitra |
| 2018 | Impossibility of Simulation Secure Functional Encryption Even with Random Oracles. | Shashank Agrawal, Venkata Koppula, Brent Waters |
| 2017 | Attribute-Hiding Predicate Encryption in Bilinear Groups, Revisited. | Hoeteck Wee |
| 2017 | An Equivalence Between Attribute-Based Signatures and Homomorphic Signatures, and New Constructions for Both. | Rotem Tsabary |
| 2017 | Can PPAD Hardness be Based on Standard Cryptographic Assumptions? | Alon Rosen, Gil Segev, Ido Shahaf |
| 2017 | On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments. | Omer Paneth, Guy N. Rothblum |