• Publications
  • Influence
Random oracles are practical: a paradigm for designing efficient protocols
TLDR
It is argued that the random oracles model—where all parties have access to a public random oracle—provides a bridge between cryptographic theory and cryptographic practice, and yields protocols much more efficient than standard ones while retaining many of the advantages of provable security.
Entity Authentication and Key Distribution
TLDR
This work provides the first formal treatment of entity authentication and authenticated key distribution appropriate to the distributed environment and presents a definition, protocol, and proof that the protocol meets its goal, assuming only the existence of a pseudorandom function.
Authenticated Key Exchange Secure against Dictionary Attacks
TLDR
Correctness for the idea at the center of the Encrypted Key-Exchange protocol of Bellovin and Merritt is proved: it is proved security, in an ideal-cipher model, of the two-flow protocol at the core of EKE.
Relations among Notions of Security for Public-Key Encryption Schemes
TLDR
The goals of privacy and non-malleability are considered, each under chosen plaintext attack and two kinds of chosen ciphertext attack, and a new definition of non-Malleability is proposed which the author believes is simpler than the previous one.
OCB: a block-cipher mode of operation for efficient authenticated encryption
TLDR
It is proved OCB secure, quantifying the adversary's ability to violate the mode's privacy or authenticity in terms of the quality of its block cipher as a pseudorandom permutation (PRP) or as a strong PRP, respectively.
Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
  • P. Rogaway
  • Computer Science, Mathematics
    ASIACRYPT
  • 5 December 2004
TLDR
The results bolster the thesis that a desirable approach for designing modes of operation is to start from a tweakable blockcipher and refine the authenticated-encryption scheme OCB and message authentication code PMAC, yielding variants of these algorithms that are simpler and faster than the original schemes, and yet have simpler proofs.
A concrete security treatment of symmetric encryption
TLDR
This work studies notions and schemes for symmetric (ie. private key) encryption in a concrete security framework and gives four different notions of security against chosen plaintext attack, providing both upper and lower bounds, and obtaining tight relations.
The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin
TLDR
An RSA-based signing scheme which combines essentially optimal efficiency with attractive security properties and a second scheme which maintains all of the above features and in addition provides message recovery is provided.
Optimal Asymmetric Encryption
TLDR
A slightly enhanced scheme is shown to have the property that the adversary can create ciphertexts only of strings for which she “knows” the corresponding plaintexts—such a scheme is not only semantically secure but also non-malleable and secure against chosen-ciphertext attack.
Provably secure session key distribution: the three party case
TLDR
This paper provides the first treatment of session key distribution in the three-party setting of Needham and Schroeder in the complexity-theoretic framework of modern cryptography, assuming the (minimal) assumption of a pseudorandom function.
...
...