Publications
-
Ashrujit Ghoshal, Ilan Komargodski and Gil Segev
Offline-Online Indifferentiability of Cryptographic Systems
[PDF]
-
Avital Shafran, Eran Malach, Thomas Ristenpart, Gil Segev and Stefano Tessaro
Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods
Advances in Cryptology - CRYPTO, 2024.
[PDF]
-
Lior Rotem, Gil Segev and Eylon Yogev
From One-Time to Two-Round Reusable Multi-Signatures without Nested Forking
Theory of Cryptography Conference (TCC), 2024.
[PDF]
-
Gil Segev and Liat Shapira
An Explicit High-Moment Forking Lemma and its Applications to the Concrete Security of Multi-Signatures
Communications in Cryptology, 2024.
[PDF]
-
Lior Rotem and Gil Segev
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols
Journal of Cryptology, 2024.
[PDF]
-
Lior Rotem and Gil Segev
Non-Malleable Vector Commitments via Local Equivocability
Journal of Cryptology, 2023.
[PDF]
-
Gil Segev, Amit Sharabi and Eylon Yogev
Rogue-Instance Security for Batch Knowledge Proofs
Theory of Cryptography Conference (TCC), 2023.
[PDF]
-
Gil Segev
Technical Perspective: Finding Connections between One-Way Functions and Kolmogorov Complexity
Communications of the ACM, 2023.
[PDF]
-
Lior Rotem and Gil Segev
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff
Information-Theoretic Cryptography (ITC), 2022.
[PDF]
-
Lior Rotem and Gil Segev
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols
Advances in Cryptology - CRYPTO, 2021.
[PDF]
-
Gili Schul-Ganz and Gil Segev
Generic-Group Identity-Based Encryption: A Tight Impossibility Result
Information-Theoretic Cryptography (ITC), 2021.
[PDF]
-
Avital Shafran, Gil Segev, Shmuel Peleg and Yedid Hoshen
Crypto-Oriented Neural Architecture Design
IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2021.
[PDF]
-
Lior Rotem and Gil Segev
Non-Malleable Vector Commitments via Local Equivocability
Theory of Cryptography Conference (TCC), 2021.
[PDF]
-
Gilad Asharov, Moni Naor, Gil Segev and Ido Shahaf
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations
SIAM Journal on Computing, 2021.
[PDF]
-
Gilad Asharov, Gil Segev and Ido Shahaf
Tight Tradeoffs in Searchable Symmetric Encryption
Journal of Cryptology, 2021.
[PDF]
-
Lior Rotem and Gil Segev
Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?
Journal of Cryptology, 2021.
[PDF]
-
Alon Rosen, Gil Segev and Ido Shahaf
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
Journal of Cryptology, 2021.
[PDF]
-
Lior Rotem and Gil Segev
Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions
Advances in Cryptology - CRYPTO, 2020.
[PDF]
-
Lior Rotem, Gil Segev and Ido Shahaf
Generic-Group Delay Functions Require Hidden-Order Groups
Advances in Cryptology - EUROCRYPT, 2020.
[PDF]
-
Gili Schul-Ganz and Gil Segev
Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction
Theory of Cryptography Conference (TCC), 2020.
[PDF]
-
Lior Rotem and Gil Segev
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions
Theory of Cryptography Conference (TCC), 2020.
[PDF]
-
Ido Shahaf, Or Ordentlich and Gil Segev
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption
International Symposium on Information Theory (ISIT), 2020.
[PDF]
-
Moni Naor, Lior Rotem and Gil Segev
Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery
Information-Theoretic Cryptography (ITC), 2020.
[PDF]
-
Gil Segev and Ido Shahaf
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective
Information-Theoretic Cryptography (ITC), 2020.
[PDF]
-
Moni Naor, Lior Rotem and Gil Segev
The Security of Lazy Users in Out-of-Band Authentication
ACM Transactions on Privacy and Security (TOPS), 2020.
[PDF]
-
Ilan Komargodski and Gil Segev
From Minicrypt to Obfustopia via Private-Key Functional Encryption
Journal of Cryptology, 2020.
[PDF]
-
Gil Segev and Ido Shahaf
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound
Theory of Cryptography Conference (TCC), 2018.
[PDF]
-
Lior Rotem and Gil Segev
Injective Trapdoor Functions via Derandomization: How Strong is Rudich’s Black-Box Barrier?
Theory of Cryptography Conference (TCC), 2018.
[PDF]
-
Moni Naor, Lior Rotem and Gil Segev
The Security of Lazy Users in Out-of-Band Authentication
Theory of Cryptography Conference (TCC), 2018.
[PDF]
-
Gilad Asharov, Gil Segev and Ido Shahaf
Tight Tradeoffs in Searchable Symmetric Encryption
Advances in Cryptology - CRYPTO, 2018.
[PDF]
-
Lior Rotem and Gil Segev
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal
Advances in Cryptology - CRYPTO, 2018.
[PDF] [Overview]
-
Zvika Brakerski, Alex Lombardi, Gil Segev and Vinod Vaikuntanathan
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions
Advances in Cryptology - EUROCRYPT, 2018.
[PDF]
-
Elette Boyle, Saleet Klein, Alon Rosen and Gil Segev
Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability
Security and Cryptography for Networks (SCN), 2018.
[PDF]
-
Zvika Brakerski, Ilan Komargodski and Gil Segev
Multi-Input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
Journal of Cryptology, 2018.
[PDF]
-
Gilad Asharov and Gil Segev
On Constructing One-Way Permutations from Indistinguishability Obfuscation
Journal of Cryptology, 2018.
[PDF]
-
Zvika Brakerski and Gil Segev
Function-Private Functional Encryption in the Private-Key Setting
Journal of Cryptology, 2018.
[PDF]
-
Ilan Komargodski, Gil Segev and Eylon Yogev
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
Journal of Cryptology, 2018.
[PDF]
-
Ananth Raghunathan, Gil Segev and Salil Vadhan
Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions
Journal of Cryptology, 2018.
[PDF]
-
Ilya Mironov, Omkant Pandey, Omer Reingold and Gil Segev
Incremental Deterministic Public-Key Encryption
Journal of Cryptology, 2018.
[PDF]
-
Ilya Mironov, Gil Segev and Ido Shahaf
Strengthening the Security of Encrypted Databases: Non-Transitive JOINs
Theory of Cryptography Conference (TCC), 2017.
[PDF]
-
Alon Rosen, Gil Segev and Ido Shahaf
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
Theory of Cryptography Conference (TCC), 2017.
[PDF]
-
Ilan Komargodski and Gil Segev
From Minicrypt to Obfustopia via Private-Key Functional Encryption
Advances in Cryptology - EUROCRYPT, 2017.
[PDF]
-
Zvika Brakerski, Nishanth Chandran, Vipul Goyal, Aayush Jain, Amit Sahai and Gil Segev
Hierarchical Functional Encryption
Innovations in Theoretical Computer Science (ITCS), 2017.
[PDF]
Pre-merge versions: [PDF] [PDF]
-
Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker and Michael Zohner
Privacy-Preserving Interdomain Routing at Internet Scale
Privacy Enhancing Technologies (PETS), 2017.
[PDF]
-
Gilad Asharov, Moni Naor, Gil Segev and Ido Shahaf
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations
ACM Symposium on Theory of Computing (STOC), 2016.
[PDF]
-
Zvika Brakerski, Ilan Komargodski and Gil Segev
Multi-Input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
Advances in Cryptology - EUROCRYPT, 2016.
[PDF]
-
Gilad Asharov and Gil Segev
On Constructing One-Way Permutations from Indistinguishability Obfuscation
Theory of Cryptography Conference (TCC), 2016.
[PDF]
-
Gilad Asharov and Gil Segev
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
SIAM Journal on Computing, 2016.
[PDF]
-
Tal Moran, Moni Naor and Gil Segev
An Optimally Fair Coin Toss
Journal of Cryptology (invited paper), 2016.
[PDF]
-
Benny Pinkas, Thomas Schneider, Gil Segev and Michael Zohner
PhaSIng: Private Set Intersection using Permutation-based Hashing
USENIX Security Symposium, 2015.
[PDF]
-
Prabhanjan Ananth, Zvika Brakerski, Gil Segev and Vinod Vaikuntanathan
From Selective to Adaptive Security in Functional Encryption
Advances in Cryptology - CRYPTO, 2015.
[PDF]
-
Ilan Komargodski, Gil Segev and Eylon Yogev
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
Theory of Cryptography Conference (TCC), 2015.
[PDF]
-
Zvika Brakerski and Gil Segev
Function-Private Functional Encryption in the Private-Key Setting
Theory of Cryptography Conference (TCC), 2015.
[PDF]
-
Gilad Asharov and Gil Segev
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
IEEE Symposium on Foundations of Computer Science (FOCS), 2015.
[PDF]
-
Iftach Haitner, Jonathan J. Hoch, Omer Reingold and Gil Segev
Finding Collisions in Interactive Protocols -- Tight Lower Bounds on the Round and Communication Complexities of Statistically-Hiding Commitments
SIAM Journal on Computing, 2015.
[PDF]
Pre-merge versions: [PDF] [PDF]
-
Dan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan and Dhinakaran Vinayagamurthy
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
Advances in Cryptology - EUROCRYPT, 2014.
[PDF]
Pre-merge versions: [PDF] [PDF]
-
Gil Cohen, Ran Raz and Gil Segev
Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification
SIAM Journal on Computing, 2014.
[PDF]
-
Zvika Brakerski and Gil Segev
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
Journal of Cryptology, 2014.
[PDF]
-
Dan Boneh, Ananth Raghunathan and Gil Segev
Function-Private Subspace-Membership Encryption and Its Applications
Advances in Cryptology - ASIACRYPT, 2013.
[PDF]
-
Rasmus Pagh, Gil Segev and Udi Wieder
How to Approximate A Set Without Knowing Its Size In Advance
IEEE Symposium on Foundations of Computer Science (FOCS), 2013.
[PDF]
-
Dan Boneh, Ananth Raghunathan and Gil Segev
Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption
Advances in Cryptology - CRYPTO, 2013.
[PDF]
-
Martin Abadi, Dan Boneh, Ilya Mironov, Ananth Raghunathan and Gil Segev
Message-Locked Encryption for Lock-Dependent Messages
Advances in Cryptology - CRYPTO, 2013.
[PDF]
-
Ananth Raghunathan, Gil Segev and Salil Vadhan
Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions
Advances in Cryptology - EUROCRYPT, 2013.
[PDF]
-
L. Elisa Celis, Omer Reingold, Gil Segev and Udi Wieder
Balls and Bins: Smaller Families and Faster Evaluation
SIAM Journal on Computing, 2013.
[PDF]
-
Elette Boyle, Gil Segev and Daniel Wichs
Fully Leakage-Resilient Signatures
Journal of Cryptology (invited paper), 2013.
[PDF]
-
David Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen and Gil Segev
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
Journal of Cryptology, 2013.
[PDF]
-
Debayan Gupta, Aaron Segal, Aurojit Panda, Gil Segev, Michael Schapira, Joan Feigenbaum, Jennifer Rexford and Scott Shenker
A New Approach to Interdomain Routing Based on Secure Multi-Party Computation
ACM Workshop on Hot Topics in Networks (HotNets), 2012.
[PDF]
-
Gil Cohen, Ran Raz and Gil Segev
Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification
IEEE Conference on Computational Complexity (CCC), 2012.
[PDF]
-
Ilya Mironov, Omkant Pandey, Omer Reingold and Gil Segev
Incremental Deterministic Public-Key Encryption
Advances in Cryptology - EUROCRYPT, 2012.
[PDF]
-
Krzysztof Pietrzak, Alon Rosen and Gil Segev
Lossy Functions Do Not Amplify Well
Theory of Cryptography Conference (TCC), 2012.
[PDF]
-
Dan Boneh, Gil Segev and Brent Waters
Targeted Malleability: Homomorphic Encryption for Restricted Computations
Innovations in Theoretical Computer Science (ITCS), 2012.
[PDF]
-
Moni Naor and Gil Segev
Public-Key Cryptosystems Resilient to Key Leakage
SIAM Journal on Computing, 2012.
[PDF]
-
L. Elisa Celis, Omer Reingold, Gil Segev and Udi Wieder
Balls and Bins: Smaller Families and Faster Evaluation
IEEE Symposium on Foundations of Computer Science (FOCS), 2011.
[PDF]
-
Zvika Brakerski and Gil Segev
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
Advances in Cryptology - CRYPTO, 2011.
[PDF]
-
Elette Boyle, Gil Segev and Daniel Wichs
Fully Leakage-Resilient Signatures
Advances in Cryptology - EUROCRYPT, 2011.
[PDF]
-
Zvika Brakerski, Jonathan Katz, Gil Segev and Arkady Yerukhimovich
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
Theory of Cryptography Conference (TCC), 2011.
[PDF]
-
Ilya Mironov, Moni Naor and Gil Segev
Sketching in Adversarial Environments
SIAM Journal on Computing (STOC '08 special issue), 2011.
[PDF]
-
Yuriy Arbitman, Moni Naor and Gil Segev
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
IEEE Symposium on Foundations of Computer Science (FOCS), 2010.
[PDF]
-
Joכl Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish and Daniel Wichs
Public-Key Encryption in the Bounded-Retrieval Model
Advances in Cryptology - EUROCRYPT, 2010.
[PDF]
-
David Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen and Gil Segev
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
International Conference on Practice and Theory in Public Key Cryptography (PKC), 2010.
[PDF]
-
Vadim Lyubashevsky, Adriana Palacio, and Gil Segev
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
Theory of Cryptography Conference (TCC), 2010.
[PDF]
-
Alon Rosen and Gil Segev
Chosen-Ciphertext Security via Correlated Products
SIAM Journal on Computing, 2010.
[PDF]
-
Danny Segev and Gil Segev
Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing
Algorithmica, 2010.
[PDF]
-
Moni Naor and Gil Segev
Public-Key Cryptosystems Resilient to Key Leakage
Advances in Cryptology - CRYPTO, 2009.
[PDF]
-
Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham and Scott Yilek
Hedged Public-Key Encryption: How to Protect Against Bad Randomness
Advances in Cryptology - ASIACRYPT, 2009.
[PDF]
-
Yuriy Arbitman, Moni Naor and Gil Segev
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
International Colloquium on Automata, Languages and Programming (ICALP), 2009.
[PDF]
-
Tal Moran, Moni Naor and Gil Segev
An Optimally Fair Coin Toss
Theory of Cryptography Conference (TCC), 2009.
[PDF]
-
Alon Rosen and Gil Segev
Chosen-Ciphertext Security via Correlated Products
Theory of Cryptography Conference (TCC), 2009.
[PDF]
-
Tal Moran, Moni Naor and Gil Segev
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
Theory of Computing, 2009.
[PDF]
-
Ilya Mironov, Moni Naor and Gil Segev
Sketching in Adversarial Environments
ACM Symposium on Theory of Computing (STOC), 2008.
[PDF]
-
Tal Moran and Gil Segev
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
Advances in Cryptology - EUROCRYPT, 2008.
[PDF]
-
Moni Naor, Gil Segev and Udi Wieder
History-Independent Cuckoo Hashing
International Colloquium on Automata, Languages and Programming (ICALP), 2008.
[PDF]
-
Iftach Haitner, Jonathan J. Hoch and Gil Segev
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
Theory of Cryptography Conference (TCC), 2008.
[PDF]
-
Moni Naor, Gil Segev and Adam Smith
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
IEEE Transactions on Information Theory (special issue on Information-Theoretic Security), 2008.
[PDF]
-
Iftach Haitner, Jonathan J. Hoch, Omer Reingold and Gil Segev
Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
IEEE Symposium on Foundations of Computer Science (FOCS), 2007.
[PDF]
-
Tal Moran, Moni Naor and Gil Segev
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
International Colloquium on Automata, Languages and Programming (ICALP), 2007 (best paper award).
[PDF]
-
Moni Naor, Gil Segev and Adam Smith
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
Advances in Cryptology - CRYPTO, 2006.
[PDF]
-
Danny Segev and Gil Segev
Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing
European Symposium on Algorithms (ESA), 2006.
[PDF]