Gil Segev

Orcid: 0000-0002-8073-579X

Affiliations:
  • Hebrew University, Israel


According to our database1, Gil Segev authored at least 83 papers between 2006 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

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

Tighter Concrete Security for the Simplest OT.
IACR Commun. Cryptol., 2025

Exponent-VRFs and Their Applications.
Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

2024
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for $\varvec{\Sigma }$-Protocols.
J. Cryptol., September, 2024

Offline-Online Indifferentiability of Cryptographic Systems.
IACR Cryptol. ePrint Arch., 2024

An Explicit High-Moment Forking Lemma and its Applications to the Concrete Security of Multi-Signatures.
IACR Commun. Cryptol., 2024

From One-Time to Two-Round Reusable Multi-signatures Without Nested Forking.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
Technical Perspective: Finding Connections between One-Way Functions and Kolmogorov Complexity.
Commun. ACM, May, 2023

Rogue-Instance Security for Batch Knowledge Proofs.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

2022
A Fully-Constructive Discrete-Logarithm Preprocessing Algorithm with an Optimal Time-Space Tradeoff.
Proceedings of the 3rd Conference on Information-Theoretic Cryptography, 2022

2021
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for Σ-Protocols.
IACR Cryptol. ePrint Arch., 2021

Non-malleable Vector Commitments via Local Equivocability.
Proceedings of the Theory of Cryptography - 19th International Conference, 2021

Crypto-Oriented Neural Architecture Design.
Proceedings of the IEEE International Conference on Acoustics, 2021

Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\varSigma }$-Protocols.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

Generic-Group Identity-Based Encryption: A Tight Impossibility Result.
Proceedings of the 2nd Conference on Information-Theoretic Cryptography, 2021

2020
Accumulators in (and Beyond) Generic Groups: Non-trivial Batch Verification Requires Interaction.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Out-Of-Band Authenticated Group Key Exchange: From Strong Authentication to Immediate Key Delivery.
Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

Hardness vs. (Very Little) Structure in Cryptography: A Multi-Prover Interactive Proofs Perspective.
Proceedings of the 1st Conference on Information-Theoretic Cryptography, 2020

Generic-Group Delay Functions Require Hidden-Order Groups.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2018
Ciphertext Expansion in Limited-Leakage Order-Preserving Encryption: A Tight Computational Lower Bound.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Injective Trapdoor Functions via Derandomization: How Strong is Rudich's Black-Box Barrier?
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

The Security of Lazy Users in Out-of-Band Authentication.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

Securing Abe's Mix-Net Against Malicious Verifiers via Witness Indistinguishability.
Proceedings of the Security and Cryptography for Networks - 11th International Conference, 2018

Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

Out-of-Band Authentication in Group Messaging: Computational, Statistical, Optimal.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Tight Tradeoffs in Searchable Symmetric Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Privacy-Preserving Interdomain Routing at Internet Scale.
IACR Cryptol. ePrint Arch., 2017

Can PPAD Hardness be Based on Standard Cryptographic Assumptions?
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Strengthening the Security of Encrypted Databases: Non-transitive JOINs.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Hierarchical Functional Encryption.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

From Minicrypt to Obfustopia via Private-Key Functional Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2017 - 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Paris, France, April 30, 2017

2016
Indistinguishability Obfuscation Does Not Reduce to Structured Languages.
Electron. Colloquium Comput. Complex., 2016

On Constructing One-Way Permutations from Indistinguishability Obfuscation.
Proceedings of the Theory of Cryptography - 13th International Conference, 2016

Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations.
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016

Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2016, 2016

2015
Finding Collisions in Interactive Protocols - Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments.
SIAM J. Comput., 2015

Hierarchical Functional Encryption.
IACR Cryptol. ePrint Arch., 2015

From Single-Input to Multi-Input Functional Encryption in the Private-Key Setting.
IACR Cryptol. ePrint Arch., 2015

Phasing: Private Set Intersection Using Permutation-based Hashing.
Proceedings of the 24th USENIX Security Symposium, 2015

Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Function-Private Functional Encryption in the Private-Key Setting.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

Limits on the Power of Indistinguishability Obfuscation and Functional Encryption.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

From Selective to Adaptive Security in Functional Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification.
SIAM J. Comput., 2014

The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically.
IACR Cryptol. ePrint Arch., 2014

Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Attribute-Based Encryption for Arithmetic Circuits.
IACR Cryptol. ePrint Arch., 2013

How to Approximate a Set without Knowing Its Size in Advance.
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013

Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions.
Proceedings of the Advances in Cryptology, 2013

Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Message-Locked Encryption for Lock-Dependent Messages.
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

Function-Private Subspace-Membership Encryption and Its Applications.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
Lossy Functions Do Not Amplify Well.
Proceedings of the Theory of Cryptography - 9th Theory of Cryptography Conference, 2012

Targeted malleability: homomorphic encryption for restricted computations.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

A new approach to interdomain routing based on secure multi-party computation.
Proceedings of the 11th ACM Workshop on Hot Topics in Networks, 2012

Incremental Deterministic Public-Key Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2012, 2012

Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification.
Proceedings of the 27th Conference on Computational Complexity, 2012

2011
Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions.
Proceedings of the Theory of Cryptography - 8th Theory of Cryptography Conference, 2011

Balls and Bins: Smaller Hash Families and Faster Evaluation.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Fully Leakage-Resilient Signatures.
Proceedings of the Advances in Cryptology - EUROCRYPT 2011, 2011

Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting.
Proceedings of the Advances in Cryptology - CRYPTO 2011, 2011

2010
Public-Key Cryptographic Primitives Provably as Secure as Subset Sum.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

More Constructions of Lossy and Correlation-Secure Trapdoor Functions.
Proceedings of the Public Key Cryptography, 2010

Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Public-Key Encryption in the Bounded-Retrieval Model.
Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco / French Riviera, May 30, 2010

2009
Chosen-Ciphertext Security via Correlated Products.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

An Optimally Fair Coin Toss.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Public-Key Cryptosystems Resilient to Key Leakage.
Proceedings of the Advances in Cryptology, 2009

Hedged Public-Key Encryption: How to Protect against Bad Randomness.
Proceedings of the Advances in Cryptology, 2009

2008
Efficient Lossy Trapdoor Functions based on the Composite Residuosity Assumption.
IACR Cryptol. ePrint Arch., 2008

A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

Sketching in adversarial environments.
Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

History-Independent Cuckoo Hashing.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware.
Proceedings of the Advances in Cryptology, 2008

2007
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments.
Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

2006
Approximate <i>k</i>-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing.
Proceedings of the Algorithms, 2006

Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models.
Proceedings of the Advances in Cryptology, 2006


  Loading...