Phillip Rogaway
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[1] and the first Levchin Prize for Real World Cryptography in 2016.
He has been interviewed in multiple media outlets[2] regarding his stance[3] on the ethical obligations that cryptographers and computer scientists have to serve to the public good,[4] specifically in the areas of internet privacy and digital surveillance.[5]
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 proof
References
- ↑ "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.
- ↑ 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.
External links
This article is issued from Wikipedia - version of the 3/19/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.