Crypto Bibliography

Citations by First Author - M

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]

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

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 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, 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, Methodical Use of Cryptographic Transformations in Authentication Protocols, IEE Proceedings, Comput. Digit. Tech., Vol. 142, No. 4, pp. 272-278, July 1995. [.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 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, 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]

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, To Decrypt or not to Decrypt? That is the Question, 1994 Cambridge Workshop on Security Protocols. Cambridge. April 1994. [.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, Necessity and Realization of universally verifiable secret sharing, 1998 IEEE Symposium on Security and Privacy. Oakland, CA, May 1998. [.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, 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, Verifiable partial sharing of integer factors, Selected Areas of Cryptography '98, Springer-Verlag, August 1998. [.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, Blind Certification of Public Keys, HP Labs Technical Reports, HPL-96-71, May 16, 1996.

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, 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, C. Lim, Cryptanalysis of subgroups of Z*n, Advances in Cryptology, ASIACRYPT'98, LNCS 1514, Springer Verlag, October 1998, pp. 214-216. [.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]

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

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]

V. Matyas, Information Privacy in Canada (Legislation in the Face of Changing Technologies, TR-2 46, School of Computer Science, Carleton University, [.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]

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 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, 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, 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 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, 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]

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, 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]

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]

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]

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]

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]

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, 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]

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, 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, 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, Factoring with an Oracle, Institute for Theoretical Computer Science, ETH Zürich. 1996. in Computational Complexity. Birkhäuser, Basel. Pages: 12. [.pdf]

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]

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.

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, 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]

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

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, A Comment on the 'Basic Security Theorem' of Bell and LaPadula, Information Processing Letters, vol. 20, no. 2, Feb. 1985. [.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]

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, Analyzing the Needham-Schroeder Public Key Protocol: A Comparison of Two Approaches, Proceedings of ESORICS, Springer Verlag, 1996. [.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]

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, Applying the Dependability Paradigm to Computer Security, Proceedings of the 1995 New Security Paradigms Workshop, 1995. [.pdf] [.ps]

C. Meadows, The NRL Protocol Analyzer: An Overview, Journal of Logic Programming, 1995. [.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]

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

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

D. Micciancio, Oblivious Data Structures: Applications to Cryptography; STOC'97 [.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]

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

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]

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]

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

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

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

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]

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]

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]

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