Crypto Bibliography

Citations by Year - 1992

M. Abadi, B. Lampson, M. Burrows, and E. Wobber, Authentication in Distributed Systems: Theory and Practice, ACM Transactions on Computer Systems 10, 4 (November 1992), 265-310. (Also appeared as SRC Research Report 83.) [.pdf]

N. Alon, O. Goldreich, J. Hastad, and R. Peralta, Simple Constructions of Almost $k$-wise Independent Random Variables; June 1992. [.ps] Addendum: [.ps]

D. Beaver, Foundations of Secure Interactive Computing (extended abstract); Advances in Cryptology - Crypto '91 Proceedings, Springer-Verlag, 1992, 377-391. [.pdf]

D. Beaver, Efficient Multiparty Protocols Using Circuit Randomization (extended abstract); Advances in Cryptology - Crypto '91 Proceedings, Springer-Verlag, 1992, 420-432. [.pdf]

R. Beigel and J. Feigenbaum, On Being Incoherent Without Being Very Hard, Computational Complexity, 2 (1992), pp. 1-17.

M. Bellare and S. Micali, How to sign given any trapdoor permutation. Journal of the ACM, Vol. 39, No. 1, January 1992, pp. 214-233.

M. Bellare and O. Goldreich, Proving computational ability. Manuscript, August 1992.

S. Bellovin, There Be Dragons; in Proceedings of the Third Usenix UNIX Security Symposium, pp. 1-16, 1992. [.pdf] [.ps]

S. Bellovin and M. Merritt, Encrypted Key Exchange: Password-Based Protocols Secure Against Dictionary Attacks, Proceedings of the I.E.E.E. Symposium on Research in Security and Privacy, Oakland, May 1992. [.ps]

S. Bellovin, A Best-Case Network Performance Model; February 1992. [.pdf] [.ps]

C. Bennett, G. Brassard, and N. Mermin, Quantum cryptography with-out Bell's theorem; Physical Review Letters, vol. 68, no. 5, 3 February 1992, pp. 557 - 559. [.ps.gz]

C. Bennett, G. Brassard, C. Crépeau, and M.-H. Skubiszewska, Practical quantum oblivious transfer protocols; In Advances in Cryptology: Proceedings of Crypto '91, volume 576 of Lecture Notes in Computer Science, pages 351-366. Springer-Verlag, 1992. [.ps.gz]

M. Blum and O. Goldreich, Towards a Computational Theory of Statistical Tests; 1992. [.ps]

J. Buchmann, I. Biehl, Meyer, Thiel, and Thiel, Tools for proving zero knowledge; (EuroCrypt 1992) [.ps.gz]

J. Bull, L. Gong, and K. R. Sollins, Towards Security in an Open Systems Federation, Proceedings of the European Symposium on Research in Computer Security, Toulouse, France, November, 1992. Published as Lecture Notes in Computer Science, Vol.648, Springer-Verlag, 1992, pp. 3-20. [.ps.Z]

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

D. Chaum, E. van Heijst, and B. Pfitzmann, Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer (Extended abstract); Crypto '91, LNCS 576, Springer Verlag, Berlin 1992, 470-484. [.ps.gz]

D. Chaum, Achieving Electronic Privacy; Scientific American, August 1992, pp. 96-101

M. Coster, A. Joux, B. LaMacchia, A. Odlyzko, C. Schnorr, and J. Stern, Improved low-density subset sum algorithms, Computational Complexity 2 (1992), pp. 111-128. [.pdf] [.ps]

J. Daemen, R. Govaerts, and J. Vandewalle, A hardware design model for cryptographic algorithms, Computer Security - ESORICS'92, Proceedings 2nd European Symposium on Research in Computer Security, LNCS 648, Y. Deswarte, G. Eizenberg and J.-J. Quisquater, Eds., Springer-Verlag, 1992, pp. 419-434. [.ps.gz]

J. Daemen, R. Govaerts, and J. Vandewalle, A practical approach to the design of high speed self-synchronizing stream ciphers, Singapore ICCS/ISITA '92 Conference Proceedings, P.Y. Kam and O. Hirota, Eds., IEEE, 1992, pp. 279-283. [.ps.gz]

J. Daemen, L. Van Linden, R. Govaerts, and J. Vandewalle, Propagation properties of multiplication modulo 2n-1, Proceedings 13th Symposium on Information Theory in the Benelux, Enschede (NL), June 1-2, 1992, pp. 111-118. [.ps.gz]

D. Davis and R. Swick, Network Security via Private-Key Certificates, USENIX 3rd Security Symposium Proc., (Baltimore; Sept. '92). Also in ACM Operating Systems Review, v.24, #4 (Oct. 1990). [.ps]

A. De Santis and G. Persiano, Zero-Knowledge Proofs of Knowledge Without Interaction, Proceedings of the 33rd Symposium on Foundations of Computer Science 1992 (FOCS '92), 1992, pp. 427-437. [.ps.gz]

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]

Y. Frankel and Y. Desmedt, Parallel reliable threshold multisignature, Tech. Report TR-92-04-02, Dept. of EE & CS, Univ. of Wisconsin-Milwaukee, April 1992. [.ps]

M. Franklin and M. Yung, Secure and efficient off-line digital money, Proc. 20th International Colloquium on Automata, Languages and Programming (ICALP 1993). Earlier version in Columbia University Research Report, 1992. [.ps]

O. Goldreich, A. Herzberg, and A. Segall, A Quantitative Approach to Dynamic Networks; 1992. [.ps]

L. Gong, A Security Risk of Depending on Synchronized Clocks, ACM Operating Systems Review, Vol.26, No.1, January, 1992, pp.49-53. [.ps.gz]

E. Kushilevitz, Privacy and Communication Complexity, SIDMA 5(2), 1992, pp. 273-284. [.ps.Z]

U. Maurer, A universal statistical test for random bit generators; Institute for Theoretical Computer Science, ETH Zürich. 1992. Journal of Cryptology. Vol. 5. Nr. 2. [.txt - abstract] [.pdf] [.ps]

U. Maurer, A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators; Institute for Theoretical Computer Science, ETH Zürich. 1992. Lecture Notes in Computer Science: Advances in Cryptology - EUROCRYPT '92. Vol. 658. Springer-Verlag, Berlin. Pages: 239-255. [.txt - abstract] [.ps]

U. Maurer, Asymptotically-tight bounds on the number of cycles in generalized de Bruijn-Good graphs; Institute for Theoretical Computer Science, ETH Zürich. 1992. Discrete Applied Mathematics. Vol. 37. Pages: 421-436. [.txt - abstract] [.pdf] [.ps]

U. Maurer, Some number-theoretic conjectures and their relation to the generation of cryptographic primes; Institute for Theoretical Computer Science, ETH Zürich. 1992. Cryptography and Coding II. Oxford University Press. Pages: 173-191. [.txt - abstract] [.pdf] [.ps]

U. Maurer, Conditionally-perfect secrecy and a provably-secure randomized cipher; Institute for Theoretical Computer Science, ETH Zürich. 1992. Journal of Cryptology. Vol. 5. Nr. 1. Pages: 53-66. [.txt - abstract] [.pdf] [.ps]

J. McLean, Proving Noninterference and Functional Correctness Using Traces, Journal of Computer Security, vol. 1, no. 1, 1992. [.pdf] [.ps]

A. Ort, R. Aßmann, G. Bleumer, M. Böttger, D. Fox, A. Pfitzmann, B. Pfitzmann, and M. Waidner, Schutz in verteilten Systemen durch Kryptologie - Ein Praktikum im Informatik-Hauptstudium; Datenschutz und Datensicherung DuD 16/11 (1992) 571-579. [.ps.gz]

A. Pfitzmann and B. Pfitzmann, Technical Aspects of Data Protection in Health Care Informatics; Advances in Medical Informatics, J. Noothoven van Goor and J. P. Christensen (Eds.), IOS Press, Amsterdam 1992, 368-386. [.ps.gz]

B. Pfitzmann and M. Waidner, Unconditional Byzantine Agreement for any Number of Faulty Processors (Extended Abstract); STACS '92, LNCS 577, Springer-Verlag, Berlin 1992, 339-350. [.ps.gz]

B. Pfitzmann and M. Waidner, How to Break and Repair a "Provably Secure" Untraceable Payment System; Crypto '91, LNCS 576, Springer Verlag, Berlin 1992, 338-350. [.ps.gz]

B. Pfitzmann and M. Waidner, Unconditionally Untraceable and Fault-tolerant Broadcast and Secret Ballot Election; Hildesheimer Informatik-Berichte (Mai 1992), Institut für Informatik, Universität Hildesheim. [.ps.gz]

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]

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

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

V. Shoup and J. von zur Gathen, Computing Frobenius maps and factoring polynomials; Computational Complexity 2:187-224, 1992; extended abstract in Proc. 24th ACM Symposium on Theory of Computing, pp. 97-105, 1992. [.ps.Z]

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