Crypto Bibliography

T. Aura, P. Koponen, and J. Räsänen, Delegation-based access control for intelligent network services, Proceedings of ECOOP Workshop on Distributed Object Security, Brussels, Belgium, July 1998. [.ps]

D. Fox and A. Röhm, Effiziente Digitale Signatursysteme auf der Basis Elliptischer Kurven; In: Horster, P. (Hrsg.): Digitale Signaturen. Proceedings der Arbeitstagung Digitale Signaturen 96, Vieweg-Verlag, Braunschweig, September 1996, S. 201-220.

H. Ritter and C. Rössner, Factoring via Strong Lattice Reduction Algorithm, Technical Report, Universität Frankfurt am Main, Mai 1997. [.ps]

R. Gennaro, M. Rabin, and T. Rabin, Simplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography, Proceedings of the 1998 ACM Symposium on Principles of Distributed Computing. [.ps]

R. Gennaro, H. Krawczyk, and T. Rabin, RSA-Based Undeniable Signatures, Proceedings of CRYPTO'97. [.ps]

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust and Efficient Sharing of RSA Functions, Proceedings of CRYPTO'96. [.ps]

H. Krawczyk and T. Rabin, Chameleon Hashing and Signatures, preprint. [.ps]

R. Cramer, I. Dåard, S. Dziembowski, M. Hirt, and T. Rabin, Efficient multiparty computations secure against an adaptive adversary, Advances in Cryptology -- EUROCRYPT '99, LNCS v. 1592, 1999, pp. 309-323. [.ps.gz]

M. Bellare, J. Garay, and T. Rabin, Fast batch verification for modular exponentiation and digital signatures; Extended abstract in Advances in Cryptology- Eurocrypt 98 Proceedings, Lecture Notes in Computer Science Vol. ??, K. Nyberg ed, Springer-Verlag, 1998.

R. Gennaro, M. Rabin, and T. Rabin, Simplified VSS and Fast-track Multiparty Computations with Applications to Threshold Cryptography, Proceedings of the 1998 ACM Symposium on Principles of Distributed Computing. [.ps]

R. Canetti, R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Adaptive Security for Threshold Cryptosystems, Proc. Advances in Cryptology - CRYPTO '99, Michael Wiener (Ed.), LNCS (1666), Springer-Verlag, August 1999. (This is an extended version.) [.ps.gz]

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Secure Distributed Key Generation for Discrete-Log Based Cryptosystems, Proceedings Eurocrypt '99, Lecture Notes in Computer Science, Vol. 1592, Springer-Verlag, 1999. (This version has an appendix added.) [.ps.gz]

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust Threshold DSS Signatures, Proceedings of EUROCRYPT'96, Springer Verlag, LNCS 1070, pp. 354-371. [.ps]

J. Garay, R. Gennaro, C. Jutla, and T. Rabin, Secure Distributed Storage and Retrieval, Theoretical Computer Science. A preliminary version appeared in WDAG'97. [.ps]

M. Bellare, J. Garay, and T. Rabin, Distributed Pseudo-Random Bit Generators - A New Way to Speed Up Shared Coin Tossing, Proc. 15th Annual Symp. on Principles of Distributed Computing pp. 191-200, Philadelphia, May 1996. [.ps]

R. Gennaro, D. Micciancio, and T. Rabin, An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products, Proceedings of the Fifth ACM Conference on Computer and Communications Security, 1998. [.ps]

C. Radu, Analysis and design of off-line electronic payment systems, Doctoral Dissertation, K.U. Leuven, October 1997.

D. Martin, S. Rajagopalan, and A. Rubin, Blocking Java Applets at the Firewall; Proc. ISOC Symposium on Network and Distributed System Security (February, 1997). [.ps]

R. Chang, B. Chor, O. Goldreich, J. Hartmanis, J. Hastad, D. Ranjan, and P. Rohatgi, The Random Oracle Hypothesis is False; July 1992. [.ps]

U. Jendricke and K. Rannenberg, A MixDemonstrator for teaching Security in the Virtual University, Louise Yngström and Simone Fischer-Hübner (Eds.), Proceedings of the IFIP TC11 WG 11.8 First World Conference on Information Security Education, pages 83-98. IFIP TC11 WG 11.8, Department of Computer and System Sciences, Stockholm University, June 1999. ISBN 91-7153-910-7. [.pdf]

U. Jendricke and K. Rannenberg, A MixDemonstrator for teaching Security in the Virtual University, In Louise Yngström and Simone Fischer-Hübner (Eds.), Proceedings of the IFIP TC11 WG 11.8 First World Conference on Information Security Education, pages 83-98. IFIP TC11 WG 11.8, Department of Computer and System Sciences, Stockholm University, June 1999. ISBN 91-7153-910-7. [.pdf]

S. Chari, C. Jutla, J. Rao, and P. Rohatgi, A Cautionary Note Regarding Evaluation of AES Candidates on Smart-Cards, presented at the Second AES Conference in Rome, 1999. [.ps]

P. Ammann, S. Jajodia, and I. Ray, P. Ammann, S. Jajodia, and I. Ray, ``Ensuring atomicity of multilevel transactions, Proc. IEEE Symp. on Research in Security and Privacy, Oakland, Calif., May 1996, pp. 74-84. [.ps]

I. Ray, E. Bertino, S. Jajodia, and L. Mancini, An advanced commit protocol for MLS distributed database systems, Proc. 3rd ACM Conf. on Computer and Communications Security, New Delhi, India, March 1996, pp. 119-128. [.ps]

R. Rees and D. Stinson, Combinatorial characterizations of authentication codes II; Designs, Codes and Cryptography 7 (1996), 239-259. [.ps]

D. Fox, T. Henn, K. Reichel, and C. Ruland, Guarded Authentic Local Area Network - GALAN; In: Brüggemann, H.-H.; Gerhardt, W. (Hrsg.): Proceedings der Fachtagung Verläßliche IT-Systeme VIS '95. DuD-Fachbeiträge 22, Vieweg-Verlag, Braunschweig, April 1995, S. 163-180.

M. Naor and O. Reingold, Number-Theoretic constructions of efficient pseudo-random functions; Extended abstract in: Proc. 38th IEEE Symp. on Foundations of Computer Science, 1997, pp. 458-467

M. Naor and O. Reingold, From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs;

M. Naor and O. Reingold, On the construction of pseudo-random permutations: Luby-Rackoff revisited, J. of Cryptology. Extended abstract in: Proc. 29th Ann. ACM Symp. on Theory of Computing, 1997, pp. 189-199.

E. Biham, D. Boneh, and O. Reingold, Generalized Diffie-Hellman modulo a composite is not weaker than factoring, Information Processing Letters (IPL).

M. Naor and O. Reingold, Synthesizers and their application to the parallel construction of pseudo-random functions; Extended abstract in: Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 170-181.

M. Franklin and M. Reiter, The design and implementation of a secure auction service, IEEE Transactions on Software Enginerring, Vol. 22, No. 5, May 1996, 302--312. Earlier version in Proc. 1995 IEEE Conference on Security and Privacy. [.ps]

D. Malkhi, M. Reiter, and A. Rubin, Secure Execution of Java Applets using a Remote Playground; Proc. IEEE Symposium on Security and Privacy (May, 1998). [.pdf] [.ps]

M. Reiter and L. Gong, Preventing Denial and Forgery of Causal Relationships in Distributed Systems, Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, California, May, 1993, pp.30-40. [.ps.gz]

M. Franklin and M. Reiter, The design and implementation of a secure auction service, IEEE Transactions on Software Engineering, Vol. 22, No. 5, May 1996, pp. 302-312. [.ps]

M. Franklin and M. Reiter, Fair exchange with a semi-trusted third party, Proc. ACM Conference on Computer and Communications Security, 1997. [.ps]

M. Franklin and M. Reiter, Fair exchange with a semi-trusted third party, Proc. ACM Conference on Computer and Communications Security, 1997. [.ps]

M. Reiter and A. Rubin, Crowds: Anonymity for Web Transactions; ACM Transactions on Information and System Security, (April, 1998). [.ps.gz]

D. Coppersmith, M. Franklin, J. Patarin, and M. Reiter, Low exponent RSA with related messages, Advances in Cryptology -- Eurocrypt '96 Proceedings, 1996. Earlier version in IBM Research Report RC 20318, December 27, 1995. [.ps]

M. Franklin, D. Coppersmith, J. Patarin, and M. Reiter, Low exponent RSA with related messages, Advances in Cryptology -- Eurocrypt '96 Proceedings. [.ps]

I. Jermyn, A. Mayer, F. Montrose, M. Reiter, and A. Rubin, The Design and Analysis of Graphical Passwords, Proc. 8th USENIX Security Symposium, 1999. [.pdf]

V. Anupam, A. Mayer, K. Nissim, B. Pinkas, and M. Reiter On the Security of Pay-per-Click and Other Web Advertising Schemes, Proc. 8th World Wide Web Conference, 1999.

M. Reiter, K. Birman, and L. Gong, Integrating Security in a Group-Oriented Distributed System, Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, California, May, 1992, pp.18-32. [.ps.gz]

M. Blaze, J. Feigenbaum, P. Resnick, and M. Strauss, Managing Trust in an Information-Labeling System, European Transactions on Telecommunications, 8 (1997), pp. 491-501. Special issue of selected papers from the 1996 Amalfi Conference on Secure Communication in Networks.

Y.-h. Chu, J. Feigenbaum, B. LaMacchia, P. Resnick, and M. Strauss, REFEREE: Trust Management for Web Applications, World Wide Web Journal, 2 (1997), pp. 127-139. Reprinted from Proceedings of the 6th International World Wide Web Conference, World Wide Web Consortium, Cambridge, 1997, pp. 227-238. [.ps]

M. Riaz and H. Heys, The FPGA Implementation of the RC6 and CAST-256 Encryption Algorithms, in Proceedings of IEEE Canadian Conference on Electrical and Computer Engineering, Edmonton, Alberta, May 1999. [.ps]

E. Biham, A. Biryukov, O. Dunkelman, E. Richardson, and A. Shamir, Initial Observations on Skipjack: Cryptanalysis of Skipjack-3XOR, Proceedings of SAC'98. [.ps.gz]

M. Morconi, X. Qian, R. A. Riemenschneider, and L. gong, Secure Software Architectures, Proceedings of the IEEE Symposium On Security And Privacy, Oakland, California, May 1997, pp.84--93. [.ps.gz]

L. Knudsen, V. Rijmen, R. Rivest, and M. Robshaw, On the Design and Security of RC2, FSE5. [.ps] [.ps.gz]

L. Knudsen and V. Rijmen, Truncated Differentials of IDEA, ESAT-COSIC Technical Report 97-1, 1997. [.ps]

V. Rijmen, J. Daemen, B. Preneel, A. Bosselaers, and E. De Win, The cipher SHARK, Fast Software Encryption, LNCS 1039, D. Gollmann, Ed., Springer-Verlag, 1996, pp. 99-112. [.ps]

B. Preneel, V. Rijmen, and A. Bosselaers, Recent developments in the design of conventional cryptographic algorithms, Computer Security and Industrial Cryptography, State of the Art and Evolution, LNCS 1528, B. Preneel, R. Govaerts, J. Vandewalle, Eds., Springer-Verlag, 1998, pp. 106-131. [.pdf]

L. Knudsen, J. Daemen, and V. Rijmen, The block cipher SQUARE, Proc. Fast Software Encryption '97. [.pdf]

V. Rijmen and B. Preneel, Cryptanalysis of McGuffin, Fast Software Encryption, LNCS 1008, B. Preneel, Ed., Springer-Verlag, 1995, pp. 353-358. [.ps.gz]

V. Rijmen and B. Preneel, A family of trapdoor ciphers, Fast Software Encryption, LNCS 1267, E. Biham, Ed., Springer-Verlag, 1997, pp. 139-148. [.ps.gz]

V. Rijmen and B. Preneel, Improved characteristics for differential cryptanalysis of hash functions based on block ciphers, Fast Software Encryption, LNCS 1008, B. Preneel, Ed., Springer-Verlag, 1995, pp. 242-248. [.ps.gz]

L. Knudsen, V. Rijmen, and B. Van Rompay, Differential Cryptanalysis of ICE, FSE5. [.ps] [.ps.gz]

J. Borst, L. Knudsen, and V. Rijmen, Two attacks on reduced IDEA, Advances in Cryptology, Proceedings Eurocrypt '97, LNCS 1233, W. Fumy, Ed., Springer-Verlag, 1997, pp. 1-13. [.ps.gz]

J. Daemen and V. Rijmen, J. Daemen and V. Rijmen, The Block Cipher Rijndael, Proc. of CARDIS'98, LNCS, Springer-Verlag.

C. Hall, J. Kelsey, V. Rijmen, B. Schneier, and D. Wagner, Cryptanalysis of SPEED, Fifth Annual Workshop on Selected Areas in Cryptography, Springer Verlag, August 1998, pp. 318-338.

B. Van Rompay, L. Knudsen, and V. Rijmen, Differential cryptanalysis of the ICE encryption algorithm, Fast Software Encryption 98, LNCS 1372 , S. Vaudenay, Ed., Springer-Verlag, 1998, pp. 270-283. [.ps.gz]

V. Rijmen and B. Preneel, On weaknesses of non-surjective round functions, Proceedings of the Workshop on Selected Areas in Cryptography - SAC'95, Ottawa, May 18-19, 1995, pp. 100-106. [.ps.gz]

B. Preneel, M. Nuttin, V. Rijmen, and J. Buelens, Cryptanalysis of the CFB mode of the DES with a reduced number of rounds, Advances in Cryptology, Proceedings Crypto'93, LNCS 773 , D. Stinson, Ed., Springer-Verlag, 1994, pp. 212-223. [.ps.gz]

J. Daemen, M. Peeters, V. Rijmen, and G. Van Assche, The Noekeon Block Cipher, Nessie Proposal, First Open Nessie Workshop, November 2000.

J. Riordan and B. Schneier, Environmental Key Generation towards Clueless Agents, Mobile Agents and Security, G. Vigna, ed., Springer-Verlag, 1998, pp. 15-24.

J. Riordan and B. Schneier, A Certified E-Mail Protocol with No Trusted Third Party, 13th Annual Computer Security Applications Conference, ACM Press, December 1998, pp. 347-351.

H. Ritter and C. Rössner, Factoring via Strong Lattice Reduction Algorithm, Technical Report, Universität Frankfurt am Main, Mai 1997. [.ps]

H. Ritter, Breaking Knapsack Cryptosystems by Max-Norm Enumeration, Proceedings of 1st International Conference of the Theory and Appications of Cryptology - Pragocrypt '96, pp. 480-492, 1996. [.ps]

M. Blaze, W. Diffie, R. Rivest, B. Schneier, T. Shimomura, E. Thompson, and M. Weiner, Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security, January 1996.

R. Rivest, Perspectives on Financial Cryptography; iinvited talk given at the Financial Cryptography '97 conference. [.ps] [.ppt]

O. Goldreich, B. Pfitzmann, and R. Rivest, Self-Delegation with Controlled Propagation; September 1997. [.ps]

R. Rivest, Finding Four Million Large Random Primes; Proc. CRYPTO 90 (Springer 1991), 625--626. [.pdf]

S. Goldwasser, S. Micali, and R. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen Message Attacks; SIAM J. Computing 17,2 (April 1988), 281--308. [.pdf]
(Note.) [.txt]

R. Rivest, M. Blaze, W. Diffie, R. Rivest, B. Schneier, T. Shimomura, E. Thompson, and M. Wiener, Minimal Key Lenths for Symmetric Ciphers to Provide Adequate Commercial Security [.ps]

R. Rivest, M.J.B. Robshaw, R. Sidney, and Y. Yin, The RC6 Block Cipher; a block cipher submitted for consideration as the new AES [.pdf] [.ps]

R. Rivest, Cryptography and Machine Learning; Proceedings ASIACRYPT '91 (Springer 1993), 427--439. [.pdf]

D. Gillman and R. Rivest, Complete Variable-Length `FixFree' Codes; Designs, Codes, and Cryptography 5,2 (March 1995), 109--114. [.ps]

R. Rivest and B. Lampson, SDSI---A Simple Distributed Security Infrastructure; (See also the SDSI Page); [Version 1.0] (PowerPoint 4.0 slides for USENIX 96 presentation); (PowerPoint 4.0 slides for RSA Laboratories Colloquia 96 presentation); (PowerPoint 7.0 slides for CRYPTO 96 presentation);

R. Rivest, Testing Implementations of DES; (unpublished, 2/85) [.txt]

O. Goldreich, B. Pfitzmann, and R. Rivest, Self-Delegation with Controlled Propagation -- or -- What If You Lose Your Laptop; Theory of Cryptography Library 97-12, September 1997.

R. Rivest, Cryptography; Chapter 13 of Handbook of Theoretical Computer Science, (ed. J. Van Leeuwen) vol. 1 (Elsevier, 1990), 717--755. [.ps] [.pdf] [note - .txt]

R. Rivest, Electronic Lottery Tickets as Micropayments; Financial Cryptography '97. [.ps]

R. Rivest, A. Shamir, and L. Adleman, A Method for Obtaining Digital Signatures and Public-Key Cryptosystems Communications of the ACM 21,2 (Feb. 1978), 120--126. [.ps]

R. Rivest, The RC5 Encryption Algorithm, Proceedings of the 1994 Leuven Workshop on Algorithms (Springer). [.pdf] [.ps]
Note on corrections: [.txt]
Revised version, 3/20/97: [.pdf] [.ps]

M. Bellare and R. Rivest, Translucent cryptography -- An alternative to key escrow, and its implementation via fractional oblivious transfer. Earlier version was MIT Laboratory for Computer Science Technical Memo No. 683, February 1996.

R. Rivest, The MD4 Message Digest Algorithm; Internet RFC 1320 (April 1992). [.txt]

R. Rivest and A. Shamir, PayWord and MicroMint--Two Simple Micropayment Schemes. [.ps] [.ppt]

H. Abelson, R. Anderson, S. Bellovin, J. Benaloh, M. Blaze, W. Diffie, J. Gilmore, P. Neumann, R. Rivest, J. Schiller, and B. Schneier, The Risks of Key Recovery, Key Escrow, and Trusted Third-Party Encryption [PDF]. An earlier version appeared in World Wide Web Journal, v.2, n.3, 1997, pp. 241-257.

R. Rivest, All-Or-Nothing Encryption and The Package Transform, proceedings of the 1997 Fast Software Encryption Conference. [.ps]

R. Rivest, Can We Eliminate Certificate Revocation Lists?; Proceedings of Financial Cryptography '98, Springer Lecture Notes on Computer Science No. 1465 (Rafael Hirschfeld, ed.), February 1998, pp. 178-183. [.pdf] [.ps]

R. Rivest, The MD5 Message Digest Algorithm; Internet RFC 1321 (April 1992). [.txt]

L. Knudsen, V. Rijmen, R. Rivest, and M. Robshaw, On the Design and Security of RC2, FSE5. [.ps] [.ps.gz]

R. Rivest, Multi-grade cryptography. [.ps]

R. Rivest, M. Blaze, W. Diffie, R. Rivest, B. Schneier, T. Shimomura, E. Thompson, and M. Wiener, Minimal Key Lenths for Symmetric Ciphers to Provide Adequate Commercial Security [.ps]

R. Rivest, Cryptography as Duct Tape; a short note written to the Senate Commerce and Judiciary Committees in opposition to mandatory key recovery proposals. Version of June 12, 1997 [.txt]

R. Rivest, Chaffing and Winnowing: Confidentiality without Encryption, MIT Lab for Computer Science, March 18, 1998 (rev. April 24, 1998) [.txt]

M. Burmester, R. Rivest, and A. Shamir, Geometric Cryptography; [.ps]

B. Chor and R. Rivest, A Knapsack Type Cryptosystem Based on Arithmetic in Finite Fields; IEEE Trans. Information Theory 34,5 (Sep. 1988), 901--909. (Also in CRYPTO 84.) [.pdf]

G. Brassard, C. Crépeau, and J.-M. Robert, All-or-nothing disclosure of secrets (extended abstract); In Advances in Cryptology: Proceedings of Crypto '86, volume 263 of Lecture Notes in Computer Science, pages 234-238. Springer-Verlag, 1987. [.ps.gz]

G. Brassard, C. Crépeau, and J.-M. Robert, Information theoretic reductions among disclosure problems; In 27th Symp. of Found. of Computer Sci., pages 168-173. IEEE, 1986. [.ps.gz]

L. Knudsen, V. Rijmen, R. Rivest, and M. Robshaw, On the Design and Security of RC2, FSE5. [.ps] [.ps.gz]

L. Knudsen and M. Robshaw, Non-linear Approximations in Linear Cryptanalysis, Advances in Cryptology -- Proc. EUROCRYPT'96, LNCS 1070, Springer Verlag, 1996, pp. 224-236. [.ps.Z]

R. Rivest, M.J.B. Robshaw, R. Sidney, and Y. Yin, The RC6 Block Cipher; a block cipher submitted for consideration as the new AES [.pdf] [.ps]

R. Anderson and M. Roe, The GCHQ Protocol and its Problems, Eurocrypt 97. [.ps.Z] [.ps.gz]

M. Abdalla, M. Bellare, and P. Rogaway, DHAES: An Encryption Scheme Based on the Diffie-Hellman Problem [.ps.gz] [.ps] [.pdf], Contributions to P1363, September 1998. [.ps]

M. Bellare, A. Desai, E. Jokipii, and P. Rogaway, A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation, Extended abstract in Proceedings of 38th Annual Symposium on Foundations of Computer Science, IEEE, 1997.

M. Bellare and P. Rogaway, Collision-Resistant Hashing: Towards Making UOWHFs Practical, Extended abstract in Advances in Cryptology- Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed, Springer-Verlag, 1997.

J. Kilian and P. 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. [.ps] [.ps.gz]

M. Bellare, A. Desai, E. Jokipii, and P. Rogaway, A concrete security treatment of symmetric encryption: Analysis of the DES modes of operation; Proceedings of 38th Annual Symposium on Foundations of Computer Science (FOCS 97), IEEE, 1997.

M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway, Relations among notions of security for public-key encryption schemes; Advances in Cryptology - CRYPTO '98, Lecture Notes in Computer Science, Vol. 1462, H. Krawczyk, ed., Springer-Verlag.

M. Bellare and P. Rogaway, The complexity of approximating a nonlinear program; Journal of Mathematical Programming B, Vol. 69, No. 3, pp. 429-441, September 1995. [.ps] [.ps.gz]

D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway, Locally Random Reductions: Improvements and Applications, Journal of Cryptology, 10 (1997), pp. 17-36. [.pdf] [.ps]

M. Bellare, G. Di Crescenzo, and P. Rogaway, On the construction of variable-input-length ciphers, Proc. Fast Software Encryption '99. [.ps]

H. Lipmaa, P. Rogaway, and D. Wagner, Comments to NIST Concerning AES-modes of Operations: CTR-mode Encryption, Symmetric Key Block Cipher Modes of Operation Workshop, Baltimore, Maryland, US, 20 October 2000. Electronic proceedings available from http://www.nist.gov/modes.

P. Rogaway, Bucket hashing and its application to fast message authentication; Advances in Cryptology - CRYPTO '95, Lecture Notes in Computer Science, Vol. 963, D. Coppersmith, ed., Springer-Verlag, 1995. [.ps] [.ps.gz]

M. Bellare, J. Kilian, and P. Rogaway, The security of the cipher block chaining message authentication code; Advances in Cryptology - CRYPTO '94, Lecture Notes in Computer Science, Vol. 839. Y. Desmedt, ed., Springer-Verlag, 1994. Extended abstract in Advances in Cryptology -- Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed, Springer-Verlag, 1994.

P. Rogaway, The security of DESX; Less technical summary of the above article. RSA Laboratories' CryptoBytes, Summer 1996. [.ps] [.ps.gz]

M. Bellare, T. Krovetz, and P. Rogaway, Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible, Extended abstract in Advances in Cryptology -- Eurocrypt 98 Proceedings, Lecture Notes in Computer Science Vol. 1403, K. Nyberg ed, Springer-Verlag, 1998.

D. Beaver, S. Micali, and P. Rogaway, The round complexity of secure protocols; Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, (STOC 90), 1990, 503-513. [.ps] [.ps.gz]

M. Bellare and P. Rogaway, Optimal asymmetric encryption -- How to encrypt with RSA, Advances in Cryptology - Eurocrypt 94 Proceedings, Lecture Notes in Computer Science Vol. 950, A. De Santis ed, Springer-Verlag, 1995.

M. Bellare and P. Rogaway, Entity Authentication and key distribution. Extended abstract in Advances in Cryptology - Crypto 93 Proceedings, Lecture Notes in Computer Science Vol. 773, D. Stinson ed, Springer-Verlag, 1994.

M. Bellare and P. Rogaway, On the construction of variable-input-length ciphers, Proceedings of the 6th Workshop on Fast Software Encryption, LNCS v. 1636, Springer-Verlag, 1999.

M. Bellare and P. Rogaway, The exact security of digital signatures: How to sign with RSA and Rabin. Extended abstract in Advances in Cryptology - Eurocrypt 96 Proceedings, Lecture Notes in Computer Science Vol. 1070, U. Maurer ed, Springer-Verlag, 1996.

J. Black, S. Halevi, H. Krawczyk, T. Krovetz, and P. Rogaway, UMAC: Fast and Secure Message Authentication, J. Black, S. Halevi, H. Krawczyk, T. Krovetz, P. Rogaway, Proceedings of Crypto 99, 1999. [.pdf] [.ps]

D. Beaver, S. Micali, and P. Rogaway, The Round Complexity of Secure Protocols (extended abstract); Proceedings of the 22nd STOC, ACM, 1990, 503-513. [.ps] [.ps.gz]

M. Bellare and P. Rogaway, Random oracles are practical: A paradigm for designing efficient protocols. Extended abstract in Proc. First Annual Conference on Computer and Communications Security, ACM, 1993. Full version available.

D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway, Security with Low Communication Overhead (extended abstract), Advances in Cryptology - Crypto '90 Proceedings, Springer-Verlag, 1991, 62-76. [.pdf]

M. Bellare and P. Rogaway, Collision-Resistant Hashing: Towards Making UOWHFs Practical; Extended abstract in Advances in Cryptology- Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed, Springer-Verlag, 1997.

M. Bellare and P. Rogaway, Provably secure session key distribution: the three party case. Proc. 27th Annual Symposium on the Theory of Computing, ACM, 1995.

P. Rogaway and D. Coppersmith, A software-optimized encryption algorithm; Fast software encryption, Lecture Notes in Computer Science, Vol. 809, R. Anderson, ed., Springer-Verlag, 1993. [.ps] [.ps.gz]

M. Bellare, R. Guerin, and P. Rogaway, XOR MACs: New methods for message authentication using finite pseudorandom functions. Extended abstract in Advances in Cryptology - Crypto 95 Proceedings, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed, Springer-Verlag,1995.

S. Chari, C. Jutla, J. Rao, and P. Rohatgi, A Cautionary Note Regarding Evaluation of AES Candidates on Smart-Cards, presented at the Second AES Conference in Rome, 1999. [.ps]

R. Gennaro and P. Rohatgi, How to Sign Digital Streams, Proceedings of CRYPTO'97. [.ps]

R. Chang, B. Chor, O. Goldreich, J. Hartmanis, J. Hastad, D. Ranjan, and P. Rohatgi, The Random Oracle Hypothesis is False; July 1992. [.ps]

O. Goldreich and D. Ron, Property Testing in Bounded-Degree Graphs; 1997. [.ps]

O. Goldreich, S. Goldwasser, and D. Ron, A Note on Testing Monotinicity; 1997. [.ps]

O. Goldreich, S. Goldwasser, and D. Ron, Property Testing and its connection to Learning and Approximation; 1996.

S. Decatur, O. Goldreich, and D. Ron, Computational Sample Complexity; April 1997. [.ps]

O. Goldreich and D. Ron, A Universal Learning Algorithm; June 1996. [.ps]

O. Goldreich and D. Ron, A Sublinear Bipartite Tester for Bounded Degree Graphs; 1997. [.ps]

E. Kushilevitz and A. Rosén, A Randomness-Rounds Tradeoff in Private Computation, SIDMA 11(1), 1998, pp. 61-80. Early version: Crypto 94. [.ps.Z]

R. Canetti, E. Kushilevitz, R. Ostrovsky, and A. Rosén, Randomness vs. Fault-Tolerance, PODC 97. [.ps.Z]

E. Kushilevitz, R. Ostrovsky, and A. Rosén, Characterizing Linear Size Circuits in Terms of Privacy, STOC 96. [.ps.Z]

A. Rubin, D. Boneh, and K. Fu, Revocation of Unread E-mail in an Untrusted Network; Second Australasian Conference on Information Security and Privacy (July, 1997).

A. Rubin, Independent One-Time Passwords; USENIX Journal of Computer Systems (February, 1996). [.pdf] [.ps.gz]

I. Jermyn, A. Mayer, F. Montrose, M. Reiter, and A. Rubin, The Design and Analysis of Graphical Passwords, Proc. 8th USENIX Security Symposium, 1999. [.pdf]

V. Shoup and A. Rubin, Session Key Distribution Using Smart Cards; Proc. of Eurocrypt '96 (May, 1996). [.ps]

F. Monrose and A. Rubin, Authentication via Keystroke Dynamics; 4th ACM Conference on Computer and Communcations Security (April, 1997). [.ps] [.pdf]

D. Malkhi, M. Reiter, and A. Rubin, Secure Execution of Java Applets using a Remote Playground; Proc. IEEE Symposium on Security and Privacy (May, 1998). [.pdf] [.ps]

D. Martin, S. Rajagopalan, and A. Rubin, Blocking Java Applets at the Firewall; Proc. ISOC Symposium on Network and Distributed System Security (February, 1997). [.ps]

M. Reiter and A. Rubin, Crowds: Anonymity for Web Transactions; ACM Transactions on Information and System Security, (April, 1998). [.ps.gz]

A. Rubin, An Experience Teaching a Graduate Course in Cryptography; Cryptologia (April, 1997). [.ps]

V. Shoup and A. Rubin, Session-key distrubution using smart cards; in Proc. Eurocrypt '96, pp. 321-31, 1996. [.ps.Z]

A. Rubin and P. Honeyman, Formal methods for the analysis of authentication protocols ; CITI Technical Report 93-7 (October, 1993). [.ps]

O. Goldreich, R. Rubinfeld, and M. Sudan, Learning polynomials with queries: the highly noisy case; FOCS95 version. [.ps]

B. Chor, J. Freidmann, O. Goldreich, J. Hastad, S. Rudich, and R. Smolensky, The Bit Extraction Problem or t-Resilient Functions; 1985. [.ps]

F. Bergadano, B. Crispo, and G. Ruffo, Proactive Password Checking with Decision Trees, Proc. 4th ACM Conference on Computer and Communications Security, Zurich, April 1997.

D. Fox, T. Henn, K. Reichel, and C. Ruland, Guarded Authentic Local Area Network - GALAN; In: Brüggemann, H.-H.; Gerhardt, W. (Hrsg.): Proceedings der Fachtagung Verläßliche IT-Systeme VIS '95. DuD-Fachbeiträge 22, Vieweg-Verlag, Braunschweig, April 1995, S. 163-180.

D. Fox, and C. Ruland, Secure Common ISDN Application Programming Interface; In: Fumy, W.; Meister, G.; Reitenspieß, M.; Schäfer, W. (Hrsg.): Sicherheitsschnittstellen - Konzepte, Anwendungen und Einsatzbeispiele. Proceedings des VIS-Workshops Security APIs '94, Deutscher Universitäts-Verlag, Wiesbaden 1994, S. 195-210.

D. Dienst, D. Fox, and C. Ruland, Transparente Sicherheitsmechanismen für ISDN-Anwendungen; ITG-Fachtagung Nutzung und Technik von Kommunikationsendgeräten. ITG-Fachbericht 131, vde-verlag, Offenbach 1994, S. 81-95.

L. Gong, P. Lincoln, and J. Rushby, Byzantine Agreement with Authentication: Observations and Applications in Tolerating Hybrid Faults, Proceedings of the 5th IFIP Working Conference on Dependable Computing for Critical Applications, Urbana-Champaign, Illinois, September 1995.

M. Rusinowitch and M. Turuani, Protocol Insecurity with Finite Number of Sessions is NP-complete, 14th IEEE Computer Security Foundations Workshop, June 11-13, 2001 Cape Breton, Nova Scotia, Canada. [.ps]

Schneier.com is a personal website. Opinions expressed are not necessarily those of BT Counterpane.