Crypto Bibliography

A. Back, U. Möller, and A. Stiglic, Traffic Analysis Attacks and Trade-Offs in Anonymity Providing Systems, Proceedings of the 4th Information Hiding Workshop (IHW2001), Springer-Verlag, LNCS v. 2137, pp. 243-254. [.pdf]

D. Fox and M. Müller, Neue Zertifikate für asymmetrische Sicherheitsprotokolle; In: Horster, P. (Hrsg.): Trust Center. Proceedings der Arbeitstagung Trust Center 95, Vieweg-Verlag, Braunschweig, 1995, S. 165-172.

M. Jakobsson and D. M'Raïhi, Mix-based Electronic Payments, Fifth Annual Workshop on Selected Areas in Cryptography, 1998.

Y. Frankel, P. MacKenzie, and M. Yung, Proactive RSA [.ps]

J. Garay and P. MacKenzie, Abuse-free Multi-party Contract Signing, Proc. 13th International Symposium on Distributed Computing (DISC '99), Prasad Jayanti (Ed.), LNCS (1693), Springer-Verlag, pp. 151-165, Bratislava, September 1999. [.ps]

J. Garay, M. Jakobsson, and P. MacKenzie, Abuse-free Optimistic Contract Signing, Proc. Advances in Cryptology - CRYPTO '99, Michael Wiener (Ed.), LNCS (1666), Springer-Verlag, pp. 449-466, August 1999. [.ps]

M. Jakobsson, P. MacKenzie, and J. Stern, Secure and Lightweight Advertising on the Web, Eighth International World Wide Web Conference, 1999.

M. Atici, S. Magliveras, D. Stinson, and W.-D. Wei, Some recursive constructions for perfect hash families; Journal of Combinatorial Designs 4 (1996), 353-363. [.ps]

D. Franklin and D. Malkhi, Auditable metering with lightweight security, Journal of Computer Security. Earlier version in Proc. Financial Cryptography '97, Springer-Verlag. [.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]

T. Wu, M. Malkin, and D. Boneh, Building intrusion tolerant applications, 8th USENIX Security Symposium, 1999.

A. Beimel, T. Malkin, and S. Micali, The All-or-Nothing Nature of Two-Party Secure Computation, CRYPTO '99., vol. 1666 of LNCS, pages 80 - 97, 1999. [.ps]

A. Beimel, Y. Isahi, T. Malkin, and E. Kushilevitz, One-way functions are essential for single-server private information retrieval, Proc. of the 31st Annu. ACM Symp. on the Theory of Computing (STOC), pp. 89-98, 1999. [.ps]

Y. Gertner, Y. Ishai, E. Kushilevitz, and T. Malkin, Protecting Data Privacy in Private Information Retrieval Schemes, STOC 98. [.ps.Z]

S. Kim, M. Mambo, H. Shizuya, and D. Won, On the security of the Okamoto-Tanaka ID-based key exchange scheme against active attacks, Proc. of JW-ISC'2000, Korea-Japan Joint Workshop on Information Security and Cryptology, January 2000. [.zip]

S.J. Kim, I.S. Lee, M. Mambo, and S.J. Park, On the difficulty of key recovery systems, Proc. of ISW'99, Information Security Workshop, Springer-Verlag, Lecture Notes in Computer Science, Kuala Lumpur, Malaysia, November 6-7 1999. [.zip]

M. Abadi, S. Glassman, M. Manasse, P. Gauthier, and P. Sobalvarro, The Millicent Protocol for Inexpensive Electronic Commerce, World Wide Web Journal -- Fourth International World Wide Web Conference Proceedings, O'Reilly & Associates, Inc. (December 1995), 603-618.

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. Anderson, B. Crispo, C. Manifavas, V. Matyas, and F. Petitcolas, The Global Trust Register, Datasem '98, pp 219-241, Brno, Czech Republic, October 1998.

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]

R. Anderson, C. Manifavas, and C. Sutherland, NetCard - A Practical Electronic Cash Scheme, 1996 Cambridge Workshop on Security Protocols. [.ps.gz]

R. Anderson and C. Manifavas, Chameleon - A New Kind of Stream Cipher, Fourth Workshop on Fast Cipher Encryption, Haifa, January 1997. [.ps.gz]

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

E. Kushilevitz and Y. Mansour, Randomness in Private Computations, SIDMA 10(4), 1997, pp. 647-661. Early version: PODC 96. [.ps.Z]

W. Mao, Blind Certification of Public Keys, HP Labs Technical Reports, HPL-96-71, May 16, 1996.

W. Mao, On two Proposals for On-line Bankcard Payments using Open Networks: Problems and Solutions, 1996 IEEE Symposium on Security and Privacy, pp 201-210, IEEE Computer Society Press. May 1996. [.ps]

W. Mao, Lightweight Micro-Cash for the Internet, 1996 Europian Symposium on Research in Computer Security (ESORICS '96), Springer-Verlag, LNCS(1146):15-32. [.ps]

W. Mao On Cryptographic Techniques for On-line Bankcard Payment Transactions Using Open Networks. 1996 Cambridge Workshop on Security Protocols, Springer-Verlag, LNCS(1189):1-17 [.ps]

W. Mao and C. Boyd, Development of authentication protocols: some misconceptions and a new approach, IEEE Computer Security Foundations Workshop VII. pp. 178-186. IEEE Computer Society Press, Los Alamitos, CA. June 1994. [.ps]

W. Mao, A Secure, Cheap, Scalable and Exportable/Importable Method for Internet Electronic Payments, Advanced Payment Systems for Open Networks. Workshop of the US Government Advisory Committee on Internet Technologies. November 1-2, 1995. San Francisco, CA. [.ps]

W. Mao and C. Boyd, On strengthening authentication protocols to foil cryptanalysis, 1994 European Symposium on Research in Computer Security (ESORICS '94), LNCS(875):193-204. Springer-Verlag, 1994. [.ps]

W. Mao and C. Boyd, Design of authentication and key management protocols, In official document of International Organisation for Standardisation (ISO) and International Electrotechnical Commission (IEC) JTC1, SC27, WG2, Document N262: "Papers on authentication and key management protocols based on symmetric techniques." February 1994. [.pdf] [.ps]

W. Mao and C. Boyd, Classification of cryptographic techniques in authentication protocols, Selected Areas in Cryptography. pages 95-106. Kingston, Ontario, Canada. May 1994. [.ps]

W. Mao, Verifiable partial sharing of integer factors, Selected Areas of Cryptography '98, Springer-Verlag, August 1998. [.ps]

W. Mao, Necessity and Realization of universally verifiable secret sharing, 1998 IEEE Symposium on Security and Privacy. Oakland, CA, May 1998. [.ps]

W. Mao, To Decrypt or not to Decrypt? That is the Question, 1994 Cambridge Workshop on Security Protocols. Cambridge. April 1994. [.ps]

W. Mao and C. Boyd, Towards formal analysis of security protocols, IEEE Computer Security Foundations Workshop VI. pp. 147-158. IEEE Computer Society Press, Los Alamitos, CA. 1993. [.ps]

W. Mao and S. Zaba, The HP Protocol for Internet Secure Payment Transactions. 33rd Internet Engineering Task Force, pp 493-496, 1995. [.ps]

W. Mao, C. Lim, Cryptanalysis of subgroups of Z*n, Advances in Cryptology, ASIACRYPT'98, LNCS 1514, Springer Verlag, October 1998, pp. 214-216. [.ps]

W. Mao and C. Boyd, On the use of encryption in cryptographic protocols. In official document of International Organisation for Standardisation (ISO) and International Electrotechnical Commission (IEC) JTC1, SC27, WG2, Document N262: "Papers on authentication and key management protocols based on symmetric techniques." February 1994. [.ps]

C. Boyd and W. Mao, On a limitation of BAN logic. Advances in Cryptology, EUROCRYPT '93, LNCS(765):240-247. Springer-Verlag. Lofthus, Norway. May, 1993. [.ps]

W. Mao, Verifiable Escrowed Signature, Second Australian Conference in Information Security and Privacy. LNCS 1270, pp 240-248, Springer. Sydney, July, 1997. [.ps]

W. Mao, An Augmentation of BAN-Like Logics, 8th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, June 1995, pp. 44-56. [.ps]

W. Mao and C. Boyd, Methodical Use of Cryptographic Transformations in Authentication Protocols, IEE Proceedings, Comput. Digit. Tech., Vol. 142, No. 4, pp. 272-278, July 1995. [.ps]

C. Cachin, C. Crépeau, and J. Marcil., Oblivious transfer with a memory-bounded receiver [.ps], Proc. 39th IEEE Symposium on Foundations of Computer Science (FOCS), 1998. [.ps] [.ps.gz]

M. Abadi, T. Mark, A. Lomas, and R. Needham, Strengthening Passwords; SRC Technical Note 1997-033 (September/December 1997). [.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]

K. Martin, B. Preneel, C. Mitchell, H. Hitz, G. Horn, A. Poliakova, and P. Howard, Secure billing for mobile information services in UMTS, 5th International Conference in Services and Networks, IS&N'98, LNCS 1430, Springer-Verlag, 1998, pp. 535-548. [.ps.gz]

W. Martin and D. Stinson, Association schemes for ordered orthogonal arrays and (T,M,S)-nets; Submitted to Canadian Journal of Mathematics. [.ps]

W. Martin and D. Stinson, A generalized Rao bound for ordered orthogonal arrays and (t,m,s)-nets; Submitted to Canadian Mathematical Bulletin. [.ps]

M. Abdalla, W. Cirne, L. Franklin, A. Sterrett, and K. Marzullo, Chimichanga: A Fault-tolerant Asynchronous Communication Infrastructure for Mobile Agents, March 1998. [.pdf] [.ps.gz]

C. Harpes, G. Kramer, and J. Massey, A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-up Lemma, Eurocrypt '95. [.ps]

U. Maurer and J. Massey, Cascade ciphers: the importance of being first, Journal of Cryptology, vol. 6, no. 1, pp. 55-61, 1993. [.txt - abstract] [.pdf] [.ps]

U. Maurer and J. Massey, Local randomness in pseudo-random sequences; Institute for Theoretical Computer Science, ETH Zürich. 1991. Journal of Cryptology. Vol. 4. Nr. 2. Pages: 135-149. [.txt - abstract] [.pdf] [.ps]

J.-M. Boucqueau, J.-F. Delaigle, J.-F. Dhem, M. Joye, F. Koeune, H. Massias, P. Mestré, and J.-J. Quisquater, Comment jouer à pile ou face sur Internet sans tricher, Technical Report CG-1997/2, UCL Crypto Group, Louvain-la-Neuve, March 1997, presented at Les mercredis des Maths, Louvain-la-Neuve, 24th September 1997. [.ps.gz]

C. Boyd and A. Mathuria, Key Establishment Protocols for Secure Mobile Communications: A Selective Survey, Information Security and Privacy (ACISP98), Lecture Notes in Computing Science, Vol. 1438, Springer-Verlag, 1998, pp. 344-355. [.ps.gz]

D. Bleichenbacher, E. Gabber, P. Gibbons, Y. Matias, and A. Mayer, On Secure and Pseudonymous Client Relationships with Multiple Servers, Proc. 3rd USENIX Workshop on Electronic Commerce, 1998. [.pdf]

D. Bleichenbacher, E. Gabber, M. Jakobsson, Y. Matias, and A. Mayer, Curbing Junk E-mail via Secure Classification, Proc. Financial Cryptography'98, Springer-Verlag LNCS 1465. [.ps]

E. Gabber, P. Gibbons, D. Kristol, Y. Matias, and A. Mayer, Consistent yet Anonymous Web Access with LPWA, Communications of the ACM, February 1999. [.ps] [.ps.gz] [.ps.Z]

E. Gabber, P. Gibbons, Y. Matias, and A. Mayer, How to Make Personalized Web Browsing Simple, Secure, and Anonymous, Proc. Financial Cryptography'97, Springer-Verlag LNCS 1318. [.ps.gz]

Y. Matias, A. Mayer, and A. Silberschatz Lightweight Security Primitives for E-Commerce, Proc. USENIX Symposium On Internet Technologies and Systems (USITS), 1997. [.ps]

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]

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, Duality between two cryptographic primitives; Proceedings of the 8-th International Conference on Applied Algebra, Algebraic Algorithms and Error Correcting Codes (AAECC-8); Lecture Notes in Computer Science, Vol. 508, pp.379-390, Springer-Verlag, 1991. [.ps] [.ps.Z]

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 and T. Matsumoto, Breaking Smart Card Implementations of ElGamal Signature and Its Variants, presented at the Rump Session of Asiacrypt96, 5 November 1996. [.ps] [.ps.Z] [slides - .ppt] [slides - .ppt.Z]

Y. Zheng, T. Matsumoto, and H. Imai, Proving identity in three moves; IEICE Transactions, pp.3602-3606, Vol. E 74, No. 11, November 1991. [.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, 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, Structural properties of one-way hash functions; Advances in Cryptology -- Crypto'90, Lecture Notes in Computer Science, Vol. 537, pp. 285-302, Springer-Verlag, 1991. [.ps] [.ps.Z]

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]

K. Matsuura, Y. Zheng, and H. Imai, Compact and Flexible Resolution of CBT Multicast Key-Distribution; Proceedings of the Second International Conference on Worldwide Computing and Its Applications (WWCA'98), Lecture Notes in Computer Science, Vol. 1368, pp. 190--205, Springer-Verlag, 1998. [.ps] [.ps.Z]

C. Burwick, D. Coppersmith, E. D'Avignon, R. Gennaro, S. Halevi, C. Jutla, S. Matyas Jr., L. O'Connor, M. Peyravian, D. Safford, and N. Zunic, MARS - a candidate cipher for AES, First AES conference, 1998. [.pdf] [.ps]

R. Anderson, B. Crispo, C. Manifavas, V. Matyas, and F. Petitcolas, The Global Trust Register, Datasem '98, pp 219-241, Brno, Czech Republic, October 1998.

R. Anderson, V. Matyas, and F. Petitcolas, Secure Books: Protecting the Secure Distribution of Knowledge, Security Protocols Workshop, 1997.

V. Matyas, Information Privacy in Canada (Legislation in the Face of Changing Technologies, TR-2 46, School of Computer Science, Carleton University, [.ps]

R. Anderson, V. Matyas, and F. Petitcolas, The Eternal Resource Locator: An Alternative Means of Establishing Trust on the World Wide Web, 3rd USENIX workshop on electronic commerce, ISBN 1-880-446-97-9, pp. 141-153. [.pdf]

R. Anderson, V. Matyas, F. Petitcolas, I. Buchan, and R. Hanka, On the Importance of Trusted Distribution and Authentic Channels for the Distribution of Medical Knowledge,

V. Shoup, F. Lehmann, M. Mauerer, and V. Mueller, Counting the number of points on elliptic curves of characteristic greater than three; in Proc. First Algorithmic Number Theory Symposium, pp. 60-70, 1994. [.ps.Z]

C. Cachin and U. Maurer, Unconditional security against memory-bounded adversaries [.ps], Advances in Cryptology: CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pp. 292-306. Springer-Verlag, 1997. [.ps] [.ps.gz]

U. Maurer, Factoring with an Oracle, Institute for Theoretical Computer Science, ETH Zürich. 1996. in Computational Complexity. Birkhäuser, Basel. Pages: 12. [.pdf]

C. Cachin and U. Maurer, Sicherheit im Internet: Illusion oder Realität?; INFORMATIK / INFORMATIQUE, 2(2):18-23, 1995. [.ps] [.ps.gz]

C. Cachin and U. Maurer, Smoothing probability distributions and smooth entropy; Preprint (Abstract in Proc. 1997 IEEE International Symposium on Information Theory, Ulm), 1997. [.ps] [.ps.gz]

U. Maurer, Secret key agreement by public discussion from common information; Institute for Theoretical Computer Science, ETH Zürich. 1993. IEEE Transactions on Information Theory. Vol. 39. Pages: 733-742. [.txt - abstract] [.ps] [.ps.gz]

J. Camenisch, U. Maurer, and M. Stadler, Digital Payment Systems with Passive Anonymity-Revoking Trustees, Journal of Computer Security, vol. 5, no. 1, pp. 69-89, 1997, (Preliminary version in Proc. ESORICS'96). [.txt - abstract] [.pdf] [.ps]

U. Maurer, Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters; Institute for Theoretical Computer Science, ETH Zürich. 1995. Journal of Cryptology. Vol. 8. Nr. 3. Pages: 123-156. [.txt - abstract] [.pdf] [.ps.gz]

C.H. Bennett, G. Brassard, C. Crépeau, and U. Maurer, Generalized Privacy Amplification, IEEE Transaction on Information Theory, v. 41, n. 6, November 1995, pp. 1915-1923. [.ps]

M. Fitzi, M. Hirt, and U. Maurer, General adversaries in unconditional multi-party computation, Advances in Cryptology - Asiacrypt '99, Lecture Notes in Computer Science, 1999. [.ps.gz]

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]

U. Maurer, The Role of Information Theory in Cryptography; Institute for Theoretical Computer Science, ETH Zürich. 1995. Codes and Cyphers, Cryptography and Coding IV, (Proc. of 4th IMA Conference on Cryptography and Coding, Cirencester, England). Pages: 49-71. [.txt - abstract] [.pdf] [.ps]

D. Bleichenbacher and U. Maurer, Directed Acyclic Graphs, One-way Functions and Digital Signature, Advances in Cryptology - CRYPTO '94, LNCS vol. 839, Springer-Verlag, pp. 75-82, 1994. [.txt - abstract] [.pdf] [.ps]

D. Bleichenbaher and U. Maurer, On the efficiency of one-time digital signatures, Advances in Cryptology - ASIACRYPT '96, LNCS vol. 1163. Springer-Verlag, pp. 145-158, 1996. [abstract - .txt] [.pdf] [.ps]

C. Cachin and U. Maurer, Linking information reconciliation and privacy amplification [.ps], Journal of Cryptology, 10(2):97-110, 1997. [.ps] [.ps.gz]

U. Maurer and J. Massey, Cascade ciphers: the importance of being first, Journal of Cryptology, vol. 6, no. 1, pp. 55-61, 1993. [.txt - abstract] [.pdf] [.ps]

R. Cramer, I. Damgård, and U. Maurer, General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme, manuscript, Jan. 1999. Older version: BRICS Report Series RS-97-28, available from http://www.brics.dk, 1997.

U. Maurer and S. Wolf, The intrinsic conditional mutual information and perfect secrecy; Computer Science Department, ETH Zürich. 1996.in Proceedings of ISIT '97 (abstract) [.txt - abstract] [.ps]

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, Information-theoretically secure secret-key agreement by NOT authenticated public discussion; Computer Science Department, ETH Zürich. 1997. in Proceedings of EUROCRYPT '97 [.txt - abstract] [.pdf] [.ps]

U. Maurer and Y. Yacobi, A non-interactive public-key distribution system, Designs, Codes and Cryptography, vol. 9, no. 3, pp. 305-316, 1996. [.txt - abstract] [.pdf] [.ps]

U. Maurer and S. Wolf, Privacy Amplification Secure Against Active Adversaries; Computer Science Department, ETH Zürich. 1997. in Proceedings of CRYPTO '97 [.txt - abstract] [.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, Modelling a public-key infrastructure; Institute for Theoretical Computer Science, ETH Zürich. 1996.Proc. European Symposium on Research in Computer Security (ESORICS' 96). [.txt - abstract] [.pdf] [.ps]

U. Maurer and S. Wolf, Towards Characterizing when Information-Theoretic Secret Key Agreement is Possible; Computer Science Department, ETH Zürich. 1996. in Advances in Cryptology - ASIACRYPT '96 [abstract - .txt] [.ps]

M. Fitzi, M. Hirt, and U. Maurer, Trading Correctness for Privacy in Unconditional Multi-Party Computation, Advances in Cryptology -- Crypto '98, 1998. [abstract - .txt] [.pdf] [.ps]

U. Maurer and S. Wolf, On the Complexity of Breaking the Diffie-Hellman Protocol; Institute for Theoretical Computer Science, ETH Zürich, April 1996. [.txt - abstract] [.ps] [.ps]

M. Hirt and U. Maurer, Complete Characterization of Adversaries Tolerable in Secure Multi-Party Computation, Proceedings of the Sixteenth ACM Symposium on Principles of Distributed Computing (PODC),1997. [.txt - abstract] [.pdf] [.ps]

U. Maurer, Perfect cryptographic security from partially independent channels; Institute for Theoretical Computer Science, ETH Zürich. May 1991. Proceedings of the 23rd ACM Symposium on Theory of Computing (STOC). Pages: 561-572. [.txt - abstract] [.ps]

U. Maurer, Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms; Institute for Theoretical Computer Science, ETH Zürich. 1994. Lecture Notes in Computer Science: Advances in Cryptology - CRYPTO '94. Vol. 839. Springer-Verlag, Berlin. Pages: 271-281. [.abstract] [.pdf] [.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, The Strong Secret Key Rate of Discrete Random Triples; Institute for Theoretical Computer Science, ETH Zürich. 1994. Communication and Cryptography -- Two Sides of One Tapestry. Kluwer Academic Publishers. Pages: 271-285. [.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, Kryptologie: eine neuartige Anwendung der Mathematik, Institute for Theoretical Computer Science, ETH Zürich. 1995. Elemente der Mathematik. Vol. 50. Nr. 3. Birkhäuser, Basel.
Pages: 89-106. Language: German. [.txt - abstract] [.pdf] [.ps]

D. Bleichenbacher and U. Maurer, Optimal Tree-Based One-time Digital Signature Schemes, STACS 96, LNCS vol. 1046, Springer-Verlag, pp. 363-374, 1996. [.txt - abstract] [.pdf] [.ps]

U. Maurer and J. Massey, Local randomness in pseudo-random sequences; Institute for Theoretical Computer Science, ETH Zürich. 1991. Journal of Cryptology. Vol. 4. Nr. 2. Pages: 135-149. [.txt - abstract] [.pdf] [.ps]

J. Camenisch, U. Maurer, and M. Stadler, Digital Payment Systems with Passive Anonymity-Revoking Trustees, Journal of Computer Security, v. 5, n. 1, IOS Press, 1997. [.ps] [.ps.Z] [.ps.gz]

D. Bleichenbacher, E. Gabber, M. Jakobsson, Y. Matias, and A. Mayer, Curbing Junk E-mail via Secure Classification, Proc. Financial Cryptography'98, Springer-Verlag LNCS 1465. [.ps]

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.

E. Gabber, P. Gibbons, Y. Matias, and A. Mayer, How to Make Personalized Web Browsing Simple, Secure, and Anonymous, Proc. Financial Cryptography'97, Springer-Verlag LNCS 1318. [.ps.gz]

Y. Matias, A. Mayer, and A. Silberschatz Lightweight Security Primitives for E-Commerce, Proc. USENIX Symposium On Internet Technologies and Systems (USITS), 1997. [.ps]

D. Bleichenbacher, E. Gabber, P. Gibbons, Y. Matias, and A. Mayer, On Secure and Pseudonymous Client Relationships with Multiple Servers, Proc. 3rd USENIX Workshop on Electronic Commerce, 1998. [.pdf]

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]

A. Mayer and M. Yung, Secure Protocol Transformation via "Expansion": From Two-party to Groups (with M. Yung), Proc. 6th ACM Computer and Communications Security Conference (CCS), 1999.

E. Gabber, P. Gibbons, D. Kristol, Y. Matias, and A. Mayer, Consistent yet Anonymous Web Access with LPWA, Communications of the ACM, February 1999. [.ps] [.ps.gz] [.ps.Z]

V. Anupam and A. Mayer, Security of Web Browser Scripting Languages: Vulnerabilities, Attacks, and Remedies, Proc. 7th USENIX Security Symposium, 1998. [.pdf]

G. Brassard, C. Crépeau, D. Mayers, and L. Salvail, A brief review on the impossibility of quantum bit commitment; Posted as paper 9712023 on quant-ph archive, 11 pages, December 1997.

R. Levein, L. McCarthy and M. Blaze, Transparent Internet E-mail Security (DRAFT). August 9, 1996. Submitted for publication. [.ps]

P. Ammann, S. Jajodia, D. McCollum, and b. Blaustein, Surviving information warfare attacks on databases, Proc. IEEE Symp. on Research in Security and Privacy, Oakland, Calif., May 1997, pages 31-42. [.ps]

A. McDonald, and M. Kuhn, StegFS: A Steganographic File System for Linux, Information Hiding, Third International Workshop, IH'99, Dresden, Germany, September/October, 1999, Proceedings, LNCS 1768, Springer-Verlag, ISBN 3-540-67182-X, pp. 463-477. [.pdf]

J. McLean, A General Theory of Composition for Trace Sets Closed Under Selective Interleaving Functions, Proceedings of 1994 IEEE Symposium on Research in Security and Privacy, IEEE Press, 1994. [.pdf] [.ps]

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

J. Gray and J. McLean, Using Temporal Logic to Specify and Verify Cryptographic Protocols (Progress Report), Proceedings of the 8th IEEE Computer Security Foundations Workshop, IEEE Press, 1995. [.pdf] [.ps]

J. McLean, A Comment on the 'Basic Security Theorem' of Bell and LaPadula, Information Processing Letters, vol. 20, no. 2, Feb. 1985. [.pdf] [.ps]

J. McLean, Proving Noninterference and Functional Correctness Using Traces, Journal of Computer Security, vol. 1, no. 1, 1992. [.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]

C. Meadows, A Formal Framework and Evaluation Method for Network Denial of Service, Proceedings of the IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, June 1999. [.pdf] [.ps]

C. Meadows, Formal Verification of Cryptographic Protocols: A Survey, Advances in Cryptology - Asiacrypt '94, LNSC 917, Springer-Verlag, 1995, pp. 133-150. [.pdf] [.ps]

G. Simmons and C. Meadows, The Role of Trust in Information Integrity Protocols, Journal of Computer Security, Vol. 3, No. 2, 1994. [.pdf] [.ps]

C. Meadows, Analysis of the Internet Key Exchange Protocol Using the NRL Protocol Analyzer, Proceedings of the 1999 IEEE Symposium on Security and Privacy, IEEE Computer Society Press, May 1999. [.pdf] [.ps]

S. Brackin, C. Meadows, and J. Millen, CAPSL Interface for the NRL Protocol Analyzer, Proceedings of ASSET 99, IEEE Computer Society Press, March 1999. [.pdf] [.ps]

P. Syverson and C. Meadows, A Formal Language for Cryptographic Protocol Requirements, Designs, Codes, and Cryptography, vol. 7, no. 1/2, pp. 27-59, 1996. [.pdf] [.ps]

C. Meadows, Applying the Dependability Paradigm to Computer Security, Proceedings of the 1995 New Security Paradigms Workshop, 1995. [.pdf] [.ps]

C. Meadows, Language Generation and Verification in the NRL Protocol Analyzer, Proceedings of the 9th Computer Security Foundations Workshop, IEEE Computer Society Press, 1996. [.pdf] [.ps]

C. Meadows and P. Syverson, A Formal Specification of Requirements for Payment Transactions in the SET Protocol, DRAFT for Preproceedings of Financial Cryptography 98, Anguilla, BWI, Feb. 23-26, 1998. [.pdf] [.pdf]

C. Meadows, Analyzing the Needham-Schroeder Public Key Protocol: A Comparison of Two Approaches, Proceedings of ESORICS, Springer Verlag, 1996. [.pdf] [.ps]

C. Meadows, The NRL Protocol Analyzer: An Overview, Journal of Logic Programming, 1995. [.pdf] [.ps]

L. Knudsen and W. Meier, Improved Differential Attack on RC5, Advances in Cryptology - Proc. CRYPTO'96, LNCS 1109, Springer Verlag, 1996, pp. 216-228. [.ps.Z]

S. Blake-Wilson and A. Menezes, Entity Authentication and Authenticated Key Transport Protocols Employing Asymmetric Techniques, Security Protocols Workshop '97, Springer Verlag, 1997. Revised version. [.ps]

S. Blake-Wilson, D. Johnson, and A. Menezes, Key Agreement Protocols and their Security Analysis, Technical Report CORR 97-17, University of Waterloo. Revised version. An extended abstract of this paper appears in Cryptography and Coding: 6th IMA Conference, Springer Verlag, 1997. [.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]

S. Bellovin and M. Merritt, Limitations of the Kerberos Authentication System; in USENIX Conference Proceedings, pp. 253--267, Winter 1991. [.pdf] [.ps]

S. Bellovin and M. Merritt, An Attack on the Interlock Protocol When Used for Authentication, IEEE Transactions on Information Theory 40:1, pp. 273-275, January 1994. [.pdf] [.ps]

S. Bellovin and M. Merritt, Augmented Encrypted Key Exchange; in Proceedings of the First ACM Conference on Computer and Communications Security, pp. 244-250, November 1993. [.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]

J.-M. Boucqueau, J.-F. Delaigle, J.-F. Dhem, M. Joye, F. Koeune, H. Massias, P. Mestré, and J.-J. Quisquater, Comment jouer à pile ou face sur Internet sans tricher, Technical Report CG-1997/2, UCL Crypto Group, Louvain-la-Neuve, March 1997, presented at Les mercredis des Maths, Louvain-la-Neuve, 24th September 1997. [.ps.gz]

J.-F. Dhem, F. Koeune, P.-A. Leroux, P. Mestré, J.-J. Quisquater, and J.-L. Williams, A practical implementation of the Timing Attack, Proc. of CARDIS 1998, 14-16th September 1998. [.ps.gz]

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

O. Goldreich and B. Meyer, Computational Indistinguishability -- Algorithms vs. Circuits; December 1996. [.ps]

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.

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]

C. Cachin, S. Micali, and M. Stadler, Computationally private information retrieval with polylogarithmic communication, Advances in Cryptology: EUROCRYPT '99, LNCS vol. 1592, Springer-Verlag, 1999, pp. 402-414. [.pdf] [.ps] [.ps.gz]

O. Goldreich and S. Micali, Increasing the Expansion of Pseudorandom Generators; 1984. [.ps]

S. Even, O. Goldreich, and S. Micali, On-Line/Off-Line Digital Signatures; revised 1994. [.ps]

E. Kushilevitz, S. Micali, and R. Ostrovsky, Reducibility and Completeness in Multi-Party Private Computations, FOCS 94. [.ps.Z]

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]

A. De Santis, M. Blum, S. Micali, and G. Persiano, NonInteractive Zero-Knowledge, SIAM Journal on Computing, 20(6):1084-1118, 1991. [.ps.gz]

S. Halevi and S. Micali, Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing, Advances in Cryptography -- CRYPTO '96, Springer-Verlag, pp. 201-215. [.ps.gz]

A. Beimel, T. Malkin, and S. Micali, The All-or-Nothing Nature of Two-Party Secure Computation, CRYPTO '99., vol. 1666 of LNCS, pages 80 - 97, 1999. [.ps]

R. Gennaro and S. Micali, Verifiable Secret Sharing as Secure Computation, EUROCRYPT 1995. [.ps.Z]

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]

S. Halevi and S. Micali, A Stronger Notion of Proofs of Knowledge [.ps.gz]

M. Bellare and D. Micciancio, A New Paradigm for collision-free hashing: Incrementality at reduced cost, Extended abstract in Advances in Cryptology- Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed, Springer-Verlag, 1997.

M. Bellare and D. Micciancio, A New Paradigm for collision-free hashing: Incrementality at reduced cost; Extended abstract in Advances in Cryptology- Eurocrypt 97 Proceedings, Lecture Notes in Computer Science Vol. 1233, W. Fumy ed, Springer-Verlag, 1997.

D. Micciancio, An Algorithm for the Solution of Tree Equations; CAAP'97 [.ps]

M. Bellare, S. Goldwasser, and D. Micciancio, "Pseudo-Random" Number Generation within Cryptographic Algorithms: the DSS Case, Advances in Cryptology -- Crypto 97 Proceedings, Lecture Notes in Computer Science Vol. 1294, B. Kaliski ed, Springer-Verlag, 1997.

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]

D. Micciancio, Analysis of Pure Prolog Programs, GULP-PRODE'95 [.ps]

D. Micciancio, "Pseudo-Random" Number Generation within Cryptographic Algorithms: The DSS Case; Crypto'97 [.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]

D. Micciancio, Oblivious Data Structures: Applications to Cryptography; STOC'97 [.ps]

D. Micciancio, The Validity Problem for Extended Regular Expressions; Master's Thesis, MIT, 1996 [.ps]

H. Petersen, P. Horster, and M. Michels, Blind multisignature schemes and their relevance to electronic voting; Proc. 11th Annual Computer Security Applications Conference, New Orleans, IEEE Press, (1995), S. 149 - 155. [.zip]

H. Petersen, P. Horster, and M. Michels, Meta-ElGamal signature schemes; Proc. 2nd ACM Computer and Communications Security Conference, Fairfax, ACM Press, (1994), S. 96 - 107. [.ps.gz]

H. Petersen, P. Horster, and M. Michels, Meta signature schemes giving message recovery based on the discrete logarithm problem; Proc. 2nd Int. Workshop on IT-Security, Wien, Oldenbourg Verlag, (1994), S. 82 - 92. [.ps.gz]

H. Petersen and M. Michels, GOST 34.10 - A brief overview about Russian's DSS; Computers and Security, Dezember, (1996). [.zip]

H. Petersen, P. Horster, and M. Michels, Meta Message recovery and Meta Blind signature schemes based on the discrete logarithm problem and their applications; Proc. Asiacrypt'94, Lecture Notes in Computer Science 917, Springer Verlag, (1994), S. 224 - 237. [.ps.gz]

J. Camenisch and M. Michels, A Group Signature Scheme Based on an RSA-Variant [.pdf], BRICS Technical Report, RS-98-27. A preliminary version of this paper appeared in Advances in Cryptology - ASIACRYPT '98. [.pdf] [.ps.gz]

H. Petersen and M. Michels, Cryptanalysis and improvement of signcryption schemes; IEE Computers and Digital Communications, Vol. 145, No. 2, (1998), Seite 149 - 151. [.ps.zip]

H. Petersen, P. Horster, and M. Michels, Breaking and repairing a convertible undeniable signature scheme; Proc. 3rd ACM Comference on Computer and Communications Security, New Delhi, ACM Press, (1996), S. 148 - 152. [.zip]

J. Camenisch and M. Michels, Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes [.ps], EUROCRYPT '99, LNCS v. 1592, pages 106-121, Springer Verlag, 1999. [.ps] [.ps.gz]

H. Petersen, P. Horster, and M. Michels, Taxonomie digitaler Signaturkonzepte; Proc. Digitale Signaturen, Darmstadt, Vieweg Verlag, (1996), S. 63 - 79. [.zip]

H. Petersen, P. Horster, and M. Michels, How to convert any digital signature scheme into a group signature scheme; Proc. Security Protocols Workshop, Paris, April, (1997), LNCS 1361, Springer Verlag, S. 177 - 190 [.ps.gz]

J.-P. Boly, A. Bosselaers, R. Cramer, R. Michelsen, S. Mjolsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmakers, M. Schunter, L. Vallee, and M. Waidner, The ESPRIT Project CAFE: High Security Digital Payment Systems; In ESORICS 94 (Third European Symposium on Research in Computer Security), volume 875 of Lecture Notes in Computer Science, pages 217-230, Berlin, 1994. Springer-Verlag. [.ps.gz]

J.P. Boly, A. Bosselaers, R. Cramer, R. Michelsen, S. Mjølsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmakers, M. Schunter, L. Vallée, and M. Waidner, The ESPRIT project CAFE - High security digital payment systems, Proceedings ESORICS'94, LNCS 875, D. Gollmann, Ed., Springer-Verlag, 1994, pp. 217-230. [.pdf]

M. Mihaljevic, Y. Zheng, and H. Imai, A Fast Cryptographic Hash Function Based on Linear Cellular Automata over GF(q); Proceedings of the IFIP 14th International Information Security Conference (IFIP/SEC'98), Chapman & Hall, September 1998, Vienna, Austria. [.ps] [.ps.Z]

M. Mihaljevic, Y. Zheng, and H. Imai, A Cellular Automaton Based Fast One-Way Hash Function Suitable for Hardware Implementation; Public Key Cryptography --- Proceedings of PKC'98, Lecture Notes in Computer Science, Vol. 1431, pp. xxx-xxx, Springer-Verlag, 1998. [.ps] [.ps.Z]

C. Ellison, C. Hall, R. Milbert, and B. Schneier, Protecting Secret Keys with Personal Entropy, Future Generation Computer Systems.

D. Wagner, L. Simpson, E. Dawson, J. Kelsey, W. Millan and B. Schneier, Cryptanalysis of ORYX, Fifth Annual Workshop on Selected Areas in Cryptography, Springer Verlag, August 1998, pp. 296-305.

S. Brackin, C. Meadows, and J. Millen, CAPSL Interface for the NRL Protocol Analyzer, Proceedings of ASSET 99, IEEE Computer Society Press, March 1999. [.pdf] [.ps]

M. Bellare and S. Miner, A forward-secure digital signature scheme, Advances in Cryptology - Crypto 99 Proceedings, Lecture Notes in Computer Science Vol. 1666, Springer-Verlag, 1999.

F. Mirza and S. Murphy, An Observation on the Key Schedule of Twofish, Second AES Candidate Conference (AES2), 1999. [.pdf]

K. Martin, B. Preneel, C. Mitchell, H. Hitz, G. Horn, A. Poliakova, and P. Howard, Secure billing for mobile information services in UMTS, 5th International Conference in Services and Networks, IS&N'98, LNCS 1430, Springer-Verlag, 1998, pp. 535-548. [.ps.gz]

J.P. Boly, A. Bosselaers, R. Cramer, R. Michelsen, S. Mjølsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmakers, M. Schunter, L. Vallée, and M. Waidner, The ESPRIT project CAFE - High security digital payment systems, Proceedings ESORICS'94, LNCS 875, D. Gollmann, Ed., Springer-Verlag, 1994, pp. 217-230. [.pdf]

J.-P. Boly, A. Bosselaers, R. Cramer, S. Mjølsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmaker, L. Vallée, and M. Waidner, Digital Payment Systems in the ESPRIT Project CAFE; Securicom 94, Paris 1.-3.6.1994, 35-45. [.ps.gz]

J.-P. Boly, A. Bosselaers, R. Cramer, R. Michelsen, S. Mjolsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmakers, M. Schunter, L. Vallee, and M. Waidner, The ESPRIT Project CAFE: High Security Digital Payment Systems; In ESORICS 94 (Third European Symposium on Research in Computer Security), volume 875 of Lecture Notes in Computer Science, pages 217-230, Berlin, 1994. Springer-Verlag. [.ps.gz]

N. Modadugu, D. Boneh, and M. Kim, Generating RSA keys on the PalmPilot with the help of an untrusted server.

N. Asokan, D. Samfat, and R. Molva, Untraceability in Mobile Networks, Proceedings of the ACM International Conference on Mobile Computing and Networking, Berkeley, Nov. 1995. [.ps.gz]
An improved version is also available. [.ps.gz]

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

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]

E. Biham and T. Mor, On the Security of Quantum Cryptography Against Collective Attacks, Physical Review Letters, Vol. 78, No. 11, pp. 2256-2259, March 1997 [.ps.gz]

E. Biham, B. Huttner, and T. Mor, Quantum Cryptographic Network based on Quantum Memories, Physical Review A, Vol. 54, No. 4, pp. 2651-2658, October 1996 [.ps.gz]

R. Lercier and F. Morain, Counting the number of points on elliptic curves over GF(p^n) using Couveignes's algorithm, Rapport de Recherche LIX/RR/95/09, Laboratoire d'Informatique de l'École polytechnique (LIX), 1995. [.ps.gz]

R. Lercier and F. Morain, Algorithms for computing isogenies between elliptic curves, Computational Perspectives On Number Theory, 1997. [.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]

H. Lipmaa and S. Moriai, Efficient Algorithms for Computing Differential Properties of Addition, Fast Software Encryption 2001 workshop, Yokohama, Japan, 2-4 April 2001.

J. Garay and Y. Moses, Fully Polynomial Byzantine Agreement for n>3t Processors in t+1 Rounds, SIAM J. of Computing, vol. 27, n. 2, 1998. [.ps]

Y. Mu and Y. Zheng, An Alternative Model of Quantum Key Agreement via Beam-Splitter Based Photon Coupling; Information Security and Privacy --- ACISP'96, Lecture Notes in Computer Science, Vol. 1172, pp. 320-331, Springer-Verlag, 1996. [.ps] [.ps.Z]

Y. Mu, J. Seberry, and Y. Zheng, Shared cryptographic bits via quantized quadrature phase amplitudes of light; Optics Communications, Vol. 123, pp. 344-352, 1996. [.ps] [.ps.Z]

H. Luiijf, A. Dey, J. Watson, C. Muckenhirn , and M. Garnsey, Fortezza-enabled Multi-level Sensitive Simulations, The 1998 Spring Simulation Interoperability Workshop, Position Papers, Volume I, March 9-13, 1998, pp. 119-132. [.doc]

B. Schneier and Mudge, Cryptanalysis of Microsoft's PPTP Authentication Extensions (MS-CHAPv2), CQRE, Dusseldorf, Oct 1999.

B. Schneier and Mudge, Cryptanalysis of Microsoft's Point-to-Point Tunneling Protocol (PPTP), Proceedings of the 5th ACM Conference on Communcations and Computer Security, ACM Press, November 1998, pp. 132-141.

L. Gong, M. Mueller, H. Prafullchandra, and R. Schemers, Going Beyond the Sandbox: An Overview of the New Security Architecture in the Java Development Kit 1.2, Proceedings of the USENIX Symposium on Internet Technologies and Systems, Monterey, California, December 1997, pp. 103-112. [.ps.gz]

V. Shoup, F. Lehmann, M. Mauerer, and V. Mueller, Counting the number of points on elliptic curves of characteristic greater than three; in Proc. First Algorithmic Number Theory Symposium, pp. 60-70, 1994. [.ps.Z]

J.-P. Boly, A. Bosselaers, R. Cramer, S. Mjølsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmaker, L. Vallée, and M. Waidner, Digital Payment Systems in the ESPRIT Project CAFE; Securicom 94, Paris 1.-3.6.1994, 35-45. [.ps.gz]

J.P. Boly, A. Bosselaers, R. Cramer, R. Michelsen, S. Mjølsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmakers, M. Schunter, L. Vallée, and M. Waidner, The ESPRIT project CAFE - High security digital payment systems, Proceedings ESORICS'94, LNCS 875, D. Gollmann, Ed., Springer-Verlag, 1994, pp. 217-230. [.pdf]

J.-P. Boly, A. Bosselaers, R. Cramer, R. Michelsen, S. Mjolsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmakers, M. Schunter, L. Vallee, and M. Waidner, The ESPRIT Project CAFE: High Security Digital Payment Systems; In ESORICS 94 (Third European Symposium on Research in Computer Security), volume 875 of Lecture Notes in Computer Science, pages 217-230, Berlin, 1994. Springer-Verlag. [.ps.gz]

F. Mirza and S. Murphy, An Observation on the Key Schedule of Twofish, Second AES Candidate Conference (AES2), 1999. [.pdf]

H. Brandt, J. Myers, and S. Lomonaco, Jr., Aspects of entangled translucent eavesdropping in quantum cryptography, Phys. Rev. A, Vol. 56, No. 6, December 1997, pp. 4456-4465.

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