Crypto Bibliography

Citations by Year - 1989

M. Abadi, J. Feigenbaum, and J. Kilian, On Hiding Information from an Oracle Journal of Computer and System Sciences 39, 1 (August 1989), 21-50. [.ps]

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]

B. Awerbuch, O. Goldreich, D. Peleg, and R. Vainish, A Trade-off between Information and Communication in Broadcast Protocols; June 1989. [.ps]

J. Bar-Ilan and D. Beaver, Non-Cryptographic Fault-Tolerant Computing in a Constant Expected Number of Rounds of Interaction (extended abstract); Proceedings of PODC, ACM, 1989, 201-209. [.pdf]

D. Beaver and S. Goldwasser, Multiparty Computation with Faulty Majority, Advances in Cryptology: Crypto '89, ed. Gilles Brassard. [.pdf]

S. Bellovin, Security Problems in the TCP/IP Protocol Suite; in Computer Communications Review 2:19, pp. 32-48, April 1989. [.pdf] [.ps]

S. Ben-David, B. Chor, O. Goldreich, and M. Luby, On the Theory of Average Case Complexity; 1989. [.ps]

G. Brassard, C. Crépeau, and M. Yung, Everything in NP can be argued in perfect zero-knowledge in a constant number of rounds; In 16th ICALP, volume 372 of Lecture Notes in Computer Science, pages 123-136. Springer-Verlag, 1989. [.ps.gz]

L. Brown and J. Seberry, Key Scheduling in DES Type Cryptosystems [.txt], Advances in Cryptology - Auscrypt'90, Lecture Notes in Computer Science, vol 453, pp221-228, J Seberry, J Pieprzyk (eds), Springer-Verlag, 1990. Also published as Technical Report CS25/89, Oct 1989. [.ps.gz] [.txt]

J. Buchmann, Düllmann, and Williams, On the complexity and efficiency of a new key exchange system; (EuroCrypt 1989) [.ps.gz]

M. Furer, O. Goldreich, Y. Mansour, M. Sipser, and S. Zachos, On Completeness and Soundness in Interactive Proof Systems, 1989. [.ps]

O. Goldreich, A Note on Computational Indistinguishability; 1989. [.ps]

L. Gong, Using One-Way Functions for Authentication, ACM Computer Communication Review, Vol.19, No.5, October, 1989, pp. 8-11. [.ps.gz]

L. Gong, A Secure Identity-Based Capability System, Proceedings of the IEEE Symposium on Security and Privacy, Oakland, California, May, 1989, pp.56-63. [.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]

A. Pfitzmann, B. Pfitzmann, and M. Waidner, Telefon-MIXe: Schutz der Vermittlungsdaten für zwei 64-kbit/s-Duplexkanäle über den (2*64 + 16)-kbit/s-Teilnehmeranschluß; Datenschutz und Datensicherung DuD /12 (1989) 605-622. [.ps.gz]

V. Shoup, Removing Randomness from Computational Number Theory; Ph. D. Thesis, University of Wisconsin, 1989. [.ps.Z]

M. Waidner and B. Pfitzmann, Unconditional Sender and Recipient Untraceability in spite of Active Attacks - Some Remarks; Fakultät für Informatik, Universität Karlsruhe, Interner Bericht 5/89, March 1989. [.ps.gz]

Y. Zheng, T. Matsumoto, and H. Imai, Several theorems on probabilistic cryptosystems; Transactions of the Institute of Electronics, Information and Communication Engineers of Japan, Vol. E72, No. 7, pp. 819-827, July 1989. [.ps] [.ps.Z]

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