World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

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

Carmit Hazay publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Carmit Hazay sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 109 publications — 11th percentile

11% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Carmit Hazay D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Carmit Hazay sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 33 D-Index — 13th percentile

13% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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