Protecting the world’s most sensitive data
Phil Rogaway is a professor in the Department of Computer Science at the University of California, Davis, USA. He is also a regular visitor to the Department of Computer Science at Chiang Mai University, Thailand. Phil studies cryptography, protocols, network security, and the theory of computation. He has done extensive work on the application of encryption algorithms, including authenticated encryption, Variable Input Length ciphers, wide-block ciphers, and the encryption of finite sets. This work has been applied to solve problems in disk encryption, network traffic encryption, and Format-Preserving Encryption. Recently he has worked to develop an area of “practice-oriented provable security.” The aim there is to use theoretically sound techniques, mostly reductions, as the basis for the design and analysis of practical cryptographic protocols. The approach is yielding cryptographic protocols in diverse domains with improved performance and security characteristics.
Phil received an NSF CAREER Award in 1996 for his proposal, Practice-Oriented Provable Security. He is a member of IEEE, ACM, IACR (International Association for Cryptologic Research), and CPSR (Computer Professionals for Social Responsibility).