World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
41
Citations
5458
World Ranking
8973
National Ranking
145

Overview

Gil Segev is affiliated with the Hebrew University of Jerusalem in Israel. The main field of study is Computer Science, with a focus on various subfields such as Artificial Intelligence, Computational Theory and Mathematics, Information Systems, Computer Vision and Pattern Recognition, and Computer Networks and Communications.

The primary topics of research include Cryptography and Data Security, Complexity and Algorithms in Graphs, Cryptographic Implementations and Security, Internet Traffic Analysis and Secure E-voting, Coding theory and cryptography, and Advanced Steganography and Watermarking Techniques, as well as Computability, Logic, AI Algorithms.

Segev's recent scholarly work includes:

  • "Tight Tradeoffs in Searchable Symmetric Encryption" (2021, Journal of Cryptology)
  • "Finding Collisions in Interactive Protocols -- Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments" (2021, arXiv (Cornell University))
  • "Generic-Group Identity-Based Encryption: A Tight Impossibility Result" (2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl))
  • "Can PPAD Hardness be Based on Standard Cryptographic Assumptions?" (2021, Lecture notes in computer science)
  • "Technical Perspective: Finding Connections between One-Way Functions and Kolmogorov Complexity" (2023, Communications of the ACM)

Frequent co-authors who have collaborated with Segev include:

  • Lior Rotem
  • Ido Shahaf
  • Moni Naor
  • Gilad Asharov
  • Gili Schul-Ganz

The publication venues that commonly feature Segev's research are:

  • Journal of Cryptology
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Lecture notes in computer science
  • arXiv (Cornell University)
  • Communications of the ACM

Best Publications

  • Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits

    Dan Boneh;Craig Gentry;Sergey Gorbunov;Shai Halevi

  • Public-Key Cryptosystems Resilient to Key Leakage

    Moni Naor;Gil Segev

  • Public-Key encryption in the bounded-retrieval model

    Joël Alwen;Yevgeniy Dodis;Moni Naor;Gil Segev

  • Phasing: private set intersection using permutation-based hashing

    Benny Pinkas;Thomas Schneider;Gil Segev;Michael Zohner

  • Message-Locked Encryption for Lock-Dependent Messages.

    Martín Abadi;Dan Boneh;Ilya Mironov;Ananth Raghunathan

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

    Mihir Bellare;Zvika Brakerski;Moni Naor;Thomas Ristenpart

  • Chosen-Ciphertext Security via Correlated Products

    Alon Rosen;Gil Segev

  • From Selective to Adaptive Security in Functional Encryption

    Prabhanjan Ananth;Zvika Brakerski;Gil Segev;Vinod Vaikuntanathan

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

    Dan Boneh;Ananth Raghunathan;Gil Segev

  • Better security for deterministic public-key encryption: the auxiliary-input setting

    Zvika Brakerski;Gil Segev

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

    Yuriy Arbitman;Moni Naor;Gil Segev

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

    Zvika Brakerski;Alex Lombardi;Gil Segev;Vinod Vaikuntanathan

  • Public-Key Cryptosystems Resilient to Key Leakage

    Moni Naor;Gil Segev

  • An Optimally Fair Coin Toss

    Tal Moran;Moni Naor;Gil Segev

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

    Yuriy Arbitman;Moni Naor;Gil Segev

  • Searchable symmetric encryption: optimal locality in linear space via two-dimensional balanced allocations

    Gilad Asharov;Moni Naor;Gil Segev;Ido Shahaf

  • Public-key cryptographic primitives provably as secure as subset sum

    Vadim Lyubashevsky;Adriana Palacio;Gil Segev

  • 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

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

    Zvika Brakerski;Gil Segev

  • More constructions of lossy and correlation-secure trapdoor functions

    David Mandell Freeman;Oded Goldreich;Eike Kiltz;Alon Rosen

  • A new approach to interdomain routing based on secure multi-party computation

    Debayan Gupta;Aaron Segal;Aurojit Panda;Gil Segev

  • Chosen-Ciphertext Security via Correlated Products

    Alon Rosen;Gil Segev

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

    Zvika Brakerski;Gil Segev

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

    M. Naor;G. Segev;A. Smith

Frequent Co-Authors

Moni Naor
Moni Naor Weizmann Institute of Science
Zvika Brakerski
Zvika Brakerski Weizmann Institute of Science
Alon Rosen
Alon Rosen Bocconi University
Omer Reingold
Omer Reingold Stanford University
Dan Boneh
Dan Boneh Stanford University
Ilya Mironov
Ilya Mironov Google (United States)
Daniel Wichs
Daniel Wichs Northeastern University
Elette Boyle
Elette Boyle Reichman University
Thomas Schneider
Thomas Schneider Technical University of Darmstadt

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degree options for Computer Science offers both flexibility and accessibility, especially for students balancing work or family commitments. Many students are concerned about affordability, but several of the cheapest online colleges provide high-quality Computer Science programs at a fraction of the typical tuition cost.

Academic history can also impact admissions decisions. If you’re worried about your grades, consider applying to one of the universities for low gpa. These colleges offer students with a less-than-perfect GPA a chance to pursue a CS degree and build a strong foundation for a tech career.

For career planning, it’s helpful to see the diverse roles a STEM degree can unlock. It isn’t just about software development; many skills learned in CS also transfer to other growing areas like data analysis, cybersecurity, and tech management. If you’re curious about interdisciplinary prospects, see what jobs with elementary education and environmental science degree might reveal about combining tech with other fields.

If your goal is to earn your degree quickly, there are computer science degree online options with accelerated tracks, helping you fast-track your entry into the workforce. Exploring these options empowers you to choose the program that fits your budget, timeline, and academic profile.

Best Scientists Citing Gil Segev

Trending Scientists