This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)(Learn how and when to remove this template message)
Phillip Rogaway is a professor of computer science at the University of California, Davis. He graduated with 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 and the first Levchin Prize for Real World Cryptography in 2016. Rogaway received an NSF CAREER award in 1996, which the NSA had attempted to prevent by influencing the NSF.
He has been interviewed in multiple media outlets regarding his stance on the ethical obligations that cryptographers and computer scientists have to serve to the public good, specifically in the areas of internet privacy and digital surveillance.
Rogaway's papers cover topics including:
- Concrete security
- DES and DES-X
- Format-preserving encryption
- OCB mode
- Random oracle model
- Zero-knowledge proof
- "ACM Awards Recognize Computer Scientists for Innovations that Have Real World Impact" (Press release). Association for Computing Machinery. 2010-03-30. Retrieved 2014-06-04.
- "The Moral Character of Cryptographic Work" (PDF) (Press release). December 2015. p. 37. Retrieved 2017-06-09.
- Naughton, John. "Algorithm writers need a code of conduct". The Guardian. Guardian News and Media Limited. Retrieved 12 December 2015.
- Rogaway, Phillip. "The Moral Character of Cryptographic Work?" (PDF). Retrieved 12 December 2015.
- Waddell, Kaveh. "The Moral Failure of Computer Scientists". The Atlantic. Atlantic Media Company. Retrieved 12 December 2015.
- Bereznak, Alyssa. "Encryption wars heating up in wake of terror attacks". Yahoo. Yahoo News. Retrieved 12 December 2015.
|This article about a cryptographer is a stub. You can help Wikipedia by expanding it.|