Phillip Rogaway

University of California, Davis
United States

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name Citations Publications World Ranking National Ranking

Computer Science D-index 78 Citations 40,442 166 World Ranking 688 National Ranking 406

Research.com Recognitions

Awards & Achievements

2009 - ACM Paris Kanellakis Theory and Practice Award For their development of the field of Practice-Oriented Provable-Security and its widespread impact on the theory and practice of cryptography and security.

Overview

What is he best known for?

The fields of study Phillip Rogaway is best known for:

Cryptography
Block cipher
Cryptographic hash function

Much of his study explores Computer security relationship to Triple DES. Phillip Rogaway incorporates Theoretical computer science and Programming language in his research. His study deals with a combination of Programming language and Theoretical computer science. Encryption and Cipher are two areas of study in which he engages in interdisciplinary research. He integrates Cryptography and Hash function in his research. In his research, Phillip Rogaway undertakes multidisciplinary study on Hash function and Algorithm. His work on Algorithm is being expanded to include thematically relevant topics such as Pseudorandom function family. His Pseudorandom function family study frequently draws connections between related disciplines such as Pseudorandom number generator. Pseudorandom number generator and Block cipher are two areas of study in which he engages in interdisciplinary research.

His most cited work include:

Entity Authentication and Key Distribution (1342 citations)
Authenticated Key Exchange Secure against Dictionary Attacks (1139 citations)
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin (777 citations)

What are the main themes of his work throughout his whole career to date

Many of his studies on Computer security involve topics that are commonly interrelated, such as Key (lock). His research ties Computer security and Key (lock) together. He connects Theoretical computer science with Programming language in his study. Phillip Rogaway undertakes interdisciplinary study in the fields of Programming language and Theoretical computer science through his works. Encryption and Cryptographic nonce are frequently intertwined in his study. In his articles, Phillip Rogaway combines various disciplines, including Cryptography and Message authentication code. Borrowing concepts from Cryptography, he weaves in ideas under Message authentication code. He combines Algorithm and Pseudorandom number generator in his research. He combines Hash function and Double hashing in his studies.

Phillip Rogaway most often published in these fields:

Computer security (81.82%)
Theoretical computer science (71.43%)
Encryption (54.55%)

What were the highlights of his more recent work (between 2014-2018)?

Encryption (85.71%)
Computer security (85.71%)
Authenticated encryption (71.43%)

In recent works Phillip Rogaway was focusing on the following fields of study:

His study explores the link between Dimension (graph theory) and topics such as Pure mathematics that cross with problems in Field (mathematics). Phillip Rogaway combines topics linked to Pure mathematics with his work on Field (mathematics). His study explores the link between Abstraction and topics such as Epistemology that cross with problems in Simple (philosophy). His research links Epistemology with Simple (philosophy). His work blends Encryption and Secure channel studies together. He merges Secure channel with Encryption in his study. Phillip Rogaway connects Computer security with Internet privacy in his study. By researching both Internet privacy and Computer security, Phillip Rogaway produces research that crosses academic boundaries. His multidisciplinary approach integrates Authenticated encryption and Semantic security in his work.

Between 2014 and 2018, his most popular works were:

Robust Authenticated-Encryption AEZ and the Problem That It Solves (98 citations)
Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance (32 citations)
Big-Key Symmetric Encryption: Resisting Key Exfiltration (21 citations)

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

Random oracles are practical: a paradigm for designing efficient protocols

Mihir Bellare;Phillip Rogaway.
computer and communications security (1993)

5912 Citations

Entity authentication and key distribution

Mihir Bellare;Phillip Rogaway.
international cryptology conference (1993)

2178 Citations

Relations Among Notions of Security for Public-Key Encryption Schemes

Mihir Bellare;Anand Desai;David Pointcheval;David Pointcheval;Phillip Rogaway.
international cryptology conference (1998)

2126 Citations

Authenticated Key Exchange Secure Against Dictionary Attacks.

Mihir Bellare;David Pointcheval;Phillip Rogaway.
IACR Cryptology ePrint Archive (2000)

1822 Citations

The security of triple encryption and a framework for code-based game-playing proofs

Mihir Bellare;Phillip Rogaway.
Lecture Notes in Computer Science (2006)

1691 Citations

Optimal asymmetric encryption

Mihir Bellare;Phillip Rogaway.
theory and application of cryptographic techniques (1994)

1689 Citations

Authenticated key exchange secure against dictionary attacks

Mihir Bellare;David Pointcheval;Phillip Rogaway.
theory and application of cryptographic techniques (2000)

1674 Citations

A concrete security treatment of symmetric encryption

M. Bellare;A. Desai;E. Jokipii;P. Rogaway.
foundations of computer science (1997)

1386 Citations

The exact security of digital signatures-how to sign with RSA and Rabin

Mihir Bellare;Phillip Rogaway.
theory and application of cryptographic techniques (1996)

1304 Citations

Cryptographic hash-function basics: Definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance

Phillip Rogaway;Thomas Shrimpton.
Lecture Notes in Computer Science (2004)

937 Citations

If you think any of the details on this page are incorrect, let us know.