Crypto Bibliography

Citations by Year - 1990

M. Abadi and J. Feigenbaum, Secure Circuit Evaluation: A Protocol Based on Hiding Information from an Oracle Journal of Cryptology 2, 1 (May 1990), 1-12. [.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]

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]

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]

J. Benaloh and J. Leichter, Generalized Secret Sharing and Monotone Functions, Advances in Cryptology (Proceedings of CRYPTO `88. Santa Barbara, CA. August 1988. ed. by S. Goldwasser), Lecture Notes in Computer Science, ed. by G. Goos and J. Hartmanis, v. 403, pp. 27--35, Springer-Verlag, New York, 1990.

C. Bennett, F. Bessette, G. Brassard, L. Salvail, and J. Smolin, Experimental quantum cryptography; Journal of Cryptology, vol. 5, no. 1, 1992, pp. 3 - 28. Preliminary version in Advances in Cryptology - Eurocrypt '90 Proceedings, May 1990, Springer - Verlag, pp. 253 - 265. [.ps.gz]

E. Biham and A. Shamir, Differential Cryptanalsys of DES-Like Cryptosystems, Technical report CS90-16, Weizmann Institute of Science. [.ps.gz]

G. Brassard and C. Crépeau, Sorting out zero-knowledge; In Advances in Cryptology: Proceedings of Eurocrypt '89, volume 434 of Lecture Notes in Computer Science, pages 150-154. Springer-Verlag, 1990. [.ps.gz]

L. Brown and J. Seberry, On the Design of Permutation Boxes in DES Type Cryptosystems [.txt], Advances in Cryptology - Eurocrypt '89, Lecture Notes in Computer Science, vol 434, pp 696-705, J.J. Quisquater, J. Vanderwalle (eds), Springer-Verlag, Berlin, 1990. [.ps.gz] [.txt]

L. Brown, Secure Remote Login [.txt], AUUG90, Melbourne, pp 309-320, Sept 1990. Also published as Technical Report CS35/90, Aug 1990. [.ps.gz] [.txt]

L. Brown, J. Piprzyk, and J. Seberry, LOKI - A Cryptographic Primitive for Authentication and Secrecy Applications [.txt], in Advances in Cryptology - Auscrypt'90, Lecture Notes in Computer Science, vol 453, pp229-236, J Seberry, J Pieprzyk (eds), Springer-Verlag, 1990. [.ps.gz] [.txt]

R. Canetti and O. Goldreich, Bounds on Tradeoffs between Randomness and Communication Complexity; August 1990. [.ps]

C. Crépeau, Verifiable disclosure of secrets and applications; In Advances in Cryptology: Proceedings of Eurocrypt '89, volume 434 of Lecture Notes in Computer Science, pages 181-191. Springer-Verlag, 1990. [.ps.gz]

C. Crépeau, Correct and Private Reductions among Oblivious Transfers; PhD thesis, Department of Elec. Eng. and Computer Science, Massachusetts Institute of Technology, 1990. Supervised by Silvio Micali. [.ps.gz]

C. Crépeau and J. Kilian, Weakening security assumptions and oblivious transfer; In S. Goldwasser, editor, Advances in Cryptology: Proceedings of Crypto '88, volume 403 of Lecture Notes in Computer Science, pages 2-7. Springer-Verlag, 1990. [.ps.gz]

D. Davis and R. Swick, Workstation Services and Kerberos Authentication at Project Athena, MIT Laboratory for Computer Science Technical Memorandum #424 (Feb. 1990). [.ps]

P. Flajolet and A. Odlyzko, Random mapping statistics, P. Flajolet and A. Odlyzko, Advances in Cryptology - EUROCRYPT '89, J.-J. Quisquater and J. Vandewalle (eds.), Springer Verlag, Lecture Notes in Computer Science #434 (1990), pp. 329-354. [.pdf] [.ps]

O. Goldreich and E. Petrank, The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols; October 1990. [.ps]

O. Goldreich, R. Impagliazzo, L. Levin, R. Venkatesan, and D. Zuckerman, Security Preserving Amplification of Hardness; August 1990. [.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]

L. Gong and D. Wheeler, A Matrix Key Distribution Scheme. Journal of Cryptology, Vol.2, No.2, Springer-Verlag, New York, 1990, pp.51-59. [.ps.gz]

L. Gong, A Note on Redundancy in Encrypted Messages, ACM Computer Communication Review, Vol.20, No.5, October, 1990, pp. 18-22. [.ps.gz]

A. Kaldewaij and B. Schoenmakers, Searching by Elimination; Science of Computer Programming 14 (1990) 243-254. [.ps.gz]

K. Kurosawa, Y. Katayama, and W. Ogata, Reshufflable and laziness tolerant mental card game protocol, IEICE Trans., Vol.E80-A, No. 1, 1997, pp. 72-78. (Preliminary version appeared in Advances in Cryptology - EUROCRYPT '90, LNCS 473 (1990), 374-388. [.ps]

J. McLean, The Specification and Modeling of Computer Security, Computer, vol. 23, no. 1, Jan. 1990. [.pdf] [.ps]

J. McLean, Security Models and Information Flow, Proceedings of 1990 IEEE Symposium on Research in Security and Privacy, IEEE Press, 1990. [.pdf] [.ps]

A. Odlyzko, The rise and fall of knapsack cryptosystems, Cryptology and Computational Number Theory, C. Pomerance (ed.), Am. Math. Soc., Proc. Symp. Appl. Math. #42 (1990), pp. 75-88. [.pdf] [.ps]

B. Pfitzmann and M. Waidner, Formal Aspects of Fail-stop Signatures; Interner Bericht 22/90 der Fakultät für Informatik, Universität Karlsruhe, Dezember 1990. [.ps.gz]

B. Pfitzmann and A. Pfitzmann, How to Break the Direct RSA-Implementation of MIXes; Eurocrypt '89, LNCS 434, Springer-Verlag, Berlin 1990, 373-381. [.ps.gz]

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]

V. Shoup, Searching for primitive roots in finite fields; Mathematics of Computation 58:369-380, 1992; extended abstract in Proc. 22nd ACM Symposium on Theory of Computation, pp. 546-554, 1990. [.ps.Z]

V. Shoup and E. Bach, Factoring polynomials using fewer random bits; Journal of Symbolic Computation 9:229-239, 1990. [.ps.Z]

V. Shoup, On the deterministic complexity of factoring polynomials over finite fields; Information Processing Letters 33:261-267, 1990. [.ps.Z]

M. Waidner and B. Pfitzmann, The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability; Universität Karlsruhe 1989; Abstract in: Eurocrypt '89, LNCS 434, Springer-Verlag, Berlin 1990, 690. [.ps.gz]

M. Waidner and B. Pfitzmann, Loss-Tolerance for Electronic Wallets; FTCS 20, 26-28th June 1990, Newcastle upon Tyne (UK), 140-147. [.ps.gz]

Y. Zheng, T. Matsumoto, and H. Imai, Impossibility and optimality results on constructing pseudorandom permutations; Advances in Cryptology -- EuroCrypt'89, Lecture Notes in Computer Science, Vol. 434, pp. 412-422, Springer-Verlag, 1990. [.ps] [.ps.Z]

Y. Zheng, T. Matsumoto, and H. Imai, Provably secure one-way hash functions; (invited talk), Presented at 1990 Workshop on Cryptography and Information Security, Hiroshima, August 1990. [.ps] [.ps.Z]

Y. Zheng, T. Matsumoto, and H. Imai, Connections among several versions of one-way hash functions; Special Issue on Cryptography and Information Security, Transactions of the Institute of Electronics, Information and Communication Engineers of Japan, Vol. E73, No. 7, pp. 1092-1099, July 1990. [.ps] [.ps.Z]

Y. Zheng, T. Matsumoto, and H. Imai, On the construction of block ciphers provably secure and not relying on any unproven hypotheses; Advances in Cryptology -- Crypto'89, Lecture Notes in Computer Science, Vol. 435, pp. 461-480, Springer-Verlag, 1990. [.ps.Z - paper] [.ps.Z - figures]

Y. Zheng, T. Matsumoto, and H. Imai, One-way hash function based on weakened assumption; 1990 National Spring Conference Record, IEICE of Japan, p. 1-289, Tokyo, March 1990. [.ps] [.ps.Z]

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