World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
113
Citations
71936
World Ranking
197
National Ranking
114

Research.com Recognitions

  • 2013 - ACM Fellow For contributions to provable security methods supporting high-quality, cost-effective cryptography.
  • 2009 - ACM Paris Kanellakis Theory and Practice Award For their development of the field of Practice-Oriented Provable-Security and its widespread impact on the theory and practice of cryptography and security.

Overview

Mihir Bellare is affiliated with the University of California, San Diego in the United States. Their research primarily falls within the broad field of Computer Science, with a significant focus on Artificial Intelligence and Information Systems alongside areas such as Computer Networks and Communications, Computer Vision and Pattern Recognition, and General Health Professions.

The core topics addressed in Bellare's work center around Cryptography and Data Security. This includes Cryptographic Implementations and Security, Security and Verification in Computing, Advanced Authentication Protocols Security, Chaos-based Image/Signal Encryption, Coding theory and cryptography, and Cryptography and Residue Arithmetic.

Among recent publications, Bellare has contributed to multiple venues with the following works:

  • "Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements" (2020, DOAJ - Directory of Open Access Journals)
  • "Reimagining Secret Sharing: Creating a Safer and More Versatile Primitive by Adding Authenticity, Correcting Errors, and Reducing Randomness Requirements" (2020, Proceedings on Privacy Enhancing Technologies)
  • "Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of a Prevailing Assumption" (2024, Journal of Cryptology)
  • "Security under Message-Derived Keys: Signcryption in iMessage" (2020, IACR Cryptology ePrint Archive)
  • "Separate Your Domains: NIST PQC KEMs, Oracle Cloning and Read-Only Indifferentiability" (2020, Repository for Publications and Research Data, ETH Zurich)

Bellare frequently collaborates with other researchers including Doreen Riepel, Hannah M. Davis, Felix Günther, Wei-Min Dai, and Laura Shea.

The scientist's work appears across several academic venues, notably:

  • DOAJ (DOAJ: Directory of Open Access Journals)
  • Proceedings on Privacy Enhancing Technologies
  • Journal of Cryptology
  • IACR Cryptology ePrint Archive
  • Repository for Publications and Research Data (ETH Zurich)

Recognition in the scientific community includes the ACM Fellow award in 2013 for contributions to provable security methods supporting high-quality, cost-effective cryptography. Additionally, Bellare received the ACM Paris Kanellakis Theory and Practice Award in 2009 for work developing the field of Practice-Oriented Provable-Security and its impact on cryptography and security theory and practice.

Best Publications

  • Random oracles are practical: a paradigm for designing efficient protocols

    Mihir Bellare;Phillip Rogaway

  • HMAC: Keyed-Hashing for Message Authentication

    H. Krawczyk;M. Bellare;R. Canetti

  • Keying Hash Functions for Message Authentication

    Mihir Bellare;Ran Canetti;Hugo Krawczyk

  • Entity authentication and key distribution

    Mihir Bellare;Phillip Rogaway

  • Relations Among Notions of Security for Public-Key Encryption Schemes

    Mihir Bellare;Anand Desai;David Pointcheval;David Pointcheval;Phillip Rogaway

  • Authenticated Key Exchange Secure Against Dictionary Attacks.

    Mihir Bellare;David Pointcheval;Phillip Rogaway

  • The security of triple encryption and a framework for code-based game-playing proofs

    Mihir Bellare;Phillip Rogaway

  • Optimal asymmetric encryption

    Mihir Bellare;Phillip Rogaway

  • A concrete security treatment of symmetric encryption

    M. Bellare;A. Desai;E. Jokipii;P. Rogaway

  • The exact security of digital signatures-how to sign with RSA and Rabin

    Mihir Bellare;Phillip Rogaway

  • Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm

    Mihir Bellare;Chanathip Namprempre

  • Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions

    Michel Abdalla;Mihir Bellare;Dario Catalano;Eike Kiltz

  • Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions

    Michel Abdalla;Mihir Bellare;Dario Catalano;Eike Kiltz

  • Deterministic and efficiently searchable encryption

    Mihir Bellare;Alexandra Boldyreva;Adam O'Neill

  • Foundations of group signatures: Formal definitions, simplified requirements, and a construction based on general assumptions

    Mihir Bellare;Daniele Micciancio;Bogdan Warinschi

  • A forward-secure digital signature scheme.

    Mihir Bellare;Sara K. Miner

  • OCB: a block-cipher mode of operation for efficient authenticated encryption

    Phillip Rogaway;Mihir Bellare;John Black;Ted Krovetz

  • OCB: A block-cipher mode of operation for efficient authenticated encryption

    Phillip Rogaway;Mihir Bellare;John Black

  • Message-Locked Encryption and Secure Deduplication

    Mihir Bellare;Sriram Keelveedhi;Thomas Ristenpart

  • Advances in Cryptology — CRYPTO 2000

    Mihir Bellare

  • Searchable encryption revisited

    Michel Abdalla;Mihir Bellare;Dario Catalano;Eike Kiltz

Frequent Co-Authors

Phillip Rogaway
Phillip Rogaway University of California, Davis
Thomas Ristenpart
Thomas Ristenpart Cornell University
Tadayoshi Kohno
Tadayoshi Kohno University of Washington
Alexandra Boldyreva
Alexandra Boldyreva Georgia Institute of Technology
Shafi Goldwasser
Shafi Goldwasser University of California, Berkeley
Oded Goldreich
Oded Goldreich Weizmann Institute of Science
Michel Abdalla
Michel Abdalla École Normale Supérieure
David Pointcheval
David Pointcheval École Normale Supérieure
Brent Waters
Brent Waters The University of Texas at Austin

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

Expanding your education online can open doors to new career opportunities in computer science and beyond. Many students explore affordable options, with cheap online masters programs helping graduates upskill without overwhelming debt. Such programs are ideal for those seeking to advance in specialized tech roles or management positions.

If you’re aiming for leadership or academic credentials, consider the phd organizational leadership or pursue a more education-focused most affordable edd programs. These advanced degrees can boost qualifications for high-level or administrative IT careers.

Alternatively, students looking to enter the workforce quickly might start with the quickest associates degree. These programs provide essential technical training and can serve as a stepping stone to a bachelor’s degree.

No matter your goals, exploring related online degrees can help you adapt your education for today’s tech-driven job market.

Best Scientists Citing Mihir Bellare

Trending Scientists