Gil Segev


Senior Lecturer (Assistant Professor)
School of Computer Science and Engineering
The Hebrew University of Jerusalem


Office: Rothberg A531

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

 


 

Research Interests

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

Brief Background

I graduated with a Ph.D. in Computer Science in 2010 from the Weizmann Institute of Science, where I was advised by Prof. Moni Naor. Prior to joining the Hebrew University in 2013, I 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.  

Funding

My research is supported by the European Union's Seventh Framework Programme (FP7) via a Marie Curie Career Integration Grant (CIG), by the Israel Science Foundation (ISF), and by the Israeli Centers of Research Excellence (I-CORE) Program.

Publications

(See also my Google Scholar profile and DBLP entry)

  • Prabhanjan Ananth, Zvika Brakerski, Gil Segev and Vinod Vaikuntanathan
    The Trojan Method in Functional Encryption: From Selective to Adaptive Security, Generically
    Manuscript, 2014.
    [PDF]
  • Ilan Komargodski, Gil Segev and Eylon Yogev
    Functional Encryption for Randomized Functionalities in the Private-Key Setting from Minimal Assumptions
    Manuscript, 2014.
    [PDF]
  • Zvika Brakerski and Gil Segev
    Function-Private Functional Encryption in the Private-Key Setting
    Manuscript, 2014.
    [PDF]
  • Dan Boneh, Craig Gentry, Sergey Gorbunov, Shai Halevi, Valeria Nikolaenko, Gil Segev, Vinod Vaikuntanathan and Dhinakaran Vinayagamurthy
    Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
    Advances in Cryptology - EUROCRYPT, 2014.
    [PDF]
    Pre-merge versions: [PDF] [PDF]
  • Dan Boneh, Ananth Raghunathan and Gil Segev
    Function-Private Subspace-Membership Encryption and Its Applications
    Advances in Cryptology - ASIACRYPT, 2013.
    [PDF]
  • Rasmus Pagh, Gil Segev and Udi Wieder
    How to Approximate A Set Without Knowing Its Size In Advance
    IEEE Symposium on Foundations of Computer Science (FOCS), 2013.
    [PDF]
  • Dan Boneh, Ananth Raghunathan and Gil Segev 
    Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption
    Advances in Cryptology - CRYPTO, 2013.
    [PDF]
  • Martin Abadi, Dan Boneh, Ilya Mironov, Ananth Raghunathan and Gil Segev 
    Message-Locked Encryption for Lock-Dependent Messages
    Advances in Cryptology - CRYPTO, 2013.
    [PDF]
  • Ananth Raghunathan, Gil Segev and Salil Vadhan
    Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions
    Advances in Cryptology - EUROCRYPT, 2013.
    [PDF]
  • Debayan Gupta, Aaron Segal, Aurojit Panda, Gil Segev, Michael Schapira, Joan Feigenbaum, Jennifer Rexford and Scott Shenker
    A New Approach to Interdomain Routing Based on Secure Multi-Party Computation
    ACM Workshop on Hot Topics in Networks (HotNets), 2012.
    [PDF]

  • Gil Cohen, Ran Raz and Gil Segev
    Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification
    IEEE Conference on Computational Complexity (CCC), 2012.
    SIAM Journal on Computing, 2014.
    [PDF]

  • Ilya Mironov, Omkant Pandey, Omer Reingold and Gil Segev
    Incremental Deterministic Public-Key Encryption
    Advances in Cryptology - EUROCRYPT, 2012.
    [PDF]

  • Krzysztof Pietrzak, Alon Rosen and Gil Segev
    Lossy Functions Do Not Amplify Well
    Theory of Cryptography Conference (TCC), 2012.
    Invited to the Journal of Cryptology.
    [PDF]

  • Dan Boneh, Gil Segev and Brent Waters
    Targeted Malleability: Homomorphic Encryption for Restricted Computations
    Innovations in Theoretical Computer Science (ITCS), 2012.
    [PDF]

  • L. Elisa Celis, Omer Reingold, Gil Segev and Udi Wieder
    Balls and Bins: Smaller Families and Faster Evaluation
    IEEE Symposium on Foundations of Computer Science (FOCS), 2011.
    SIAM Journal on Computing, 2013.

    [PDF]

  • Zvika Brakerski and Gil Segev
    Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
    Advances in Cryptology - CRYPTO, 2011.
    Journal of Cryptology, 2014.
    [PDF]

  • Elette Boyle, Gil Segev and Daniel Wichs
    Fully Leakage-Resilient Signatures
    Advances in Cryptology - EUROCRYPT, 2011.
    Journal of Cryptology (invited paper), 2013.
    [PDF]

  • Zvika Brakerski, Jonathan Katz, Gil Segev and Arkady Yerukhimovich
    Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
    Theory of Cryptography Conference (TCC), 2011.
    [PDF]

  • Yuriy Arbitman, Moni Naor and Gil Segev
    Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
    IEEE Symposium on Foundations of Computer Science (FOCS), 2010.
    [PDF]

  • Jol Alwen, Yevgeniy Dodis, Moni Naor, Gil Segev, Shabsi Walfish and Daniel Wichs
    Public-Key Encryption in the Bounded-Retrieval Model
    Advances in Cryptology - EUROCRYPT, 2010.
    [PDF]

  • David Freeman, Oded Goldreich, Eike Kiltz, Alon Rosen and Gil Segev
    More Constructions of Lossy and Correlation-Secure Trapdoor Functions
    International Conference on Practice and Theory in Public Key Cryptography (PKC), 2010.
    Journal of Cryptology, 2013.
    [PDF]

  • Vadim Lyubashevsky, Adriana Palacio, and Gil Segev
    Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
    Theory of Cryptography Conference (TCC), 2010.
    Invited to the Journal of Cryptology.
    [PDF]

  • Moni Naor and Gil Segev
    Public-Key Cryptosystems Resilient to Key Leakage
    Advances in Cryptology - CRYPTO, 2009.
    SIAM Journal on Computing, 2012.
    [PDF]

  • Mihir Bellare, Zvika Brakerski, Moni Naor, Thomas Ristenpart, Gil Segev, Hovav Shacham and Scott Yilek
    Hedged Public-Key Encryption: How to Protect Against Bad Randomness
    Advances in Cryptology - ASIACRYPT, 2009.
    [PDF]

  • Yuriy Arbitman, Moni Naor and Gil Segev
    De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
    International Colloquium on Automata, Languages and Programming (ICALP), 2009.
    [PDF]

  • Tal Moran, Moni Naor and Gil Segev
    An Optimally Fair Coin Toss
    Theory of Cryptography Conference (TCC), 2009.
    Invited to the Journal of Cryptology.
    [PDF]

  • Alon Rosen and Gil Segev
    Chosen-Ciphertext Security via Correlated Products
    Theory of Cryptography Conference (TCC), 2009.
    SIAM Journal on Computing, 2010.
    [PDF]

  • Ilya Mironov, Moni Naor and Gil Segev
    Sketching in Adversarial Environments
    ACM Symposium on Theory of Computing (STOC), 2008.
    SIAM Journal on Computing (STOC '08 special issue), 2011.
    [PDF]

  • Tal Moran and Gil Segev
    David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware
    Advances in Cryptology - EUROCRYPT, 2008.
    [PDF]

  • Moni Naor, Gil Segev and Udi Wieder
    History-Independent Cuckoo Hashing
    International Colloquium on Automata, Languages and Programming (ICALP), 2008.
    [PDF]

  • Iftach Haitner, Jonathan J. Hoch and Gil Segev
    A Linear Lower Bound on the Communication Complexity of Single-Server Private Information Retrieval
    Theory of Cryptography Conference (TCC), 2008.
    [PDF]

  • Iftach Haitner, Jonathan J. Hoch, Omer Reingold and Gil Segev
    Finding Collisions in Interactive Protocols -- A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments
    IEEE Symposium on Foundations of Computer Science (FOCS), 2007.
    [PDF]

  • Tal Moran, Moni Naor and Gil Segev
    Deterministic History-Independent Strategies for Storing Information on Write-Once Memories
    International Colloquium on Automata, Languages and Programming (ICALP), 2007
    (best paper award).
    Theory of Computing, 2009.
    [PDF]

  • Moni Naor, Gil Segev and Adam Smith
    Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
    Advances in Cryptology - CRYPTO, 2006.
    IEEE Transactions on Information Theory (special issue on Information Theoretic Security), 2008.
    [PDF]

  • Danny Segev and Gil Segev
    Approximate k-Steiner Forests via the Lagrangian Relaxation Technique with Internal Preprocessing
    European Symposium on Algorithms (ESA), 2006.
    Algorithmica, 2010.
    [PDF]

Teaching

Program Committees

  • 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 in Public Key Cryptography (PKC), 2012.
  • The 8th Theory of Cryptography Conference (TCC), 2011.

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