World Library  
Flag as Inappropriate
Email this Article

Shai Halevi

Article Id: WHEBN0044938612
Reproduction Date:

Title: Shai Halevi  
Author: World Heritage Encyclopedia
Language: English
Subject: Homomorphic encryption, Scream (cipher), Israeli cryptographers, Public-key cryptographers, Israeli computer scientists
Publisher: World Heritage Encyclopedia

Shai Halevi

Shai Halevi
Born 1966
Residence U.S
Fields Computer science, cryptography
Institutions IBM T.J. Watson Research Center
Alma mater
Thesis Theory and Practice of Secret Commitment (1997)
Doctoral advisor Silvio Micali[1]
Known for

Shai Halevi (Hebrew: שי הלוי‎; born 1966) is a computer scientist who works in the cryptography research group at IBM's Thomas J. Watson Research Center.

Born in Israel in 1966, Halevi received him B.A. and M.Sc. in computer science from the Technion, Israel Institute of Technology in 1991 and 1993. He received his Ph.D. in Computer Science from MIT in 1997, and then joined IBM's Thomas J. Watson Research Center, where he is a Principal Research Staff Member.


  • Research 1
  • Software 2
  • References 3
  • External links 4


Shai Halevi's research interests are in cryptography and security. He has published numerous original technical research papers,[3][4] three of which were awarded the IBM Pat Goldberg memorial best-paper award[5] (in 2004, 2012, and 2013). Notable contributions by Shai Halevi include:

  • Obfuscation. Halevi is a co-inventor of the first candidate general-purpose cryptographic obfuscation schemes, with security based on a mathematical conjecture.[6] This development generated much interest in the cryptography community and was called "a watershed moment for cryptography."[2]
  • Cryptographic Multilinear Maps. Halevi is a co-inventor of Cryptographic Multilinear Maps (which constitute the main technical tool behind crytographic obfuscation and many other applications), solving a long-standing open problem[7][8]
  • Homomorphic Encryption. Halevi is one of the leading researchers on homomorphic encryption. He authored many articles,[9][10][11][12][13][14] gave invited lectures and tutorials on the topic,[15][16][17] and he is also the principal developer (together with Victor Shoup) of the HElib homormophic-encryption software library.[18][19][20]
  • The Random Oracle Model. Halevi co-authored the influential work that pointed out for the first time the existence of "structurally flawed" cryptosystems that nonetheless have a proof of security in the random-oracle model.[21]

Since 2013 Halevi is the chair of the steering committee of the Theory of Cryptography Conference. He served on the board of directors of the International Association for Cryptologic Research.[22] He chaired the CRYPTO conference in 2009 and co-chaired the TCC conference in 2006. Halevi also gave many invited talks, including in the USENIX Security Symposium in 2008 and the PKC conference in 2014.


Halevi maintains two open-source software projects: The HElib homomorphic-encryption library,[23] and a web-system for submission/review of articles to academic conferences[24]


  1. ^ Shai Halevi at the Mathematics Genealogy Project
  2. ^ a b Klarreich, Erica (2014-02-03). "Cryptography Breakthrough Could Make Software Unhackable". Quanta Magazine. 
  3. ^ "Shai Halevi's publications at DBLP". 
  4. ^ "Shai Halevi's Google Scholar Profile". 
  5. ^ "Pat Goldberg Memorial Best Papers in CS, EE and Math". 
  6. ^ Sanjam Garg, Craig Gentry, Shai Halevi, Mariana Raykova, Amit Sahai, Brent Waters (2013). "Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits". FOCS 2013 (IEEE): 40–49.  
  7. ^ Sanjam Garg, Craig Gentry, and Shai Halevi. Candidate Multilinear Maps from Ideal Lattices. In EUROCRYPT 2013 (Springer)
  8. ^ "What are Cryptographic Multi-linear Maps?". 2014-05-13. 
  9. ^ M. van Dijk, C. Gentry, S. Halevi, and V. Vaikuntanathan. Fully Homomorphic Encryption over the Integers. In EUROCRYPT 2010 (Springer)
  10. ^ C. Gentry and S. Halevi. Implementing Gentry's fully-homomorphic encryption scheme. In EUROCRYPT 2011 (Springer)
  11. ^ C. Gentry and S. Halevi. Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits. In FOCS 2011 (IEEE)
  12. ^ C. Gentry, S. Halevi, and N. P. Smart. Fully Homomorphic Encryption with Polylog Overhead. In EUROCRYPT 2012 (Springer)
  13. ^ C. Gentry, S. Halevi, and N. P. Smart. Better Bootstrapping in Fully Homomorphic Encryption. In PKC 2012 (Springer)
  14. ^ C. Gentry, S. Halevi, and N. P. Smart. Homomorphic Evaluation of the AES Circuit. In CRYPTO 2012 (Springer)
  15. ^ Fully Homomorphic Encryption. Tutorial in the Winter School on Secure Computation and Efficiency, Bar-Ilan University, 2011.
  16. ^ Fully Homomorphic Encryption. Tutorial in CRYPTO 2011, UC Santa-Barbara
  17. ^ Fully Homomorphic Encryption. Invited lecture at the UCI Workshop on Lattices with Symmetry
  18. ^ Shai Halevi; Victor Shoup. "HElib: An Implementation of homomorphic encryption". Retrieved 31 December 2014. 
  19. ^ S. Halevi and V. Shoup. Algorithms in HElib. In CRYPTO 2014
  20. ^ S. Halevi and V. Shoup. Bootstrapping for HElib. In Cryptology ePrint Archive
  21. ^ Canetti, Ran; Goldreich, Oded; Halevi, Shai (July 2004). "The Random Oracle Methodology, Revisited". JACM (ACM) 51 (4): 557–594. 
  22. ^ "IACR Board of Directors (2013)".  
  23. ^ "HElib: homomorphic-encryption software library". 
  24. ^ "websubrev: Web Submission and Review Software". 

External links

  • Shai Halevi's Home Page
  • The Cryptography Research Group at the IBM T.J.Watson Research Center
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.

Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.