Phillip Rogaway (also referred to as Phil Rogaway[1][2]) is an American cryptographer who is a professor of computer science at the University of California, Davis. He graduated from Beverly Hills High School, and later earned a BA in computer science from UC Berkeley and completed his PhD in cryptography at MIT, in the Theory of Computation group. He has taught at UC Davis since 1994. He was awarded the Paris Kanellakis Award in 2009[3] and the first Levchin Prize for Real World Cryptography in 2016.[4] Rogaway received an NSF CAREER award in 1996, which the NSA had attempted to prevent by influencing the NSF.[5]
He has been interviewed in multiple media outlets[6] regarding his stance[7] on the ethical obligations that cryptographers and computer scientists have to serve to the public good,[8] specifically in the areas of internet privacy and digital surveillance.[9]
Rogaway's papers cover topics including:
- CMAC
- Concrete security
- DES and DES-X
- Format-preserving encryption
- OCB mode
- Random oracle model
- SEAL
- UMAC
- Zero-knowledge proofs