ACM_Citations
  • USA-2013

    For contributions to provable security methods supporting high-quality, cost-effective cryptography.

  • USA-2009

    For their development of the field of Practice-Oriented Provable-Security and its widespread impact on the theory and practice of cryptography and security. Historically, cryptographic schemes used in practice were designed in ad hoc ways and subject to failure. Practice-Oriented, Provable-Security (POPS), developed by Bellare and Rogaway in a series of papers in the 1990s, changed this, giving us the means to create high-assurance practical cryptography, meaning schemes that were backed by the theoretical guarantee of provable security while meeting practical needs and expectations. Today, POPS-based schemes are cornerstones of Internet security, implemented in most communication security protocols and software - these schemes are used every time someone makes a credit card-based Internet purchase. Meanwhile, the models, techniques and approaches that Bellare and Rogaway introduced, including the random oracle model, have become the foundation of a new subfield of cryptography, inspiring a great amount of follow-on work. Their papers are amongst the most cited in cryptography and their work is discussed in dozens of textbooks. Bellare and Rogaway changed the perception of theory in practice. Prior to their work, practitioners ignored theory or were even antagonistic to it. Today, they not only choose to implement and standardize proven-secure schemes, but make provable security a requirement in some of their calls for algorithms. That this requirement can be met owes much to Bellare and Rogaway's work.

Experience
Education
Bio
Computer security focusing on authentication, encryption, and electronic payment standards that have helped secure transactions over the Internet and advance e-commerce standards.
Research Areas: Cryptography, computer and network security, computational complexity theory.

Distinctions and awards: Fellow of the ACM, 2013; Fellow of the IACR, 2012; Levchin prize, 2019; Test of Time Award given at ACM CCS 2011 conference for paper from ACM CCS 2001; ACM Paris Kanellakis Theory and Practice Award, 2009 ; RSA conference award for mathematics, 2003 ; David and Lucille Packard Foundation Fellowship in Science and Engineering, 1996; NSF CAREER Award, 1996; h-index = 104 (source: Google Scholar); Over 55,000 citations overall (source: Google Scholar); Ranked 2nd in world in terms of number of publications in the Crypto, Eurocrypt and Asiacrypt conferences; IBM Outstanding Innovation Award, 1997; IBM Outstanding Technical Achievement award, 1996; IBM Invention Achievement Awards, 1993 and 1995; IBM Author Recognition Award, 1993; Spencer Eaken Allmond Scholarship, 1986; Carnation Prize, Caltech, 1985; Member, Tau Beta Pi honor society.