Crypto Bibliography

J. Feigenbaum, L. Fortnow, S. Laplante, and A. Naik, On Coherence, Random-Self-Reducibility, and Self-Correction, Computational Complexity. Extended abstract appears in Proceedings of the 1996 IEEE Conference on Computational Complexity. (The first ten in this series of conferences were called "Structure in Complexity Theory.")

R. Canetti, U. Feige, O. Goldreich, and M. Naor, Adaptively Secure Multi-party Computation; TR-682, LCS/MIT, 1996. [.ps]

M. Naor and A. Wool, Acceess Control and Signatures via Quorum Secret Sharing; 5th ACM Conf. on Computer and Communication Security, 1996.

Y. Frankel and M. Naor, Codes for Interactive Authentication; Crypto 93 and submitted by invitation to the Journal of Cryptology. [.ps]

M. Blaze, J. Feigenbaum, and M. Naor, A Formal Treatment of Remotely Keyed Encryption (Extended Abstract), in Advances in Cryptology - Eurocrypt '98, Lecture Notes in Computer Science, vol. 1403, Springer, Berlin, 1998, pp. 251-265. [.pdf] [.ps]

R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas, Multicast Security: A Taxonomy and Efficient Constructions, Proc. INFOCOM '99, Vol. 2, pp. 708-716, March 1999. [.ps]

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 B. Pinkas, Visual Authentication; Crypto 97. [.ps.gz]

M. Naor and A. Shamir, Visual Cryptography II; Cambrdige Workshop on Protocols, 1996. [.ps.gz]

R. Impagliazzo and M. Naor, Efficient cryptographic schemes provably as secure as subset sum [.ps]

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.

M. Naor and B. Pinkas, Secure and Efficient Metering; Eurocrypt 98. [.ps] [.ps.gz]

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. Naor and O. Reingold, From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs;

M. Bellare, R. Impagliazzo, and M. Naor, Does Parallel Repetition Lower the Error in Computationally Sound Protocols?, Extended abstract in Proceedings of 38th Annual Symposium on Foundations of Computer Science, IEEE, 1997.

M. Naor and A. Shamir, Visual Cryptography; Eurocrypt 94. [.ps.gz]

M. Naor and K. Nissim, Certificate Revocation and Certificate Update; 7th USENIX Security Symposium, 1998. [.ps.gz]

M. Naor and A. Wool, The Load Capacity and Availability of Quorum Systems; SIAM J. of Computing, vol. 27, n. 2, 1998. (Prelim. version, 35th FOCS).

M. Blaze, J. Feigenbaum, and M. Naor, A Formal Treatment of Remotely-Keyed Encryption; Eurocrypt 98.

R. Fagin, M. Naor, and P. Winkler, Comparing Inforamtion Without Leaking It; Communications of the ACM, vol 39, May 1996, pp. 77-85.

C. Dwork, J. Lotspiech, and M. Naor, Digital Signets: Self-Enforcing Protection of Digital Information; Proc. 28th Ann. ACM Symp. on Theory of Computing, 1997, pp.

R. Anderson and R. Needham, Programming Satan's Computer, Computer Science Today, LNCS 1000, Springer-Verlag, 1995, pp 426-441. [.ps.gz]

M. Abadi, M. Burrows, and R. Needham, The Scope of a Logic of Authentication, Distributed Computing and Cryptography: Proceedings of a DIMACS Workshop (October 1989), 119-126. Also appeared as appendix to SRC Research Report 39. [.ps]

R. Anderson, R. Needham, and A. Shamir, The Steganographic File System. [.ps.gz]

R. Anderson and R. Needham, Robustness Principles for Public Key Protocols, in Advances in Cryptology - CRYPTO 95, Springer LNCS v. 963, pp. 236-247. [.ps.gz]

L. Gong, T. Lomas, R. Needham, and J. Saltzer, Protecting Poorly Chosen Secrets from Guessing Attacks, IEEE Journal on Selected Areas in Communications, Vol.11, No.5, June, 1993, pp.648-656. [.ps.gz]

M. Abadi, T. Mark, A. Lomas, and R. Needham, Strengthening Passwords; SRC Technical Note 1997-033 (September/December 1997). [.ps]

M. Abadi, M. Burrows, and R. Needham A Logic of Authentication, Proceedings of the Royal Society, Series A, 426, 1871 (December 1989), 233-271. Also appeared as SRC Research Report 39 and, in a shortened form, in ACM Transactions on Computer Systems 8, 1 (February 1990), 18-36. [.ps]

R. Anderson, F. Bergadano, B. Crispo, J. Lee, C. Manifavas, and R. Needham, A New Family of Authentication Protocols, Operating Systems Review, vol. 32, n. 4, pp. 9-20, October 1998, ACM Press. [.ps.gz]

M. Abadi and R. Needham, Prudent Engineering Practice for Cryptographic Protocols, IEEE Transactions on Software Engineering 22, 1 (January 1996), 6-15. [.ps]

L. Gong, R. Needham, and R. Yahalom, Reasoning about Belief in Cryptographic Protocols, Proceedings of the IEEE Symposium on Research in Security and Privacy, Oakland, California, May, 1990, pp. 234-248. [.ps.gz]

T. Lomas, L. Gong, J. Salzer, and R. Needham, Reducing Risks from Poorly Chosen Keys, Proceedings of the 12th ACM Symposium on Operating System Principles, Litchfield Park, Arizona, December, 1989. Published as ACM Operating Systems Review, Vol.23, No.5, pp.14-18. [.ps.gz]

J. Buchmann and S. Neis, Algorithms for Linear Algebra Problems over Principal Ideal Rings; Technical Report No. TI-7/96, 1996. [.ps]

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.

P. Nguyen and J. Stern, Cryptanalysis of the Ajtai-Dwork Cryptosystem, Advances in Cryptology -- Proceedings of CRYPTO '98, vol. 1462 of LNCS, Springer-Verlag, pp. 223-242.

P. Nguyen and J. Stern, The Beguin-Quisquater Server-Aided RSA Protocol from Crypto '95 is not Secure, Advances in Cryptology - Proceedings of ASIACRYPT '98, vol. 1514 of LNCS, Springer-Verlag, pp 372-379.

P. Nguyen and J. Stern, Cryptanalysis of a Fast Public Key Cryptosystem Presented at SAC '97, Proc. of SAC '98.

O. Baudron, H. Gilbert, L. Granboulan, H. Handschuh, A. Joux, P. Nguyen, F. Noilhan, D. Pointcheval, T. Pornin, G. Poupard, J. Stern, and S. Vaudenay, Report on the AES Candidates, Proceedings of the Second AES Candidate Conference, Rome, Italy, 1999. [.pdf]

P. Nguyen and J. Stern, Merkle-Hellman Revisited: a Cryptanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations, Advances in Cryptology -- Proceedings of CRYPTO '97, vol. 1294 of LNCS, Springer-Verlag, pp. 198-212.

P. Nikander and L. Viljanen, Storing and Retrieving Internet Certificates, Proceedings of the NORDSEC'98 (The Third Nordic Workshop on Secure IT Systems), Nov. 5-6 1998, Trondheim, Norway. [.ps]

O. Goldreich, N. Nisan, and A. Wigderson, On Yao's XOR-Lemma; March 1995. [.ps]

O. Goldreich, L. Levin, and N. Nisan, On Constructing 1-1 One-Way Functions; June 1995. [.ps]

G. Even, O. Goldreich, M. Luby, N. Nisan, and B. Velickovic, Approximations of General Independent Distributions, Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing, 1992. [.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. Naor and K. Nissim, Certificate Revocation and Certificate Update; 7th USENIX Security Symposium, 1998. [.ps.gz]

Y. Amir, G. Ateniese, D. Hasse, Y. Kim, C. Nita-Rotaru, T. Schlossnagle, J. Schultz, J. Stanton, and G. Tsudik, Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments, 2000 International Conference on Distributed Computing Systems. [.pdf]

O. Baudron, H. Gilbert, L. Granboulan, H. Handschuh, A. Joux, P. Nguyen, F. Noilhan, D. Pointcheval, T. Pornin, G. Poupard, J. Stern, and S. Vaudenay, Report on the AES Candidates, Proceedings of the Second AES Candidate Conference, Rome, Italy, 1999. [.pdf]

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]

L. Knudsen and K. Nyberg, Provable Security Against a Differential Attack, The Journal of Cryptology, vol.8, No. 1, 1995. [.ps.Z]

R. Anderson, S. Vaudenay, B. Preneel, and K. Nyberg, The Newton Channel, Info Hiding 96, pp. 39-48. [.ps.Z] [.ps.gz]

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