Professor Rogaway studies cryptography, protocols, network security, and the theory of computation. 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. Professor Rogaway 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).
Professor Rogaway's personal home page
Office: 3009 Kemper Hall