Gil Segev

According to our database, Gil Segev authored at least 75 papers between 2007 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2023

Non-malleable Vector Commitments via Local Equivocability.

Lior Rotem, Gil Segev

J. Cryptol., October, 2023

Technical Perspective: Finding Connections between One-Way Functions and Kolmogorov Complexity.

Gil Segev

Commun. ACM, May, 2023

Rogue-Instance Security for Batch Knowledge Proofs.

Gil Segev, Amit Sharabi, Eylon Yogev

IACR Cryptol. ePrint Arch., 2023

2022

A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff.

Lior Rotem, Gil Segev

IACR Cryptol. ePrint Arch., 2022

2021

Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier?

Lior Rotem, Gil Segev

J. Cryptol., 2021

Can PPAD Hardness be Based on Standard Cryptographic Assumptions?

Alon Rosen, Gil Segev, Ido Shahaf

J. Cryptol., 2021

Tight Tradeoffs in Searchable Symmetric Encryption.

Gilad Asharov, Gil Segev, Ido Shahaf

J. Cryptol., 2021

Generic-Group Identity-Based Encryption: A Tight Impossibility Result.

Gili Schul-Ganz, Gil Segev

IACR Cryptol. ePrint Arch., 2021

Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols.

Lior Rotem, Gil Segev

IACR Cryptol. ePrint Arch., 2021

Crypto-Oriented Neural Architecture Design.

Avital Shafran, Gil Segev, Shmuel Peleg, Yedid Hoshen

Proceedings of the IEEE International Conference on Acoustics, 2021

Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\varSigma }$-Protocols.

Lior Rotem, Gil Segev

Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020

The Security of Lazy Users in Out-of-Band Authentication.

Moni Naor, Lior Rotem, Gil Segev

ACM Trans. Priv. Secur., 2020

From Minicrypt to Obfustopia via Private-Key Functional Encryption.

Ilan Komargodski, Gil Segev

J. Cryptol., 2020

An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption.

Ido Shahaf, Or Ordentlich, Gil Segev

IACR Cryptol. ePrint Arch., 2020

Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective.

Gil Segev, Ido Shahaf

IACR Cryptol. ePrint Arch., 2020

Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction.

Gili Schul-Ganz, Gil Segev

IACR Cryptol. ePrint Arch., 2020

Generic-Group Delay Functions Require Hidden-Order Groups.

Lior Rotem, Gil Segev, Ido Shahaf

IACR Cryptol. ePrint Arch., 2020

Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions.

Lior Rotem, Gil Segev

IACR Cryptol. ePrint Arch., 2020

Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions.

Lior Rotem, Gil Segev

IACR Cryptol. ePrint Arch., 2020

2019

Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery.

Moni Naor, Lior Rotem, Gil Segev

IACR Cryptol. ePrint Arch., 2019

2018

Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions.

Ananth Raghunathan, Gil Segev, Salil P. Vadhan

J. Cryptol., 2018

Incremental Deterministic Public-Key Encryption.

Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev

J. Cryptol., 2018

Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions.

Ilan Komargodski, Gil Segev, Eylon Yogev

J. Cryptol., 2018

Function-Private Functional Encryption in the Private-Key Setting.

Zvika Brakerski, Gil Segev

J. Cryptol., 2018

Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions.

Zvika Brakerski, Ilan Komargodski, Gil Segev

J. Cryptol., 2018

On Constructing One-Way Permutations from Indistinguishability Obfuscation.

Gilad Asharov, Gil Segev

J. Cryptol., 2018

Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound.

Gil Segev, Ido Shahaf

IACR Cryptol. ePrint Arch., 2018

Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal.

Lior Rotem, Gil Segev

IACR Cryptol. ePrint Arch., 2018

2017

Privacy-Preserving Interdomain Routing at Internet Scale.

Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner

Proc. Priv. Enhancing Technol., 2017

Strengthening the Security of Encrypted Databases: Non-Transitive JOINs.

Ilya Mironov, Gil Segev, Ido Shahaf

IACR Cryptol. ePrint Arch., 2017

Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions.

Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan

IACR Cryptol. ePrint Arch., 2017

Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability.

Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev

IACR Cryptol. ePrint Arch., 2017

Hierarchical Functional Encryption.

Zvika Brakerski, Nishanth Chandran, Vipul Goyal, Aayush Jain, Amit Sahai, Gil Segev

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

An Optimally Fair Coin Toss.

Tal Moran, Moni Naor, Gil Segev

J. Cryptol., 2016

Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations.

Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf

IACR Cryptol. ePrint Arch., 2016

Indistinguishability Obfuscation Does Not Reduce to Structured Languages.

Gilad Asharov, Alon Rosen, Gil Segev

Electron. Colloquium Comput. Complex., 2016

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

SIAM J. Comput., 2015

Phasing: Private Set Intersection using Permutation-based Hashing.

Benny Pinkas, Thomas Schneider, Gil Segev, Michael Zohner

IACR Cryptol. ePrint Arch., 2015

Hierarchical Functional Encryption.

Zvika Brakerski, Gil Segev

IACR Cryptol. ePrint Arch., 2015

From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting.

Zvika Brakerski, Ilan Komargodski, Gil Segev

IACR Cryptol. ePrint Arch., 2015

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption.

Gilad Asharov, Gil Segev

IACR Cryptol. ePrint Arch., 2015

Message-Locked Encryption for Lock-Dependent Messages.

Martín Abadi, Dan Boneh, Ilya Mironov, Ananth Raghunathan, Gil Segev

IACR Cryptol. ePrint Arch., 2015

From Selective to Adaptive Security in Functional Encryption.

Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan

Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014

Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification.

Gil Cohen, Ran Raz, Gil Segev

SIAM J. Comput., 2014

Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting.

Zvika Brakerski, Gil Segev

J. Cryptol., 2014

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

IACR Cryptol. ePrint Arch., 2014

The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically.

Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan

IACR Cryptol. ePrint Arch., 2014

2013

More Constructions of Lossy and Correlation-Secure Trapdoor Functions.

David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev

J. Cryptol., 2013

Fully Leakage-Resilient Signatures.

Elette Boyle, Gil Segev, Daniel Wichs

J. Cryptol., 2013

Function-Private Subspace-Membership Encryption and Its Applications.

Dan Boneh, Ananth Raghunathan, Gil Segev

IACR Cryptol. ePrint Arch., 2013

Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption.

Dan Boneh, Ananth Raghunathan, Gil Segev

IACR Cryptol. ePrint Arch., 2013

Attribute-Based Encryption for Arithmetic Circuits.

Dan Boneh, Valeria Nikolaenko, Gil Segev

IACR Cryptol. ePrint Arch., 2013

How to Approximate a Set without Knowing Its Size in Advance.

Rasmus Pagh, Gil Segev, Udi Wieder

Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

2012

Hedged Public-key Encryption: How to Protect against Bad Randomness.

Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek

IACR Cryptol. ePrint Arch., 2012

Lossy Functions Do Not Amplify Well.

Krzysztof Pietrzak, Alon Rosen, Gil Segev

Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

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

Proceedings of the 11th ACM Workshop on Hot Topics in Networks, 2012

2011

Sketching in Adversarial Environments.

Ilya Mironov, Moni Naor, Gil Segev

SIAM J. Comput., 2011

Targeted Malleability: Homomorphic Encryption for Restricted Computations.

Dan Boneh, Gil Segev, Brent Waters

IACR Cryptol. ePrint Arch., 2011

Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification.

Gil Cohen, Ran Raz, Gil Segev

Electron. Colloquium Comput. Complex., 2011

Balls and Bins: Smaller Hash Families and Faster Evaluation.

L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder

Electron. Colloquium Comput. Complex., 2011

Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions.

Zvika Brakerski, Jonathan Katz, Gil Segev, Arkady Yerukhimovich

Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

2010

Approximate <i>k</i>-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing.

Danny Segev, Gil Segev

Algorithmica, 2010

Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation.

Yuriy Arbitman, Moni Naor, Gil Segev

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2009

Deterministic History-Independent Strategies for Storing Information on Write-Once Memories.

Tal Moran, Moni Naor, Gil Segev

Theory Comput., 2009

Public-Key Cryptosystems Resilient to Key Leakage.

Moni Naor, Gil Segev

IACR Cryptol. ePrint Arch., 2009

Public-Key Cryptographic Primitives Provably as Secure as Subset Sum.

Vadim Lyubashevsky, Adriana Palacio, Gil Segev

IACR Cryptol. ePrint Arch., 2009

Public-Key Encryption in the Bounded-Retrieval Model.

Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs

IACR Cryptol. ePrint Arch., 2009

De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results.

Yuriy Arbitman, Moni Naor, Gil Segev

Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

2008

Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models.

Moni Naor, Gil Segev, Adam D. Smith

IEEE Trans. Inf. Theory, 2008

Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption.

Alon Rosen, Gil Segev

IACR Cryptol. ePrint Arch., 2008

Chosen-Ciphertext Security via Correlated Products.

Alon Rosen, Gil Segev

IACR Cryptol. ePrint Arch., 2008

History-Independent Cuckoo Hashing.

Moni Naor, Gil Segev, Udi Wieder

IACR Cryptol. ePrint Arch., 2008

David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware.

Tal Moran, Gil Segev

IACR Cryptol. ePrint Arch., 2008

2007

A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.

Iftach Haitner, Jonathan J. Hoch, Gil Segev

IACR Cryptol. ePrint Arch., 2007

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

Electron. Colloquium Comput. Complex., 2007