Gil Segev

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 89

Top Venues

IACR Cryptol. ePrint Arch.

J. Cryptol.

TCC (2)

SIAM J. Comput.

Publications

Avital Shafran, Eran Malach, Thomas Ristenpart, Gil Segev, Stefano Tessaro
Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods. IACR Cryptol. ePrint Arch. 2024 (2024)
Avital Shafran, Eran Malach, Thomas Ristenpart, Gil Segev, Stefano Tessaro
Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods. CRYPTO (6) (2024)
Lior Rotem, Gil Segev
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $\varvec{\Sigma }$-Protocols. J. Cryptol. 37 (3) (2024)
Gil Segev, Liat Shapira
An Explicit High-Moment Forking Lemma and its Applications to the Concrete Security of Multi-Signatures. IACR Cryptol. ePrint Arch. 2024 (2024)
Gil Segev
Technical Perspective: Finding Connections between One-Way Functions and Kolmogorov Complexity. Commun. ACM 66 (5) (2023)
Gil Segev, Amit Sharabi, Eylon Yogev
Rogue-Instance Security for Batch Knowledge Proofs. IACR Cryptol. ePrint Arch. 2023 (2023)
Gil Segev, Amit Sharabi, Eylon Yogev
Rogue-Instance Security for Batch Knowledge Proofs. TCC (1) (2023)
Lior Rotem, Gil Segev
Non-malleable Vector Commitments via Local Equivocability. J. Cryptol. 36 (4) (2023)
Lior Rotem, Gil Segev
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff. ITC (2022)
Lior Rotem, Gil Segev
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff. IACR Cryptol. ePrint Arch. 2022 (2022)
Lior Rotem, Gil Segev
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\varSigma }$-Protocols. CRYPTO (1) (2021)
Alon Rosen, Gil Segev, Ido Shahaf
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? J. Cryptol. 34 (1) (2021)
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. CoRR (2021)
Gili Schul-Ganz, Gil Segev
Generic-Group Identity-Based Encryption: A Tight Impossibility Result. IACR Cryptol. ePrint Arch. 2021 (2021)
Avital Shafran, Gil Segev, Shmuel Peleg, Yedid Hoshen
Crypto-Oriented Neural Architecture Design. ICASSP (2021)
Lior Rotem, Gil Segev
Non-Malleable Vector Commitments via Local Equivocability. IACR Cryptol. ePrint Arch. 2021 (2021)
Lior Rotem, Gil Segev
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? J. Cryptol. 34 (4) (2021)
Gili Schul-Ganz, Gil Segev
Generic-Group Identity-Based Encryption: A Tight Impossibility Result. ITC (2021)
Lior Rotem, Gil Segev
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols. IACR Cryptol. ePrint Arch. 2021 (2021)
Lior Rotem, Gil Segev
Non-malleable Vector Commitments via Local Equivocability. TCC (3) (2021)
Gilad Asharov, Gil Segev, Ido Shahaf
Tight Tradeoffs in Searchable Symmetric Encryption. J. Cryptol. 34 (2) (2021)
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. SIAM J. Comput. 50 (5) (2021)
Gil Segev, Ido Shahaf
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective. IACR Cryptol. ePrint Arch. 2020 (2020)
Ilan Komargodski, Gil Segev
From Minicrypt to Obfustopia via Private-Key Functional Encryption. J. Cryptol. 33 (2) (2020)
Ido Shahaf, Or Ordentlich, Gil Segev
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. IACR Cryptol. ePrint Arch. 2020 (2020)
Lior Rotem, Gil Segev
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions. TCC (3) (2020)
Gil Segev, Ido Shahaf
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective. ITC (2020)
Gili Schul-Ganz, Gil Segev
Accumulators in (and Beyond) Generic Groups: Non-trivial Batch Verification Requires Interaction. TCC (2) (2020)
Gili Schul-Ganz, Gil Segev
Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction. IACR Cryptol. ePrint Arch. 2020 (2020)
Lior Rotem, Gil Segev
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions. IACR Cryptol. ePrint Arch. 2020 (2020)
Lior Rotem, Gil Segev, Ido Shahaf
Generic-Group Delay Functions Require Hidden-Order Groups. EUROCRYPT (3) (2020)
Ido Shahaf, Or Ordentlich, Gil Segev
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. CoRR (2020)
Lior Rotem, Gil Segev, Ido Shahaf
Generic-Group Delay Functions Require Hidden-Order Groups. IACR Cryptol. ePrint Arch. 2020 (2020)
Lior Rotem, Gil Segev
Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions. IACR Cryptol. ePrint Arch. 2020 (2020)
Lior Rotem, Gil Segev
Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions. CRYPTO (3) (2020)
Ido Shahaf, Or Ordentlich, Gil Segev
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption. ISIT (2020)
Moni Naor, Lior Rotem, Gil Segev
The Security of Lazy Users in Out-of-Band Authentication. ACM Trans. Priv. Secur. 23 (2) (2020)
Moni Naor, Lior Rotem, Gil Segev
Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. ITC (2020)
Avital Shafran, Gil Segev, Shmuel Peleg, Yedid Hoshen
Crypto-Oriented Neural Architecture Design. CoRR (2019)
Moni Naor, Lior Rotem, Gil Segev
Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery. IACR Cryptol. ePrint Arch. 2019 (2019)
Lior Rotem, Gil Segev
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal. IACR Cryptol. ePrint Arch. 2018 (2018)
Gil Segev, Ido Shahaf
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound. TCC (2) (2018)
Gilad Asharov, Gil Segev, Ido Shahaf
Tight Tradeoffs in Searchable Symmetric Encryption. CRYPTO (1) (2018)
Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev
Securing Abe's Mix-Net Against Malicious Verifiers via Witness Indistinguishability. SCN (2018)
Moni Naor, Lior Rotem, Gil Segev
The Security of Lazy Users in Out-of-Band Authentication. IACR Cryptol. ePrint Arch. 2018 (2018)
Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions. EUROCRYPT (1) (2018)
Lior Rotem, Gil Segev
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? IACR Cryptol. ePrint Arch. 2018 (2018)
Ananth Raghunathan, Gil Segev, Salil P. Vadhan
Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions. J. Cryptol. 31 (4) (2018)
Moni Naor, Lior Rotem, Gil Segev
The Security of Lazy Users in Out-of-Band Authentication. TCC (2) (2018)
Ilan Komargodski, Gil Segev, Eylon Yogev
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. J. Cryptol. 31 (1) (2018)
Zvika Brakerski, Gil Segev
Function-Private Functional Encryption in the Private-Key Setting. J. Cryptol. 31 (1) (2018)
Gilad Asharov, Gil Segev, Ido Shahaf
Tight Tradeoffs in Searchable Symmetric Encryption. IACR Cryptol. ePrint Arch. 2018 (2018)
Lior Rotem, Gil Segev
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal. CRYPTO (1) (2018)
Gil Segev, Ido Shahaf
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound. IACR Cryptol. ePrint Arch. 2018 (2018)
Zvika Brakerski, Ilan Komargodski, Gil Segev
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. J. Cryptol. 31 (2) (2018)
Gilad Asharov, Gil Segev
On Constructing One-Way Permutations from Indistinguishability Obfuscation. J. Cryptol. 31 (3) (2018)
Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev
Incremental Deterministic Public-Key Encryption. J. Cryptol. 31 (1) (2018)
Lior Rotem, Gil Segev
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier? TCC (1) (2018)
Ilan Komargodski, Gil Segev
From Minicrypt to Obfustopia via Private-Key Functional Encryption. IACR Cryptol. ePrint Arch. 2017 (2017)
Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner
Privacy-Preserving Interdomain Routing at Internet Scale. Proc. Priv. Enhancing Technol. 2017 (3) (2017)
Ilan Komargodski, Gil Segev
From Minicrypt to Obfustopia via Private-Key Functional Encryption. EUROCRYPT (1) (2017)
Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev
Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability. IACR Cryptol. ePrint Arch. 2017 (2017)
Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions. IACR Cryptol. ePrint Arch. 2017 (2017)
Zvika Brakerski, Nishanth Chandran, Vipul Goyal, Aayush Jain, Amit Sahai, Gil Segev
Hierarchical Functional Encryption. ITCS (2017)
Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner
Privacy-Preserving Interdomain Routing at Internet Scale. IACR Cryptol. ePrint Arch. 2017 (2017)
Alon Rosen, Gil Segev, Ido Shahaf
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? TCC (2) (2017)
Ilya Mironov, Gil Segev, Ido Shahaf
Strengthening the Security of Encrypted Databases: Non-Transitive JOINs. IACR Cryptol. ePrint Arch. 2017 (2017)
Ilya Mironov, Gil Segev, Ido Shahaf
Strengthening the Security of Encrypted Databases: Non-transitive JOINs. TCC (2) (2017)
Alon Rosen, Gil Segev, Ido Shahaf
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? Electron. Colloquium Comput. Complex. 23 (2016)
Zvika Brakerski, Ilan Komargodski, Gil Segev
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions. EUROCRYPT (2) (2016)
Gilad Asharov, Gil Segev
On Constructing One-Way Permutations from Indistinguishability Obfuscation. TCC (A2) (2016)
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations. STOC (2016)
Gilad Asharov, Alon Rosen, Gil Segev
Indistinguishability Obfuscation Does Not Reduce to Structured Languages. Electron. Colloquium Comput. Complex. 23 (2016)
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations. IACR Cryptol. ePrint Arch. 2016 (2016)
Tal Moran, Moni Naor, Gil Segev
An Optimally Fair Coin Toss. J. Cryptol. 29 (3) (2016)
Alon Rosen, Gil Segev, Ido Shahaf
Can PPAD Hardness be Based on Standard Cryptographic Assumptions? IACR Cryptol. ePrint Arch. 2016 (2016)
Gilad Asharov, Gil Segev
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. SIAM J. Comput. 45 (6) (2016)
Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan
From Selective to Adaptive Security in Functional Encryption. CRYPTO (2) (2015)
Benny Pinkas, Thomas Schneider, Gil Segev, Michael Zohner
Phasing: Private Set Intersection using Permutation-based Hashing. IACR Cryptol. ePrint Arch. 2015 (2015)
Zvika Brakerski, Ilan Komargodski, Gil Segev
From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting. IACR Cryptol. ePrint Arch. 2015 (2015)
Martín Abadi, Dan Boneh, Ilya Mironov, Ananth Raghunathan, Gil Segev
Message-Locked Encryption for Lock-Dependent Messages. IACR Cryptol. ePrint Arch. 2015 (2015)
Gilad Asharov, Gil Segev
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. FOCS (2015)
Gilad Asharov, Gil Segev
On Constructing One-Way Permutations from Indistinguishability Obfuscation. IACR Cryptol. ePrint Arch. 2015 (2015)
Gilad Asharov, Gil Segev
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption. IACR Cryptol. ePrint Arch. 2015 (2015)
Zvika Brakerski, Gil Segev
Hierarchical Functional Encryption. IACR Cryptol. ePrint Arch. 2015 (2015)
Benny Pinkas, Thomas Schneider, Gil Segev, Michael Zohner
Phasing: Private Set Intersection Using Permutation-based Hashing. USENIX Security Symposium (2015)
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments. SIAM J. Comput. 44 (1) (2015)
Ilan Komargodski, Gil Segev, Eylon Yogev
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. TCC (2) (2015)
Zvika Brakerski, Gil Segev
Function-Private Functional Encryption in the Private-Key Setting. TCC (2) (2015)
Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan
The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically. IACR Cryptol. ePrint Arch. 2014 (2014)
Dan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan, Dhinakaran Vinayagamurthy
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits. EUROCRYPT (2014)
Zvika Brakerski, Gil Segev
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting. J. Cryptol. 27 (2) (2014)
Dan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan, Dhinakaran Vinayagamurthy
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE, and Compact Garbled Circuits. IACR Cryptol. ePrint Arch. 2014 (2014)
Zvika Brakerski, Gil Segev
Function-Private Functional Encryption in the Private-Key Setting. IACR Cryptol. ePrint Arch. 2014 (2014)
Gil Cohen, Ran Raz, Gil Segev
Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification. SIAM J. Comput. 43 (2) (2014)
Ilan Komargodski, Gil Segev, Eylon Yogev
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions. IACR Cryptol. ePrint Arch. 2014 (2014)
Dan Boneh, Valeria Nikolaenko, Gil Segev
Attribute-Based Encryption for Arithmetic Circuits. IACR Cryptol. ePrint Arch. 2013 (2013)
Dan Boneh, Ananth Raghunathan, Gil Segev
Function-Private Subspace-Membership Encryption and Its Applications. ASIACRYPT (1) (2013)
Elette Boyle, Gil Segev, Daniel Wichs
Fully Leakage-Resilient Signatures. J. Cryptol. 26 (3) (2013)
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder
Balls and Bins: Smaller Hash Families and Faster Evaluation. SIAM J. Comput. 42 (3) (2013)

Gil Segev.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Gil Segev