Gil Segev

174 papers A* 18A 9B 7Misc 3Journal 106Unranked 31
YearRankTypeTitle / Venue / Authors
2025 J jnl
Bulletproofs for R1CS: Bridging the Completeness-Soundness Gap and a ZK Extension.
IACR Commun. Cryptol.
Gil Segev
2025 J jnl
Bulletproofs for R1CS: Bridging the Completeness-Soundness Gap and a ZK Extension.
IACR Cryptol. ePrint Arch.
Gil Segev
2025 — conf
Exponent-VRFs and Their Applications.
EUROCRYPT (7)
Dan Boneh, Iftach Haitner, Yehuda Lindell, Gil Segev
2025 — conf
Offline-Online Indifferentiability of Cryptographic Systems.
TCC (2)
Ashrujit Ghoshal, Ilan Komargodski, Gil Segev
2025 J jnl
Tighter Concrete Security for the Simplest OT.
IACR Commun. Cryptol.
Iftach Haitner, Gil Segev
2025 J jnl
Tighter Concrete Security for the Simplest OT.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Gil Segev
2024 J jnl
An Explicit High-Moment Forking Lemma and its Applications to the Concrete Security of Multi-Signatures.
IACR Commun. Cryptol.
Gil Segev, Liat Shapira
2024 J jnl
An Explicit High-Moment Forking Lemma and its Applications to the Concrete Security of Multi-Signatures.
IACR Cryptol. ePrint Arch.
Gil Segev, Liat Shapira
2024 J jnl
From One-Time to Two-Round Reusable Multi-Signatures without Nested Forking.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev, Eylon Yogev
2024 — conf
From One-Time to Two-Round Reusable Multi-signatures Without Nested Forking.
TCC (3)
Lior Rotem, Gil Segev, Eylon Yogev
2024 — conf
Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods.
CRYPTO (6)
Avital Shafran, Eran Malach, Thomas Ristenpart, Gil Segev, Stefano Tessaro
2024 J jnl
Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods.
IACR Cryptol. ePrint Arch.
Avital Shafran, Eran Malach, Thomas Ristenpart, Gil Segev, Stefano Tessaro
2024 J jnl
Offline-Online Indifferentiability of Cryptographic Systems.
IACR Cryptol. ePrint Arch.
Ashrujit Ghoshal, Ilan Komargodski, Gil Segev
2024 J jnl
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $\varvec{\Sigma }$-Protocols.
J. Cryptol.
Lior Rotem, Gil Segev
2023 J jnl
Non-malleable Vector Commitments via Local Equivocability.
J. Cryptol.
Lior Rotem, Gil Segev
2023 — conf
Rogue-Instance Security for Batch Knowledge Proofs.
TCC (1)
Gil Segev, Amit Sharabi, Eylon Yogev
2023 J jnl
Rogue-Instance Security for Batch Knowledge Proofs.
IACR Cryptol. ePrint Arch.
Gil Segev, Amit Sharabi, Eylon Yogev
2023 J jnl
Technical Perspective: Finding Connections between One-Way Functions and Kolmogorov Complexity.
Commun. ACM
Gil Segev
2022 A conf
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff.
ITC
Lior Rotem, Gil Segev
2022 J jnl
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev
2021 J jnl
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
J. Cryptol.
Alon Rosen, Gil Segev, Ido Shahaf
2021 Misc conf
Crypto-Oriented Neural Architecture Design.
ICASSP
Avital Shafran, Gil Segev, Shmuel Peleg, Yedid Hoshen
2021 J jnl
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments.
CoRR
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2021 A conf
Generic-Group Identity-Based Encryption: A Tight Impossibility Result.
ITC
Gili Schul-Ganz, Gil Segev
2021 J jnl
Generic-Group Identity-Based Encryption: A Tight Impossibility Result.
IACR Cryptol. ePrint Arch.
Gili Schul-Ganz, Gil Segev
2021 J jnl
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier?
J. Cryptol.
Lior Rotem, Gil Segev
2021 J jnl
Non-Malleable Vector Commitments via Local Equivocability.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev
2021 — conf
Non-malleable Vector Commitments via Local Equivocability.
TCC (3)
Lior Rotem, Gil Segev
2021 J jnl
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations.
SIAM J. Comput.
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
2021 J jnl
Tight Tradeoffs in Searchable Symmetric Encryption.
J. Cryptol.
Gilad Asharov, Gil Segev, Ido Shahaf
2021 — conf
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\varSigma }$-Protocols.
CRYPTO (1)
Lior Rotem, Gil Segev
2021 J jnl
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev
2020 J jnl
Accumulators in (and Beyond) Generic Groups: Non-Trivial Batch Verification Requires Interaction.
IACR Cryptol. ePrint Arch.
Gili Schul-Ganz, Gil Segev
2020 — conf
Accumulators in (and Beyond) Generic Groups: Non-trivial Batch Verification Requires Interaction.
TCC (2)
Gili Schul-Ganz, Gil Segev
2020 — conf
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions.
TCC (3)
Lior Rotem, Gil Segev
2020 J jnl
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev
2020 B conf
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption.
ISIT
Ido Shahaf, Or Ordentlich, Gil Segev
2020 J jnl
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption.
CoRR
Ido Shahaf, Or Ordentlich, Gil Segev
2020 J jnl
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption.
IACR Cryptol. ePrint Arch.
Ido Shahaf, Or Ordentlich, Gil Segev
2020 J jnl
From Minicrypt to Obfustopia via Private-Key Functional Encryption.
J. Cryptol.
Ilan Komargodski, Gil Segev
2020 — conf
Generic-Group Delay Functions Require Hidden-Order Groups.
EUROCRYPT (3)
Lior Rotem, Gil Segev, Ido Shahaf
2020 J jnl
Generic-Group Delay Functions Require Hidden-Order Groups.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev, Ido Shahaf
2020 — conf
Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions.
CRYPTO (3)
Lior Rotem, Gil Segev
2020 J jnl
Generically Speeding-Up Repeated Squaring is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev
2020 A conf
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective.
ITC
Gil Segev, Ido Shahaf
2020 J jnl
Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective.
IACR Cryptol. ePrint Arch.
Gil Segev, Ido Shahaf
2020 A conf
Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery.
ITC
Moni Naor, Lior Rotem, Gil Segev
2020 J jnl
The Security of Lazy Users in Out-of-Band Authentication.
ACM Trans. Priv. Secur.
Moni Naor, Lior Rotem, Gil Segev
2019 J jnl
Crypto-Oriented Neural Architecture Design.
CoRR
Avital Shafran, Gil Segev, Shmuel Peleg, Yedid Hoshen
2019 J jnl
Out-of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery.
IACR Cryptol. ePrint Arch.
Moni Naor, Lior Rotem, Gil Segev
2018 — conf
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions.
EUROCRYPT (1)
Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan
2018 — conf
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound.
TCC (2)
Gil Segev, Ido Shahaf
2018 J jnl
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound.
IACR Cryptol. ePrint Arch.
Gil Segev, Ido Shahaf
2018 J jnl
Deterministic Public-Key Encryption for Adaptively-Chosen Plaintext Distributions.
J. Cryptol.
Ananth Raghunathan, Gil Segev, Salil P. Vadhan
2018 J jnl
Function-Private Functional Encryption in the Private-Key Setting.
J. Cryptol.
Zvika Brakerski, Gil Segev
2018 J jnl
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions.
J. Cryptol.
Ilan Komargodski, Gil Segev, Eylon Yogev
2018 J jnl
Incremental Deterministic Public-Key Encryption.
J. Cryptol.
Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev
2018 — conf
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier?
TCC (1)
Lior Rotem, Gil Segev
2018 J jnl
Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier?
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev
2018 J jnl
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions.
J. Cryptol.
Zvika Brakerski, Ilan Komargodski, Gil Segev
2018 J jnl
On Constructing One-Way Permutations from Indistinguishability Obfuscation.
J. Cryptol.
Gilad Asharov, Gil Segev
2018 — conf
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal.
CRYPTO (1)
Lior Rotem, Gil Segev
2018 J jnl
Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal.
IACR Cryptol. ePrint Arch.
Lior Rotem, Gil Segev
2018 Misc conf
Securing Abe's Mix-Net Against Malicious Verifiers via Witness Indistinguishability.
SCN
Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev
2018 — conf
The Security of Lazy Users in Out-of-Band Authentication.
TCC (2)
Moni Naor, Lior Rotem, Gil Segev
2018 J jnl
The Security of Lazy Users in Out-of-Band Authentication.
IACR Cryptol. ePrint Arch.
Moni Naor, Lior Rotem, Gil Segev
2018 — conf
Tight Tradeoffs in Searchable Symmetric Encryption.
CRYPTO (1)
Gilad Asharov, Gil Segev, Ido Shahaf
2018 J jnl
Tight Tradeoffs in Searchable Symmetric Encryption.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Gil Segev, Ido Shahaf
2017 J jnl
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions.
IACR Cryptol. ePrint Arch.
Zvika Brakerski, Alex Lombardi, Gil Segev, Vinod Vaikuntanathan
2017 — conf
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
TCC (2)
Alon Rosen, Gil Segev, Ido Shahaf
2017 — conf
From Minicrypt to Obfustopia via Private-Key Functional Encryption.
EUROCRYPT (1)
Ilan Komargodski, Gil Segev
2017 J jnl
From Minicrypt to Obfustopia via Private-Key Functional Encryption.
IACR Cryptol. ePrint Arch.
Ilan Komargodski, Gil Segev
2017 A conf
Hierarchical Functional Encryption.
ITCS
Zvika Brakerski, Nishanth Chandran, Vipul Goyal, Aayush Jain, Amit Sahai, Gil Segev
2017 J jnl
Privacy-Preserving Interdomain Routing at Internet Scale.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner
2017 J jnl
Privacy-Preserving Interdomain Routing at Internet Scale.
Proc. Priv. Enhancing Technol.
Gilad Asharov, Daniel Demmler, Michael Schapira, Thomas Schneider, Gil Segev, Scott Shenker, Michael Zohner
2017 J jnl
Securing Abe's Mix-net Against Malicious Verifiers via Witness Indistinguishability.
IACR Cryptol. ePrint Arch.
Elette Boyle, Saleet Klein, Alon Rosen, Gil Segev
2017 J jnl
Strengthening the Security of Encrypted Databases: Non-Transitive JOINs.
IACR Cryptol. ePrint Arch.
Ilya Mironov, Gil Segev, Ido Shahaf
2017 — conf
Strengthening the Security of Encrypted Databases: Non-transitive JOINs.
TCC (2)
Ilya Mironov, Gil Segev, Ido Shahaf
2016 J jnl
An Optimally Fair Coin Toss.
J. Cryptol.
Tal Moran, Moni Naor, Gil Segev
2016 J jnl
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
Electron. Colloquium Comput. Complex.
Alon Rosen, Gil Segev, Ido Shahaf
2016 J jnl
Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
IACR Cryptol. ePrint Arch.
Alon Rosen, Gil Segev, Ido Shahaf
2016 J jnl
Indistinguishability Obfuscation Does Not Reduce to Structured Languages.
Electron. Colloquium Comput. Complex.
Gilad Asharov, Alon Rosen, Gil Segev
2016 J jnl
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption.
SIAM J. Comput.
Gilad Asharov, Gil Segev
2016 — conf
Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions.
EUROCRYPT (2)
Zvika Brakerski, Ilan Komargodski, Gil Segev
2016 — conf
On Constructing One-Way Permutations from Indistinguishability Obfuscation.
TCC (A2)
Gilad Asharov, Gil Segev
2016 J jnl
Searchable Symmetric Encryption: Optimal Locality in Linear Space via Two-Dimensional Balanced Allocations.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
2016 A* conf
Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations.
STOC
Gilad Asharov, Moni Naor, Gil Segev, Ido Shahaf
2015 J jnl
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments.
SIAM J. Comput.
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2015 — conf
From Selective to Adaptive Security in Functional Encryption.
CRYPTO (2)
Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan
2015 J jnl
From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting.
IACR Cryptol. ePrint Arch.
Zvika Brakerski, Ilan Komargodski, Gil Segev
2015 — conf
Function-Private Functional Encryption in the Private-Key Setting.
TCC (2)
Zvika Brakerski, Gil Segev
2015 — conf
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions.
TCC (2)
Ilan Komargodski, Gil Segev, Eylon Yogev
2015 J jnl
Hierarchical Functional Encryption.
IACR Cryptol. ePrint Arch.
Zvika Brakerski, Gil Segev
2015 A* conf
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption.
FOCS
Gilad Asharov, Gil Segev
2015 J jnl
Limits on the Power of Indistinguishability Obfuscation and Functional Encryption.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Gil Segev
2015 J jnl
Message-Locked Encryption for Lock-Dependent Messages.
IACR Cryptol. ePrint Arch.
Martín Abadi, Dan Boneh, Ilya Mironov, Ananth Raghunathan, Gil Segev
2015 J jnl
On Constructing One-Way Permutations from Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch.
Gilad Asharov, Gil Segev
2015 A* conf
Phasing: Private Set Intersection Using Permutation-based Hashing.
USENIX Security Symposium
Benny Pinkas, Thomas Schneider, Gil Segev, Michael Zohner
2015 J jnl
Phasing: Private Set Intersection using Permutation-based Hashing.
IACR Cryptol. ePrint Arch.
Benny Pinkas, Thomas Schneider, Gil Segev, Michael Zohner
2014 J jnl
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting.
J. Cryptol.
Zvika Brakerski, Gil Segev
2014 A* conf
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits.
EUROCRYPT
Dan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan, Dhinakaran Vinayagamurthy
2014 J jnl
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE, and Compact Garbled Circuits.
IACR Cryptol. ePrint Arch.
Dan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan, Dhinakaran Vinayagamurthy
2014 J jnl
Function-Private Functional Encryption in the Private-Key Setting.
IACR Cryptol. ePrint Arch.
Zvika Brakerski, Gil Segev
2014 J jnl
Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions.
IACR Cryptol. ePrint Arch.
Ilan Komargodski, Gil Segev, Eylon Yogev
2014 J jnl
Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification.
SIAM J. Comput.
Gil Cohen, Ran Raz, Gil Segev
2014 J jnl
The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically.
IACR Cryptol. ePrint Arch.
Prabhanjan Ananth, Zvika Brakerski, Gil Segev, Vinod Vaikuntanathan
2013 J jnl
Attribute-Based Encryption for Arithmetic Circuits.
IACR Cryptol. ePrint Arch.
Dan Boneh, Valeria Nikolaenko, Gil Segev
2013 J jnl
Balls and Bins: Smaller Hash Families and Faster Evaluation.
SIAM J. Comput.
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder
2013 A* conf
Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions.
EUROCRYPT
Ananth Raghunathan, Gil Segev, Salil P. Vadhan
2013 J jnl
Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions.
IACR Cryptol. ePrint Arch.
Ananth Raghunathan, Gil Segev, Salil P. Vadhan
2013 J jnl
Fully Leakage-Resilient Signatures.
J. Cryptol.
Elette Boyle, Gil Segev, Daniel Wichs
2013 — conf
Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption.
CRYPTO (2)
Dan Boneh, Ananth Raghunathan, Gil Segev
2013 J jnl
Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption.
IACR Cryptol. ePrint Arch.
Dan Boneh, Ananth Raghunathan, Gil Segev
2013 — conf
Function-Private Subspace-Membership Encryption and Its Applications.
ASIACRYPT (1)
Dan Boneh, Ananth Raghunathan, Gil Segev
2013 J jnl
Function-Private Subspace-Membership Encryption and Its Applications.
IACR Cryptol. ePrint Arch.
Dan Boneh, Ananth Raghunathan, Gil Segev
2013 J jnl
How to Approximate A Set Without Knowing Its Size In Advance
CoRR
Rasmus Pagh, Gil Segev, Udi Wieder
2013 A* conf
How to Approximate a Set without Knowing Its Size in Advance.
FOCS
Rasmus Pagh, Gil Segev, Udi Wieder
2013 — conf
Message-Locked Encryption for Lock-Dependent Messages.
CRYPTO (1)
Martín Abadi, Dan Boneh, Ilya Mironov, Ananth Raghunathan, Gil Segev
2013 J jnl
More Constructions of Lossy and Correlation-Secure Trapdoor Functions.
J. Cryptol.
David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev
2012 Misc conf
A new approach to interdomain routing based on secure multi-party computation.
HotNets
Debayan Gupta, Aaron Segal, Aurojit Panda, Gil Segev, Michael Schapira, Joan Feigenbaum, Jennifer Rexford, Scott Shenker
2012 J jnl
Hedged Public-key Encryption: How to Protect against Bad Randomness.
IACR Cryptol. ePrint Arch.
Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek
2012 A* conf
Incremental Deterministic Public-Key Encryption.
EUROCRYPT
Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev
2012 J jnl
Incremental Deterministic Public-Key Encryption.
IACR Cryptol. ePrint Arch.
Ilya Mironov, Omkant Pandey, Omer Reingold, Gil Segev
2012 B conf
Lossy Functions Do Not Amplify Well.
TCC
Krzysztof Pietrzak, Alon Rosen, Gil Segev
2012 A conf
Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification.
CCC
Gil Cohen, Ran Raz, Gil Segev
2012 J jnl
Public-Key Cryptosystems Resilient to Key Leakage.
SIAM J. Comput.
Moni Naor, Gil Segev
2012 A conf
Targeted malleability: homomorphic encryption for restricted computations.
ITCS
Dan Boneh, Gil Segev, Brent Waters
2011 A* conf
Balls and Bins: Smaller Hash Families and Faster Evaluation.
FOCS
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder
2011 J jnl
Balls and Bins: Smaller Hash Families and Faster Evaluation.
Electron. Colloquium Comput. Complex.
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder
2011 A* conf
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting.
CRYPTO
Zvika Brakerski, Gil Segev
2011 J jnl
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting.
IACR Cryptol. ePrint Arch.
Zvika Brakerski, Gil Segev
2011 A* conf
Fully Leakage-Resilient Signatures.
EUROCRYPT
Elette Boyle, Gil Segev, Daniel Wichs
2011 B conf
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions.
TCC
Zvika Brakerski, Jonathan Katz, Gil Segev, Arkady Yerukhimovich
2011 J jnl
Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification.
Electron. Colloquium Comput. Complex.
Gil Cohen, Ran Raz, Gil Segev
2011 J jnl
Sketching in Adversarial Environments.
SIAM J. Comput.
Ilya Mironov, Moni Naor, Gil Segev
2011 J jnl
Targeted Malleability: Homomorphic Encryption for Restricted Computations.
IACR Cryptol. ePrint Arch.
Dan Boneh, Gil Segev, Brent Waters
2010 J jnl
Approximate
Algorithmica
Danny Segev, Gil Segev
2010 A* conf
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation.
FOCS
Yuriy Arbitman, Moni Naor, Gil Segev
2010 J jnl
Chosen-Ciphertext Security via Correlated Products.
SIAM J. Comput.
Alon Rosen, Gil Segev
2010 J jnl
Fully Leakage-Resilient Signatures.
IACR Cryptol. ePrint Arch.
Elette Boyle, Gil Segev, Daniel Wichs
2010 — conf
More Constructions of Lossy and Correlation-Secure Trapdoor Functions.
Public Key Cryptography
David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev
2010 B conf
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum.
TCC
Vadim Lyubashevsky, Adriana Palacio, Gil Segev
2010 A* conf
Public-Key Encryption in the Bounded-Retrieval Model.
EUROCRYPT
Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs
2009 B conf
An Optimally Fair Coin Toss.
TCC
Tal Moran, Moni Naor, Gil Segev
2009 J jnl
An Optimally Fair Coin Toss.
IACR Cryptol. ePrint Arch.
Tal Moran, Moni Naor, Gil Segev
2009 J jnl
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
CoRR
Yuriy Arbitman, Moni Naor, Gil Segev
2009 B conf
Chosen-Ciphertext Security via Correlated Products.
TCC
Alon Rosen, Gil Segev
2009 J jnl
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
CoRR
Yuriy Arbitman, Moni Naor, Gil Segev
2009 — conf
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results.
ICALP (1)
Yuriy Arbitman, Moni Naor, Gil Segev
2009 J jnl
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories.
Theory Comput.
Tal Moran, Moni Naor, Gil Segev
2009 A conf
Hedged Public-Key Encryption: How to Protect against Bad Randomness.
ASIACRYPT
Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham, Scott Yilek
2009 J jnl
More Constructions of Lossy and Correlation-Secure Trapdoor Functions.
IACR Cryptol. ePrint Arch.
David Mandell Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen, Gil Segev
2009 J jnl
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum.
IACR Cryptol. ePrint Arch.
Vadim Lyubashevsky, Adriana Palacio, Gil Segev
2009 A* conf
Public-Key Cryptosystems Resilient to Key Leakage.
CRYPTO
Moni Naor, Gil Segev
2009 J jnl
Public-Key Cryptosystems Resilient to Key Leakage.
IACR Cryptol. ePrint Arch.
Moni Naor, Gil Segev
2009 J jnl
Public-Key Encryption in the Bounded-Retrieval Model.
IACR Cryptol. ePrint Arch.
Joël Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish, Daniel Wichs
2008 B conf
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.
TCC
Iftach Haitner, Jonathan J. Hoch, Gil Segev
2008 J jnl
Chosen-Ciphertext Security via Correlated Products.
IACR Cryptol. ePrint Arch.
Alon Rosen, Gil Segev
2008 A* conf
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware.
EUROCRYPT
Tal Moran, Gil Segev
2008 J jnl
David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware.
IACR Cryptol. ePrint Arch.
Tal Moran, Gil Segev
2008 J jnl
Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption.
IACR Cryptol. ePrint Arch.
Alon Rosen, Gil Segev
2008 — conf
History-Independent Cuckoo Hashing.
ICALP (2)
Moni Naor, Gil Segev, Udi Wieder
2008 J jnl
History-Independent Cuckoo Hashing.
IACR Cryptol. ePrint Arch.
Moni Naor, Gil Segev, Udi Wieder
2008 A* conf
Sketching in adversarial environments.
STOC
Ilya Mironov, Moni Naor, Gil Segev
2008 J jnl
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models.
IEEE Trans. Inf. Theory
Moni Naor, Gil Segev, Adam D. Smith
2007 J jnl
A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Jonathan J. Hoch, Gil Segev
2007 A* conf
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories.
ICALP
Tal Moran, Moni Naor, Gil Segev
2007 J jnl
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories.
IACR Cryptol. ePrint Arch.
Tal Moran, Moni Naor, Gil Segev
2007 A* conf
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.
FOCS
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2007 J jnl
Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.
IACR Cryptol. ePrint Arch.
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2007 J jnl
Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.
Electron. Colloquium Comput. Complex.
Iftach Haitner, Jonathan J. Hoch, Omer Reingold, Gil Segev
2006 A conf
Approximate
ESA
Danny Segev, Gil Segev
2006 A* conf
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models.
CRYPTO
Moni Naor, Gil Segev, Adam D. Smith
2006 J jnl
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models.
IACR Cryptol. ePrint Arch.
Moni Naor, Gil Segev, Adam D. Smith