| 2017 | Strengthening the Security of Encrypted Databases: Non-transitive JOINs. | Ilya Mironov, Gil Segev, Ido Shahaf |
| 2017 | Blockwise p-Tampering Attacks on Cryptographic Primitives, Extractors, and Learners. | Saeed Mahloujifar, Mohammad Mahmoody |
| 2017 | On the Impossibility of Entropy Reversal, and Its Application to Zero-Knowledge Proofs. | Shachar Lovett, Jiapeng Zhang |
| 2017 | Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation. | Alex Lombardi, Vinod Vaikuntanathan |
| 2017 | Decomposable Obfuscation: A Framework for Building Applications of Obfuscation from Polynomial Hardness. | Qipeng Liu, Mark Zhandry |
| 2017 | Secure Two-Party Computation with Fairness - A Necessary Design Principle. | Yehuda Lindell, Tal Rabin |
| 2017 | Evolving Secret Sharing: Dynamic Thresholds and Robustness. | Ilan Komargodski, Anat Paskin-Cherniavsky |
| 2017 | A Unified Approach to Constructing Black-Box UC Protocols in Trusted Setup Models. | Susumu Kiyoshima, Huijia Lin, Muthuramakrishnan Venkitasubramaniam |
| 2017 | Round Optimal Concurrent Non-malleability from Polynomial Hardness. | Dakshita Khurana |
| 2017 | Four-State Non-malleable Codes with Explicit Constant Rate. | Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Sruthi Sekar |
| 2017 | Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy. | Tibor Jager, Martijn Stam, Ryan Stanley-Oakes, Bogdan Warinschi |
| 2017 | Adaptively Indistinguishable Garbled Circuits. | Zahra Jafargholi, Alessandra Scafuro, Daniel Wichs |
| 2017 | A Modular Analysis of the Fujisaki-Okamoto Transformation. | Dennis Hofheinz, Kathrin Hvelmanns, Eike Kiltz |
| 2017 | Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model. | Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam |
| 2017 | A Generic Approach to Constructing and Proving Verifiable Random Functions. | Rishab Goyal, Susan Hohenberger, Venkata Koppula, Brent Waters |
| 2017 | Overcoming Cryptographic Impossibility Results Using Blockchains. | Rishab Goyal, Vipul Goyal |
| 2017 | The Edited Truth. | Shafi Goldwasser, Saleet Klein, Daniel Wichs |
| 2017 | How to Construct a Leakage-Resilient (Stateless) Trusted Party. | Daniel Genkin, Yuval Ishai, Mor Weiss |
| 2017 | When Does Functional Encryption Imply Obfuscation? | Sanjam Garg, Mohammad Mahmoody, Ameer Mohammed |
| 2017 | On the One-Per-Message Unforgeability of (EC)DSA and Its Variants. | Manuel Fersch, Eike Kiltz, Bertram Poettering |
| 2017 | From Selective IBE to Full IBE and Selective HIBE. | Nico Dttling, Sanjam Garg |
| 2017 | On Iterative Collision Search for LPN and Subset Sum. | Srinivas Devadas, Ling Ren, Hanshen Xiao |
| 2017 | Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions. | Vanesa Daza, Nikolaos Makriyannis |
| 2017 | Delayed-Input Non-Malleable Zero Knowledge and Multi-Party Coin Tossing in Four Rounds. | Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti |
| 2017 | Round-Optimal Secure Two-Party Computation from Trapdoor Permutations. | Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi, Ivan Visconti |