World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
33
Citations
4272
World Ranking
12744
National Ranking
194

Overview

Carmit Hazay is affiliated with Bar-Ilan University in Israel. Their research primarily encompasses the field of computer science, with a substantial focus on the subfields of artificial intelligence, computational theory and mathematics, information systems, electrical and electronic engineering, and computer vision and pattern recognition.

Their work spans a variety of main topics including cryptography and data security, complexity and algorithms in graphs, cryptographic implementations and security, security and verification in computing, privacy-preserving technologies in data, blockchain technology applications and security, and coding theory and cryptography.

Hazay's frequent publication venues include the Journal of Cryptology, where they have published seven papers, as well as the Leibniz-Zentrum für Informatik (Schloss Dagstuhl), which features three of their works. Other venues include Designs Codes and Cryptography, IACR Transactions on Cryptographic Hardware and Embedded Systems, and the Proceedings on Privacy Enhancing Technologies.

They have contributed to academic books published by Springer Science+Business Media, including titles such as Public-Key Cryptography - PKC 2022.

Notable recent papers authored or co-authored by Hazay include:

  • Low Cost Constant Round MPC Combining BMR and Oblivious Transfer, 2020, Journal of Cryptology
  • Ligero: lightweight sublinear arguments without a trusted setup, 2023, Designs Codes and Cryptography
  • Round-Optimal Secure Multi-party Computation, 2021, Journal of Cryptology
  • Fully Secure PSI via MPC-in-the-Head, 2022, Proceedings on Privacy Enhancing Technologies
  • Garbled Circuits from an SCA Perspective, 2023, IACR Transactions on Cryptographic Hardware and Embedded Systems

Their collaboration network includes frequent co-authors such as Muthuramakrishnan Venkitasubramaniam, Mor Weiss, Sebastian Faust, David Kretzler, and Benjamin Schlosser, with the strongest collaboration being 16 joint publications.

Best Publications

  • Ligero: Lightweight Sublinear Arguments Without a Trusted Setup

    Scott Ames;Carmit Hazay;Yuval Ishai;Muthuramakrishnan Venkitasubramaniam

  • Efficient Secure Two-Party Protocols: Techniques and Constructions

    Carmit Hazay;Yehuda Lindell

  • Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries

    Carmit Hazay;Yehuda Lindell

  • Efficient Secure Two-Party Protocols

    Carmit Hazay;Yehuda Lindell

  • Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting

    Carmit Hazay;Gert Læssøe Mikkelsen;Tal Rabin;Tomas Toft

  • Secure two-party computation with low communication

    Ivan Damgård;Sebastian Faust;Carmit Hazay

  • Complete Fairness in Secure Two-Party Computation

    S. Dov Gordon;Carmit Hazay;Jonathan Katz;Yehuda Lindell

  • Computationally Secure Pattern Matching in the Presence of Malicious Adversaries

    Carmit Hazay;Tomas Toft

  • Low Cost Constant Round MPC Combining BMR and Oblivious Transfer

    Carmit Hazay;Peter Scholl;Eduardo Soria-Vazquez

  • Efficient set operations in the presence of malicious adversaries

    Carmit Hazay;Kobbi Nissim

  • Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

    Carmit Hazay;Yehuda Lindell

  • Towards a game theoretic view of secure computation

    Gilad Asharov;Ran Canetti;Carmit Hazay

  • Efficient Set Intersection with Simulation-Based Security

    Michael J. Freedman;Carmit Hazay;Kobbi Nissim;Benny Pinkas

  • Scalable Multi-party Private Set-Intersection

    Carmit Hazay;Muthuramakrishnan Venkitasubramaniam

  • On Compression of Data Encrypted With Block Ciphers

    D. Klinc;C. Hazay;A. Jagmohan;H. Krawczyk

  • Approximate parameterized matching

    Carmit Hazay;Moshe Lewenstein;Dina Sokol

  • Constructions of truly practical secure protocols using standardsmartcards

    Carmit Hazay;Yehuda Lindell

  • Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs

    Carmit Hazay

  • Efficient RSA key generation and threshold paillier in the two-party setting

    Carmit Hazay;Gert Læssøe Mikkelsen;Tal Rabin;Tomas Toft

  • Leakage-Resilient Cryptography from Minimal Assumptions

    Carmit Hazay;Adriana López-Alt;Hoeteck Wee;Daniel Wichs

  • Ligero++: A New Optimized Sublinear IOP

    Rishabh Bhadauria;Zhiyong Fang;Carmit Hazay;Muthuramakrishnan Venkitasubramaniam

  • Efficient Set Operations in the Presence of Malicious Adversaries

    Carmit Hazay;Kobbi Nissim

Frequent Co-Authors

Yehuda Lindell
Yehuda Lindell Bar-Ilan University
Sebastian Faust
Sebastian Faust Technical University of Darmstadt
Yuval Ishai
Yuval Ishai Technion – Israel Institute of Technology
Tal Rabin
Tal Rabin University of Pennsylvania
Kobbi Nissim
Kobbi Nissim Georgetown University
Hugo Krawczyk
Hugo Krawczyk Amazon (United States)
Daniel Wichs
Daniel Wichs Northeastern University
Ran Canetti
Ran Canetti Boston University
Rosario Gennaro
Rosario Gennaro City College of New York
Jesper Buus Nielsen
Jesper Buus Nielsen Aarhus University

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

Pursuing a degree in Computer Science opens doors to a range of career paths, and online education provides flexible options for students from all backgrounds. You may be wondering what masters program should I do to advance your career. Highly demanded online master's degrees such as Computer Science, Data Science, and Cybersecurity can help you develop cutting-edge skills for top tech roles.

For those looking for quicker pathways, there are 1 year associate degree programs online that offer a fast-tracked introduction to IT fields, coding, and web development. These programs are perfect if you want to start working sooner or build a foundation before pursuing further study.

Affordability is a significant consideration; many students seek cheap online degrees fast to avoid accumulating debt while remaining competitive in the job market. There are a variety of accredited online colleges offering high-value, budget-friendly programs in Computer Science and related IT disciplines.

Worried about your academic record? You might ask, will grad schools accept low gpa? Fortunately, several reputable online colleges consider more than just GPA for admission, emphasizing work experience and personal achievements as well.

Best Scientists Citing Carmit Hazay

Trending Scientists

Recently Published Articles