Papers

This page lists papers since 1993. A brief research summary is also available.

The following papers are all in PostScript. If can't read them from your browser you may need to download a PostScript previewer or configure your browser to use the appropriate helper.

[Enc97]
Mihir Bellare, Anand Desai, Eron Jokipii and Phillip Rogaway
A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation
Full version. Extended abstract in Proceedings of 38th Annual Symposium on Foundations of Computer Science (FOCS 97), IEEE, 1997.

[Hash97]
Mihir Bellare and Phillip Rogaway
Collision-resistant hashing: Towards making UOWHFs practical
Earlier version in Advances in Cryptology - Crypto '97, Lecture Notes in Computer Science, Vol. 1294, B. Kaliski, ed., Springer-Verlag, 1997. This is the full version.

[MinRO97]
Mihir Bellare and Phillip Rogaway
Minimizing the use of random oracles in authenticated encryption schemes
To appear at ICICS'97, 1997 Originally a contribution to IEEE P1363.

[LRR97]
Don Beaver, Joan Feigenbaum, Joe Kilian and Phillip Rogaway
Locally random reductions: Improvements and applications
Journal of Cryptology, Winter 1997, pp. 17-36.

[DESX96]
Joe Kilian and Phillip Rogaway
How to protect DES against exhaustive key search.
Advances in Cryptology - Crypto '96, Lecture Notes in Computer Science, Vol. 1109, N. Koblitz, ed., Springer-Verlag, 1996, pp. 252-267. See also:

[desx96]
Phillip Rogaway
The security of DESX
Less technical summary of the above article. RSA Laboratories' CryptoBytes, Summer 1996.

[Sign96]
Mihir Bellare and Phillip Rogaway
The exact security of digital signatures-- How to sign with RSA and Rabin
Earlier version appears in Advance in Cryptology - Eurocrypt '96, Lecture Notes in Computer Science, Vol. 1070, U. Maurer, ed., Springer-Verlag, pp. 399-416. 1996.

[Bucket95]
Phillip Rogaway
Bucket hashing and its application to fast message authentication
Full version of Crypto '95 paper (revised July 1997). Preliminary version in Advances in Cryptology - Crypto '95, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995.

[XORMac95]
Mihir Bellare, Roch Guerin and Phillip Rogaway
XOR MACs: New methods for message authentication using finite pseudorandom functions
Full paper. Preliminary version in Advances in Cryptology - Crypto '95, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995.

[3PKD95]
Mihir Bellare and Phillip Rogaway
Provably secure session key distribution-- the three party case
Proc. 27th Annual Symposium on the Theory of Computing, ACM, 1995.

[QP95]
Mihir Bellare and Phillip Rogaway
The complexity of approximating a nonlinear program
Journal of Mathematical Programming B, Vol. 69, No. 3, pp. 429-441, September 1995. (Earlier version in Complexity of Numerical Optimization, ed. P. M. Pardalos, World Scientific, 1993.)

[CBCmac94]
Mihir Bellare, Joe Kilian and Phillip Rogaway
The security of cipher block chaining
Full paper. Preliminary version in Advances in Cryptology - Crypto '94, Lecture Notes in Computer Science Vol. 839. Y. Desmedt ed., Springer-Verlag, 1994.

[EA93]
Mihir Bellare and Phillip Rogaway
Entity authentication and key distribution
Full version. Preliminary version was in Advances in Cryptology - Crypto '93, Lecture Notes in Computer Science Vol. 773, D. Stinson ed., Springer-Verlag, 1994.

[OAEP95]
Mihir Bellare and Phillip Rogaway
Optimal asymmetric encryption -- How to encrypt with RSA
Advances in Cryptology - Eurocrypt '94, Lecture Notes in Computer Science Vol. 950, A. De Santis ed, Springer-Verlag, 1995.

[SEAL93]
Phillip Rogaway and Don Coppersmith
A software-optimized encryption algorithm,
Preliminary version appears in Fast software encryption, Cambridge, 1993.
This is the full paper (revised September 1997). It specifies SEAL 3.0.

[RO93]
Mihir Bellare and Phillip Rogaway
Random oracles are practical: a paradigm for designing efficient protocols
Proc. First Annual Conference on Computer and Communications Security, ACM, 1993.

[SFE90]
Don Beaver, Silvio Micali and Phillip Rogaway
The round complexity of secure protocols
Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing (STOC 90), 1990, 503-513.

I have also, on occasion, prepared some comments for standardization bodies.



To Rogaway's home page.