top of page

Gil Segev

Professor of Computer Science
School of Computer Science and Engineering
The Hebrew University of Jerusalem

Office: Rothberg A531
Phone: +972-2-549-4574
Email: segev at cs.huji.ac.il

Research Interests

Cryptography and its interplay with various other areas in the foundations and applications of computer science.

Publications

Recent Publications (2017 - current)

​​

  • 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]
     

  • Gilad Asharov and Gil Segev
    On Constructing One-Way Permutations from Indistinguishability Obfuscation
    Journal of Cryptology, 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]

​

  • 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]

​

  • Zvika Brakerski and Gil Segev
    Function-Private Functional Encryption in the Private-Key Setting
    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]

Teaching

  • Introduction to Cryptography and Software Security (67392):

Fall 2023/24

Spring 2019/20

Spring 2022/23

Spring 2021/22

Spring 2020/21

Spring 2018/19

Spring 2017/18

Spring 2016/17

Spring 2015/16

  • Cryptography (67531):

Fall 2016/17

Fall 2015/16

Spring 2014/15

  • Advanced Topics in Cryptography (67944/67917):

Fall 2017/18

Fall 2019/20

  • Cryptography in Idealized Models (67391/67381):

Fall 2021/22

Fall 2020/21

  • Cryptography Seminar (67945):

Fall 2018/19

Spring 2013/14

Program Committees

  • The 7th International Symposium on Cyber Security, Cryptography, and Machine Learning (CSCML), 2023.

  • The 6th International Symposium on Cyber Security, Cryptography, and Machine Learning (CSCML), 2022.

  • The 19th Theory of Cryptography Conference (TCC), 2021.

  • The 3rd Privacy-Preserving Machine Learning Workshop (PPML), 2021.

  • The 18th International Conference on Cryptology and Network Security (CANS), 2020.

  • The 2nd Privacy-Preserving Machine Learning Workshop (PPML), 2020.

  • The 4th International Symposium on Cyber Security, Cryptography, and Machine Learning (CSCML), 2020.

  • The 37th International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), 2019.

  • The 3rd International Symposium on Cyber Security, Cryptography, and Machine Learning (CSCML), 2019.

  • The 21st International Conference on Practice and Theory of Public Key Cryptography (PKC), 2018.

  • The 2nd International Symposium on Cyber Security, Cryptography, and Machine Learning (CSCML), 2018.

  • The 37th International Cryptology Conference (CRYPTO), 2017.

  • The 20th International Conference on Practice and Theory of Public Key Cryptography (PKC), 2017.

  • The 1st International Symposium on Cyber Security, Cryptography, and Machine Learning (CSCML), 2017.

  • The 13th Theory of Cryptography Conference (TCC), 2016.

  • The 19th International Conference on Financial Cryptography and Data Security (FC), 2015.

  • The 34th International Cryptology Conference (CRYPTO), 2014.

  • The 18th International Conference on Financial Cryptography and Data Security (FC), 2014.

  • The 15th International Conference on Practice and Theory of Public Key Cryptography (PKC), 2012.

  • The 8th Theory of Cryptography Conference (TCC), 2011.

  • The 4th International Conference on Provable Security (ProvSec), 2010.

Brief Biography

Gil Segev is a Professor of Computer Science at the Hebrew University. Professor Segev obtained his Ph.D. in Computer Science from the Weizmann Institute of Science in 2010, and then spent two years as a postdoctoral researcher at Microsoft Research Silicon Valley, and one year as a visiting faculty at Stanford’s Computer Science Department. He joined the Hebrew University’s School of Computer Science and Engineering in 2013.
Professor Segev’s research focuses on the foundations and applications of cryptography, security, and privacy. He is the recipient of various awards and honors for his scientific contributions, including the Marie Curie and ERC Grants awarded by the European Union, Google’s Faculty Research Award, the Gad Resheff Memorial Prize for outstanding Ph.D. research awarded by the Weizmann Institute of Science, the Adams Fellowship awarded by the Israel Academy of Sciences and Humanities, and the Hebrew University's Rector Prize for outstanding research.​

Funding

Currently supported by the European Union's Horizon Europe Framework Program via an ERC Consolidator Grant, and by the Israel Science Foundation (ISF).

Previously, supported by the European Union's Horizon 2020 Framework Program via an ERC Starting Grant, by the European Union's 7th Framework Program (FP7) via a Marie Curie Career Integration Grant (CIG), by the Israel Science Foundation (ISF), by the Israeli Centers of Research Excellence (I-CORE) Program, by the US-Israel Binational Science Foundation (BSF) via an NSF-BSF Cybersecurity Grant (SaTC), and by a Google Faculty Research Award.

bottom of page