Gil Segev

Postdoctoral Researcher
Microsoft Research Silicon Valley
1065 La Avenida
Mountain View, CA, 94043

Phone: +1 (650) 693-1894
Email: gil.segev at microsoft.com

Research Interests

Brief Background

Publications

(See also my Google Scholar profile and DBLP entry)

• 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.
  [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.
  [PDF]

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

• Elette Boyle, Gil Segev and Daniel Wichs
  Fully Leakage-Resilient Signatures
  Advances in Cryptology - EUROCRYPT, 2011.
  Invited to the Journal of Cryptology.
  [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]

• Joël 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 version to appear in the Journal of Cryptology.
  [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.
  [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.
  Journal version in 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.
  Journal version to appear in SIAM Journal on Computing (STOC '08 special issue).
  [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).
  Journal version in 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.
  Journal version in 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.
  Journal version in Algorithmica, 2010.
  [PDF]

Theses

• The Design of Public-Key Cryptosystems Resilient to Chosen-Ciphertext and Key-Leakage Attacks
  Ph.D. Thesis, Weizmann Institute of Science, 2010.
  [PDF]

• Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
  M.Sc. Thesis, Weizmann Institute of Science, 2006.
  [PDF]

Program Committees

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