| 2026 | EuroCrypt | Fast and Efficient Perfectly Secure Network-Agnostic Secure Computation. | Gilad Asharov, Fatima Elsheimy, Gilad Stern |
| 2025 | CCS | MegaBlocks: Breaking the Logarithmic I/O-Overhead Barrier for Oblivious RAM. | Gilad Asharov, Eliran Eiluz, Ilan Komargodski, Wei-Kai Lin |
| 2025 | EuroCrypt | Peeking Into the Future: MPC Resilient to Super-Rushing Adversaries. | Gilad Asharov, Anirudh Chandramouli, Ran Cohen, Yuval Ishai |
| 2024 | EuroCrypt | Perfect Asynchronous MPC with Linear Communication Overhead. | Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra |
| 2024 | EuroCrypt | Perfect (Parallel) Broadcast in Constant Expected Rounds via Statistical VSS. | Gilad Asharov, Anirudh Chandramouli |
| 2024 | SCN | NIZKs with Maliciously Chosen CRS: Subversion Advice-ZK and Accountable Soundness. | Prabhanjan Ananth, Gilad Asharov, Vipul Goyal, Hadar Kaner, Pratik Soni, Brent Waters |
| 2024 | TCC | Asynchronous Agreement on a Core Set in Constant Expected Time and More Efficient Asynchronous VSS and MPC. | Ittai Abraham, Gilad Asharov, Arpita Patra, Gilad Stern |
| 2023 | CCS | Secure Statistical Analysis on Multiple Datasets: Join and Group-By. | Gilad Asharov, Koki Hamada, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Junichi Tomida |
| 2023 | CCS | FutORAMa: A Concretely Efficient Hierarchical Oblivious RAM. | Gilad Asharov, Ilan Komargodski, Yehuda Michelson |
| 2023 | EuroCrypt | Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. | Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra |
| 2022 | CCS | Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. | Gilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi, Ariel Nof, Benny Pinkas, Katsumi Takahashi, Junichi Tomida |
| 2022 | EuroCrypt | A Complete Characterization of Game-Theoretically Fair, Multi-Party Coin Toss. | Ke Wu, Gilad Asharov, Elaine Shi |
| 2022 | PODC | Gradecast in Synchrony and Reliable Broadcast in Asynchrony with Optimal Resilience, Efficiency, and Unconditional Security. | Ittai Abraham, Gilad Asharov |
| 2022 | SODA | Optimal Oblivious Parallel RAM. | Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Enoch Peserico, Elaine Shi |
| 2022 | TCC | Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. | Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra |
| 2021 | CRYPTO | Oblivious RAM with Worst-Case Logarithmic Overhead. | Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Elaine Shi |
| 2021 | EuroCrypt | Towards Accountability in CRS Generation. | Prabhanjan Ananth, Gilad Asharov, Hila Dahari, Vipul Goyal |
| 2021 | SODA | Sorting Short Keys in Circuits of Size | Gilad Asharov, Wei-Kai Lin, Elaine Shi |
| 2021 | TCC | Efficient Perfectly Secure Computation with Optimal Resilience. | Ittai Abraham, Gilad Asharov, Avishay Yanai |
| 2020 | EuroCrypt | OptORAMa: Optimal Oblivious RAM. | Gilad Asharov, Ilan Komargodski, Wei-Kai Lin, Kartik Nayak, Enoch Peserico, Elaine Shi |
| 2020 | SODA | Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. | Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi |
| 2019 | EuroCrypt | Locality-Preserving Oblivious RAM. | Gilad Asharov, T.-H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi |
| 2019 | SP | Blind Certificate Authorities. | Liang Wang, Gilad Asharov, Rafael Pass, Thomas Ristenpart, Abhi Shelat |
| 2018 | CRYPTO | On the Complexity of Compressing Obfuscation. | Gilad Asharov, Naomi Ephraim, Ilan Komargodski, Rafael Pass |
| 2018 | CRYPTO | Tight Tradeoffs in Searchable Symmetric Encryption. | Gilad Asharov, Gil Segev, Ido Shahaf |
| 2017 | WWW | Secure Centrality Computation Over Multiple Networks. | Gilad Asharov, Francesco Bonchi, David Garca-Soriano, Tamir Tassa |
| 2016 | STOC | Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. | Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf |
| 2016 | TCC | On Constructing One-Way Permutations from Indistinguishability Obfuscation. | Gilad Asharov, Gil Segev |
| 2015 | EuroCrypt | More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries. | Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner |
| 2015 | FOCS | Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. | Gilad Asharov, Gil Segev |
| 2015 | TCC | Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions. | Gilad Asharov, Amos Beimel, Nikolaos Makriyannis, Eran Omri |
| 2014 | TCC | Towards Characterizing Complete Fairness in Secure Two-Party Computation. | Gilad Asharov |
| 2013 | ASIACRYPT | Fair and Efficient Secure Multiparty Computation with Reputation Systems. | Gilad Asharov, Yehuda Lindell, Hila Zarosim |
| 2013 | CCS | More efficient oblivious transfer and extensions for faster secure computation. | Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner |
| 2013 | TCC | A Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness. | Gilad Asharov, Yehuda Lindell, Tal Rabin |
| 2012 | ASIACRYPT | Calling Out Cheaters: Covert Security with Public Verifiability. | Gilad Asharov, Claudio Orlandi |
| 2012 | EuroCrypt | Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE. | Gilad Asharov, Abhishek Jain, Adriana Lpez-Alt, Eran Tromer, Vinod Vaikuntanathan, Daniel Wichs |
| 2011 | CRYPTO | Perfectly-Secure Multiplication for Any | Gilad Asharov, Yehuda Lindell, Tal Rabin |
| 2011 | EuroCrypt | Towards a Game Theoretic View of Secure Computation. | Gilad Asharov, Ran Canetti, Carmit Hazay |
| 2009 | CRYPTO | Utility Dependence in Correct and Fair Rational Secret Sharing. | Gilad Asharov, Yehuda Lindell |