| 2025 | EuroCrypt | Exponent-VRFs and Their Applications. | Dan Boneh, Iftach Haitner, Yehuda Lindell, Gil Segev |
| 2025 | TCC | Offline-Online Indifferentiability of Cryptographic Systems. | Ashrujit Ghoshal, Ilan Komargodski, Gil Segev |
| 2024 | CRYPTO | Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods. | Avital Shafran, Eran Malach, Thomas Ristenpart, Gil Segev, Stefano Tessaro |
| 2024 | TCC | From One-Time to Two-Round Reusable Multi-signatures Without Nested Forking. | Lior Rotem, Gil Segev, Eylon Yogev |
| 2023 | TCC | Rogue-Instance Security for Batch Knowledge Proofs. | Gil Segev, Amit Sharabi, Eylon Yogev |
| 2021 | CRYPTO | Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\varSigma }$-Protocols. | Lior Rotem, Gil Segev |
| 2021 | ICASSP | Crypto-Oriented Neural Architecture Design. | Avital Shafran, Gil Segev, Shmuel Peleg, Yedid Hoshen |
| 2021 | TCC | Non-malleable Vector Commitments via Local Equivocability. | Lior Rotem, Gil Segev |
| 2020 | CRYPTO | Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions. | Lior Rotem, Gil Segev |
| 2020 | EuroCrypt | Generic-Group Delay Functions Require Hidden-Order Groups. | Lior Rotem, Gil Segev, Ido Shahaf |
| 2020 | ISIT | An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. | Ido Shahaf, Or Ordentlich, Gil Segev |
| 2020 | TCC | Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions. | Lior Rotem, Gil Segev |
| 2020 | TCC | Accumulators in (and Beyond) Generic Groups: Non-trivial Batch Verification Requires Interaction. | Gili Schul-Ganz, Gil Segev |
| 2018 | CRYPTO | Tight Tradeoffs in Searchable Symmetric Encryption. | Gilad Asharov, Gil Segev, Ido Shahaf |
| 2018 | CRYPTO | Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal. | Lior Rotem, Gil Segev |
| 2018 | EuroCrypt | Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions. | Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan |
| 2018 | SCN | Securing Abe's Mix-Net Against Malicious Verifiers via Witness Indistinguishability. | Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev |
| 2018 | TCC | The Security of Lazy Users in Out-of-Band Authentication. | Moni Naor, Lior Rotem, Gil Segev |
| 2018 | TCC | Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? | Lior Rotem, Gil Segev |
| 2018 | TCC | Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound. | Gil Segev, Ido Shahaf |
| 2017 | EuroCrypt | From Minicrypt to Obfustopia via Private-Key Functional Encryption. | Ilan Komargodski, Gil Segev |
| 2017 | TCC | Strengthening the Security of Encrypted Databases: Non-transitive JOINs. | Ilya Mironov, Gil Segev, Ido Shahaf |
| 2017 | TCC | Can PPAD Hardness be Based on Standard Cryptographic Assumptions? | Alon Rosen, Gil Segev, Ido Shahaf |
| 2016 | EuroCrypt | Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. | Zvika Brakerski, Ilan Komargodski, Gil Segev |
| 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 | CRYPTO | From Selective to Adaptive Security in Functional Encryption. | Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan |
| 2015 | FOCS | Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. | Gilad Asharov, Gil Segev |
| 2015 | TCC | Function-Private Functional Encryption in the Private-Key Setting. | Zvika Brakerski, Gil Segev |
| 2015 | TCC | Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. | Ilan Komargodski, Gil Segev, Eylon Yogev |
| 2014 | EuroCrypt | Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits. | Dan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan, Dhinakaran Vinayagamurthy |
| 2013 | ASIACRYPT | Function-Private Subspace-Membership Encryption and Its Applications. | Dan Boneh, Ananth Raghunathan, Gil Segev |
| 2013 | CRYPTO | Message-Locked Encryption for Lock-Dependent Messages. | Martn Abadi, Dan Boneh, Ilya Mironov, Ananth Raghunathan, Gil Segev |
| 2013 | CRYPTO | Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption. | Dan Boneh, Ananth Raghunathan, Gil Segev |
| 2013 | EuroCrypt | Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions. | Ananth Raghunathan, Gil Segev, Salil P. Vadhan |
| 2013 | FOCS | How to Approximate a Set without Knowing Its Size in Advance. | Rasmus Pagh, Gil Segev, Udi Wieder |
| 2012 | EuroCrypt | Incremental Deterministic Public-Key Encryption. | Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev |
| 2012 | HOTNETS | A new approach to interdomain routing based on secure multi-party computation. | Debayan Gupta, Aaron Segal, Aurojit Panda, Gil Segev, Michael Schapira, Joan Feigenbaum, Jennifer Rexford, Scott Shenker |
| 2012 | TCC | Lossy Functions Do Not Amplify Well. | Krzysztof Pietrzak, Alon Rosen, Gil Segev |
| 2011 | CRYPTO | Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting. | Zvika Brakerski, Gil Segev |
| 2011 | EuroCrypt | Fully Leakage-Resilient Signatures. | Elette Boyle, Gil Segev, Daniel Wichs |
| 2011 | FOCS | Balls and Bins: Smaller Hash Families and Faster Evaluation. | L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder |
| 2011 | TCC | Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions. | Zvika Brakerski, Jonathan Katz, Gil Segev, Arkady Yerukhimovich |
| 2010 | EuroCrypt | Public-Key Encryption in the Bounded-Retrieval Model. | Jol Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs |
| 2010 | FOCS | Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation. | Yuriy Arbitman, Moni Naor, Gil Segev |
| 2010 | PKC | More Constructions of Lossy and Correlation-Secure Trapdoor Functions. | David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev |
| 2010 | TCC | Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. | Vadim Lyubashevsky, Adriana Palacio, Gil Segev |
| 2009 | ASIACRYPT | Hedged Public-Key Encryption: How to Protect against Bad Randomness. | Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek |
| 2009 | CRYPTO | Public-Key Cryptosystems Resilient to Key Leakage. | Moni Naor, Gil Segev |
| 2009 | ICALP | De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. | Yuriy Arbitman, Moni Naor, Gil Segev |
| 2009 | TCC | An Optimally Fair Coin Toss. | Tal Moran, Moni Naor, Gil Segev |
| 2009 | TCC | Chosen-Ciphertext Security via Correlated Products. | Alon Rosen, Gil Segev |
| 2008 | EuroCrypt | David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. | Tal Moran, Gil Segev |
| 2008 | ICALP | History-Independent Cuckoo Hashing. | Moni Naor, Gil Segev, Udi Wieder |
| 2008 | STOC | Sketching in adversarial environments. | Ilya Mironov, Moni Naor, Gil Segev |
| 2008 | TCC | A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. | Iftach Haitner, Jonathan J. Hoch, Gil Segev |
| 2007 | FOCS | Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments. | Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev |
| 2007 | ICALP | Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. | Tal Moran, Moni Naor, Gil Segev |
| 2006 | CRYPTO | Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. | Moni Naor, Gil Segev, Adam D. Smith |
| 2006 | ESA | Approximate | Danny Segev, Gil Segev |