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 001 (Electron. Colloquium Comput. Complex., 2007)

A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval. - Iftach Haitner; Jonathan J. Hoch; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2007)

David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware. - Tal Moran; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2008)

History-Independent Cuckoo Hashing. - Moni Naor; Gil Segev 001; Udi Wieder (IACR Cryptol. ePrint Arch., 2008)

Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption. - Alon Rosen; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2008)

Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models. - Moni Naor; Gil Segev 001; Adam D. Smith 001 (IEEE Trans. Inf. Theory, 2008)

De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results. - Yuriy Arbitman; Moni Naor; Gil Segev 001 (ICALP (1), 2009)

Public-Key Encryption in the Bounded-Retrieval Model. - Joël Alwen; Yevgeniy Dodis; Moni Naor; Gil Segev 001; Shabsi Walfish; Daniel Wichs (IACR Cryptol. ePrint Arch., 2009)

Public-Key Cryptographic Primitives Provably as Secure as Subset Sum. - Vadim Lyubashevsky; Adriana Palacio; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2009)

Deterministic History-Independent Strategies for Storing Information on Write-Once Memories. - Tal Moran; Moni Naor; Gil Segev 001 (Theory Comput., 2009)

Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation. - Yuriy Arbitman; Moni Naor; Gil Segev 001 (FOCS, 2010)

Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing. - Danny Segev; Gil Segev 001 (Algorithmica, 2010)

Chosen-Ciphertext Security via Correlated Products. - Alon Rosen; Gil Segev 001 (SIAM J. Comput., 2010)

Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions. - Zvika Brakerski; Jonathan Katz; Gil Segev 001; Arkady Yerukhimovich (TCC, 2011)

Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification. - Gil Cohen; Ran Raz; Gil Segev 001 (Electron. Colloquium Comput. Complex., 2011)

Targeted Malleability: Homomorphic Encryption for Restricted Computations. - Dan Boneh; Gil Segev 001; Brent Waters (IACR Cryptol. ePrint Arch., 2011)

Sketching in Adversarial Environments. - Ilya Mironov; Moni Naor; Gil Segev 001 (SIAM J. Comput., 2011)

A new approach to interdomain routing based on secure multi-party computation. - Debayan Gupta; Aaron Segal; Aurojit Panda; Gil Segev 001; Michael Schapira; Joan Feigenbaum; Jennifer Rexford; Scott Shenker (HotNets, 2012)

Lossy Functions Do Not Amplify Well. - Krzysztof Pietrzak; Alon Rosen; Gil Segev 001 (TCC, 2012)

Hedged Public-key Encryption: How to Protect against Bad Randomness. - Mihir Bellare; Zvika Brakerski; Moni Naor; Thomas Ristenpart; Gil Segev 001; Hovav Shacham; Scott Yilek (IACR Cryptol. ePrint Arch., 2012)

Public-Key Cryptosystems Resilient to Key Leakage. - Moni Naor; Gil Segev 001 (SIAM J. Comput., 2012)

How to Approximate a Set without Knowing Its Size in Advance. - Rasmus Pagh; Gil Segev 001; Udi Wieder (FOCS, 2013)

Attribute-Based Encryption for Arithmetic Circuits. - Dan Boneh; Valeria Nikolaenko; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2013)

Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption. - Dan Boneh; Ananth Raghunathan; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2013)

Function-Private Subspace-Membership Encryption and Its Applications. - Dan Boneh; Ananth Raghunathan; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2013)

Fully Leakage-Resilient Signatures. - Elette Boyle; Gil Segev 001; Daniel Wichs (J. Cryptol., 2013)

More Constructions of Lossy and Correlation-Secure Trapdoor Functions. - David Mandell Freeman; Oded Goldreich 001; Eike Kiltz; Alon Rosen; Gil Segev 001 (J. Cryptol., 2013)

Balls and Bins: Smaller Hash Families and Faster Evaluation. - L. Elisa Celis; Omer Reingold; Gil Segev 001; Udi Wieder (SIAM J. Comput., 2013)

The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically. - Prabhanjan Ananth; Zvika Brakerski; Gil Segev 001; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2014)

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE, and Compact Garbled Circuits. - Dan Boneh; Craig Gentry; Sergey Gorbunov 001; Shai Halevi; Valeria Nikolaenko; Gil Segev 001; Vinod Vaikuntanathan; Dhinakaran Vinayagamurthy (IACR Cryptol. ePrint Arch., 2014)

Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting. - Zvika Brakerski; Gil Segev 001 (J. Cryptol., 2014)

Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification. - Gil Cohen; Ran Raz; Gil Segev 001 (SIAM J. Comput., 2014)

From Selective to Adaptive Security in Functional Encryption. - Prabhanjan Ananth; Zvika Brakerski; Gil Segev 001; Vinod Vaikuntanathan (CRYPTO (2), 2015)

Message-Locked Encryption for Lock-Dependent Messages. - Martín Abadi; Dan Boneh; Ilya Mironov; Ananth Raghunathan; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2015)

From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting. - Zvika Brakerski; Ilan Komargodski; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2015)

Hierarchical Functional Encryption. - Zvika Brakerski; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2015)

Phasing: Private Set Intersection using Permutation-based Hashing. - Benny Pinkas; Thomas Schneider 003; Gil Segev 001; Michael Zohner (IACR Cryptol. ePrint Arch., 2015)

Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. - Iftach Haitner; Jonathan J. Hoch; Omer Reingold; Gil Segev 001 (SIAM J. Comput., 2015)

Indistinguishability Obfuscation Does Not Reduce to Structured Languages. - Gilad Asharov; Alon Rosen; Gil Segev 001 (Electron. Colloquium Comput. Complex., 2016)

Can PPAD Hardness be Based on Standard Cryptographic Assumptions? - Alon Rosen; Gil Segev 001; Ido Shahaf (Electron. Colloquium Comput. Complex., 2016)

An Optimally Fair Coin Toss. - Tal Moran; Moni Naor; Gil Segev 001 (J. Cryptol., 2016)

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. - Gilad Asharov; Gil Segev 001 (SIAM J. Comput., 2016)

Hierarchical Functional Encryption. - Zvika Brakerski; Nishanth Chandran; Vipul Goyal; Aayush Jain; Amit Sahai; Gil Segev 001 (ITCS, 2017)

Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability. - Elette Boyle; Saleet Klein; Alon Rosen; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2017)

Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions. - Zvika Brakerski; Alex Lombardi; Gil Segev 001; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2017)

Strengthening the Security of Encrypted Databases: Non-Transitive JOINs. - Ilya Mironov; Gil Segev 001; Ido Shahaf (IACR Cryptol. ePrint Arch., 2017)

Privacy-Preserving Interdomain Routing at Internet Scale. - Gilad Asharov; Daniel Demmler; Michael Schapira; Thomas Schneider 003; Gil Segev 001; Scott Shenker; Michael Zohner (Proc. Priv. Enhancing Technol., 2017)

Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal. - Lior Rotem; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2018)

Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound. - Gil Segev 001; Ido Shahaf (IACR Cryptol. ePrint Arch., 2018)

On Constructing One-Way Permutations from Indistinguishability Obfuscation. - Gilad Asharov; Gil Segev 001 (J. Cryptol., 2018)

Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. - Zvika Brakerski; Ilan Komargodski; Gil Segev 001 (J. Cryptol., 2018)

Function-Private Functional Encryption in the Private-Key Setting. - Zvika Brakerski; Gil Segev 001 (J. Cryptol., 2018)

Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. - Ilan Komargodski; Gil Segev 001; Eylon Yogev (J. Cryptol., 2018)

Incremental Deterministic Public-Key Encryption. - Ilya Mironov; Omkant Pandey; Omer Reingold; Gil Segev 001 (J. Cryptol., 2018)

Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions. - Ananth Raghunathan; Gil Segev 001; Salil P. Vadhan (J. Cryptol., 2018)

Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. - Moni Naor; Lior Rotem; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2019)

Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions. - Lior Rotem; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2020)

Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions. - Lior Rotem; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2020)

Generic-Group Delay Functions Require Hidden-Order Groups. - Lior Rotem; Gil Segev 001; Ido Shahaf (IACR Cryptol. ePrint Arch., 2020)

Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction. - Gili Schul-Ganz; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2020)

Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective. - Gil Segev 001; Ido Shahaf (IACR Cryptol. ePrint Arch., 2020)

An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. - Ido Shahaf; Or Ordentlich; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2020)

From Minicrypt to Obfustopia via Private-Key Functional Encryption. - Ilan Komargodski; Gil Segev 001 (J. Cryptol., 2020)

The Security of Lazy Users in Out-of-Band Authentication. - Moni Naor; Lior Rotem; Gil Segev 001 (ACM Trans. Priv. Secur., 2020)

Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${ varSigma }$-Protocols. - Lior Rotem; Gil Segev 001 (CRYPTO (1), 2021)

Crypto-Oriented Neural Architecture Design. - Avital Shafran; Gil Segev 001; Shmuel Peleg; Yedid Hoshen (ICASSP, 2021)

Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols. - Lior Rotem; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2021)

Generic-Group Identity-Based Encryption: A Tight Impossibility Result. - Gili Schul-Ganz; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2021)

Tight Tradeoffs in Searchable Symmetric Encryption. - Gilad Asharov; Gil Segev 001; Ido Shahaf (J. Cryptol., 2021)

Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? - Lior Rotem; Gil Segev 001 (J. Cryptol., 2021)

Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. - Gilad Asharov; Moni Naor; Gil Segev 001; Ido Shahaf (SIAM J. Comput., 2021)

A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff. - Lior Rotem; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2022)

Rogue-Instance Security for Batch Knowledge Proofs. - Gil Segev 001; Amit Sharabi; Eylon Yogev (IACR Cryptol. ePrint Arch., 2023)

Technical Perspective: Finding Connections between One-Way Functions and Kolmogorov Complexity. - Gil Segev 001 (Commun. ACM, 2023)

Non-malleable Vector Commitments via Local Equivocability. - Lior Rotem; Gil Segev 001 (J. Cryptol., 2023)

An Explicit High-Moment Forking Lemma and its Applications to the Concrete Security of Multi-Signatures. - Gil Segev 001; Liat Shapira (IACR Commun. Cryptol., 2024)

Offline-Online Indifferentiability of Cryptographic Systems. - Ashrujit Ghoshal; Ilan Komargodski; Gil Segev 001 (IACR Cryptol. ePrint Arch., 2024)

From One-Time to Two-Round Reusable Multi-Signatures without Nested Forking. - Lior Rotem; Gil Segev 001; Eylon Yogev (IACR Cryptol. ePrint Arch., 2024)

Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods. - Avital Shafran; Eran Malach; Thomas Ristenpart; Gil Segev 001; Stefano Tessaro (IACR Cryptol. ePrint Arch., 2024)

Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $ varvec{ Sigma }$-Protocols. - Lior Rotem; Gil Segev 001 (J. Cryptol., 2024)

Exponent-VRFs and Their Applications. - Dan Boneh; Iftach Haitner; Yehuda Lindell; Gil Segev 001 (EUROCRYPT (7), 2025)

Tighter Concrete Security for the Simplest OT. - Iftach Haitner; Gil Segev 001 (IACR Commun. Cryptol., 2025)

Bulletproofs for R1CS: Bridging the Completeness-Soundness Gap and a ZK Extension. - Gil Segev 001 (IACR Commun. Cryptol., 2025)