Crypto Bibliography

G. Brassard, C. Crépeau, S. Laplante, and C. Léger, Computationally convincing proofs of knowledge; In Proceedings of STACS '91, volume 480 of Lecture Notes in Computer Science, pages 251-262. Springer-Verlag, 1991. [.ps.gz]

K. Lüders-Jensen and T. Jakobsen, Bounds on Minimal Codewords in Linear Codes, 1994. [.ps] [.ps.gz]

M. Blaze, J. Feigenbaum, and J. Lacy, Managing Trust in Medical Information Systems, AT&T Technical Report 96.14. [.ps]

M. Blaze, J. Feigenbaum, and J. Lacy, Decentralized Trust Management. IEEE Conference on Security and Privacy, Oakland, CA, May 1996. [.ps]

L. Knudsen and X. Lai, Attacks on Double Block Length Hash Functions, Fast Software Encryption, The Cambridge Security Workshop, Cambridge, U.K., December 1993. Springer Verlag, Lecture Note Series 809, pp. 157-165, Berlin Heidelberg 1994. [.ps.Z]

L. Knudsen and X. Lai, New attacks on all Double Block Length Hash Functions of Hash Rate 1, including the Parallel DM, Advances in Cryptology -- EUROCRYPT'94, LNCS 950, Springer Verlag, 1995, pp. 410-418. [.ps.Z]

J. Zhou and K.Y. Lam, Undeniable Billing in Mobile Communication, Proceedings of 4th ACM/IEEE International Conference on Mobile Computing and Networking, pages 284--290, Dallas, Texas, October 1998, ACM Press. [.ps]

B. LaMacchia, Policy in Public Key Infrastructures, or How Values End Up in the Code, DIMACS Workshop on Design for Values: Ethical, Social and Political Dimensions of Information Technology (position paper for invited talk), Princeton, NJ, March 1998.

B. Fox and B. LaMacchia, Online Certificate Status Checking in Financial Transactions: The Case for Re-issuance, Advances in Cryptology: Proceedings of Financial Cryptography '99, M. Franklin, ed., Lecture Notes in Computer Science 1648, Springer-Verlag, NY (1999).

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]

B. LaMacchia and A. Odlyzko, Solving large sparse linear systems over finite fields, Advances in Cryptology - CRYPTO '90, A. J. Menezes and S. A. Vanstone (eds.), Springer Verlag, Lecture Notes in Computer Science #537 (1991), pp. 109-133. [.pdf] [.ps]

Y.-h. Chu, J. Feigenbaum, B. LaMacchia, P. Resnick, and M. Strauss, REFEREE: Trust Management for Web Applications, World Wide Web Journal, 2 (1997), pp. 127-139. Reprinted from Proceedings of the 6th International World Wide Web Conference, World Wide Web Consortium, Cambridge, 1997, pp. 227-238. [.ps]

B. LaMacchia and A. Odlyzko, Computation of discrete logarithms in prime fields, Designs, Codes, and Cryptography 1 (1991), pp. 46-62. Extended abstract in Advances in Cryptology - CRYPTO '90, A. J. Menezes, and S. A. Vanstone (eds.), Springer Verlag, Lecture Notes in Computer Science #537, 1991, pp. 616-618. [.pdf] [.ps]

B. Fox and B. LaMacchia, Cooperative Security: A Model for the New Enterprise, Proceedings of the Seventh IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WET ICE '98), Stanford, CA, June 1998, 314-319.

B. Fox, B. LaMacchia, Certificate Revocation: Mechanics and Meaning, Advances in Cryptology: Proceedings of Financial Cryptography '98, R. Hirschfeld, ed., Lecture Notes in Computer Science 1465, Springer-Verlag, NY (1998).

M. Coster, B. LaMacchia, A. Odlyzko, and C. Schnorr, An improved low-density subset sum algorithm, Advances in Cryptology - EUROCRYPT '91, D. W. Davies (ed.), Springer Verlag, Lecture Notes in Computer Science #547 (1991), pp. 54-67. [.pdf] [.ps]

M. Abadi, M. Burrows, B. Lampson, and G. Plotkin, A Calculus for Access Control in Distributed Systems, ACM Transactions on Programming Languages and Systems 15, 4 (September 1993), 706-734. (Also appeared as SRC Research Report 70.) [.ps]

M. Abadi, E. Wobber, M. Burrows, and B. Lampson, Authentication in the Taos Operating System, ACM Transactions on Computer Systems 12, 1 (February 1994), 3-32. (Also appeared as SRC Research Report 117.) [.ps]

R. Rivest and B. Lampson, SDSI---A Simple Distributed Security Infrastructure; (See also the SDSI Page); [Version 1.0] (PowerPoint 4.0 slides for USENIX 96 presentation); (PowerPoint 4.0 slides for RSA Laboratories Colloquia 96 presentation); (PowerPoint 7.0 slides for CRYPTO 96 presentation);

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]

M. Abadi, M. Burrows, C. Kaufman, and B. Lampson, Authentication and Delegation with Smart-Cards, Science of Computer Programming 21, 2 (October 1993), 93-113. [.ps]

G. Brassard, C. Crépeau, R. Jozsa, and D. Langlois, A quantum bit commitment scheme provably unbreakable by both parties; Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, November 1993, pp. 362 - 371. [.ps.gz]

J. Feigenbaum, L. Fortnow, S. Laplante, and A. Naik, On Coherence, Random-Self-Reducibility, and Self-Correction, Computational Complexity. Extended abstract appears in Proceedings of the 1996 IEEE Conference on Computational Complexity. (The first ten in this series of conferences were called "Structure in Complexity Theory.")

G. Brassard, C. Crépeau, S. Laplante, and C. Léger, Computationally convincing proofs of knowledge; In Proceedings of STACS '91, volume 480 of Lecture Notes in Computer Science, pages 251-262. Springer-Verlag, 1991. [.ps.gz]

A. Buldas and P. Laud, New Linking Schemes for Digital Time-Stamping, To be published in Proceedings for the 1998 International Conference on Information Security and Cryptology(ICISC'98), by Korea Institute of Information Security and Cryptology.

A. Buldas, P. Laud, H. Lipmaa, and J. Villemson, Time-stamping with binary linking schemes, Advances on Cryptology -- CRYPTO '98, LNCS v. 1462, Springer-Verlag (August 1998), 486-501.

A. Buldas, P. Laud, and H. Lipmaa, Accountable Certificate Management using Undeniable Attestations, 7th ACM Conference on Computer and Communications Security, Sushil Jajodia and Pierangela Samarati, editors, pp. 9-18, Athens, Greece, 1-4 November 2000. ACM Press. ACM ISBN 1-58113-203-4.

R. Deng, L. Gong, A. Lazar, and W. Wang, Authenticated Key Distribution and Secure Broadcast Using No Conventional Encryption: A Unified Approach Based on Block Codes, Proceedings of IEEE Globecom'95, Singapore, November 1995. [.ps.Z]

R. Deng, L. Gong, A. Lazar, and W. Wang, Practical Protocols for Certified Electronic Mail, Journal of Network and Systems Management, 4(3):279--297, 1996. [.ps.gz]

R. Deng, L. Gong, and A. Lazar, Secure Data Transfer in Asynchronous Transfer Mode Networks, Proceedings of IEEE Globecom'95, Singapore, November 1995. [.ps.Z]

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]

J. Lee, H. Heys, and S. Tavares, Resistance of a CAST-like Encryption Algorithm to Linear and Differential Cryptanalysis, Designs, Codes, and Cryptography, Sep. 1996. [.ps]

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]

M. Joye, S. Kim, and N.-Y. Lee, Cryptanalysis of two group signature schemes, Masahiro Mambo, Yuliang Zheng, Proceedings of ISW'99, Information Security Workshop, Springer-Verlag, LNCS 1729, Kuala Lumpur, Malaysia, November 6-7 1999, pp. 271-275. [.zip]

J. Feigenbaum and P. Lee, Trust Management and Proof-Carrying Code in Secure Mobile-Code Applications: Position Paper, in Proceedings of the DARPA Workshop on "Foundations for Secure Mobile Code," pp. 48-55. [.ps]

C. Lim and P. Lee, Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks, Crypto '93, pp. 420-434. [.ps]

T. Gilmont, J.-D. Legat, and J.-J. Quisquater, An Architecture of Security Management Unit for Safe Hosting of Multiple Agents, International Workshop on Intelligent Communications and Multimedia Terminals (COST#254), Ljubljana, pp. 79-82, Nov. 1998. [.pdf]

T. Gilmont, J.-D. Legat, and J.-J. Quisquater, Enhancing the Security in the Memory Management Unit, Proceedings of the 25th EuroMicro Conference, Milan, Vol. I, pp. 449-456, Sept. 1999. [.pdf]

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. 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.

M. Blaze, J. Feigenbaum, and F. Leighton, Master-Key Cryptosytems. Abstract presented at Crypto '95 (rump session), Santa Barbara, CA, August 1995. [.ps]

M. Joye, A. Lenstra, and J.-J. Quisquater, Chinese remaindering cryptosystems in the presence of faults. Journal of Cryptology. [.pdf] [.ps.gz]

D. Atkins, M. Graff, A. Lenstra, and P. Leyland, The Magic Words are Squeamish Ossifrage (extended abstract), Asiacrypt 1994. [.ps]

R. Lercier, Computing isogenies in GF(2^n), in H. Cohen, editor, ANTS-II, volume 1122 of Lecture Notes in Comput. Sci., pages 197--212. Springer-Verlag, 1996. [.ps.gz]

R. Lercier, Factoriser des entiers par la méthode des courbes elliptiques [french], Mémoire de DEA Informatique, Mathématiques et Applications, filière algorithmique, complexité et cryptographie, École Polytechnique, 1993 [.ps.gz]

R. Lercier, Finding Good Random Elliptic Curves for Cryptosystems Defined over GF(2^n), Advances in Cryptology - EUROCRYPT'97, Springer-Verlag. [.ps.gz]

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

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]

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

J. Hastad, R. Impagliazzo, L. Levin, and M. Luby, A Pseudorandom generator from any one-way function, SIAM J. on Computing. [.ps]

O. Goldreich, R. Impagliazzo, L. Levin, R. Venkatesan, and D. Zuckerman, Security Preserving Amplification of Hardness; August 1990. [.ps]

O. Goldreich, L. Levin, and N. Nisan, On Constructing 1-1 One-Way Functions; June 1995. [.ps]

J. Hastad, R. Impagliazzo, L. Levin, and M. Luby, Construction of a pseudo-random generator from any one-way function, SIAM Journal on Computing. [.ps]

D. Atkins, M. Graff, A. Lenstra, and P. Leyland, The Magic Words are Squeamish Ossifrage (extended abstract), Asiacrypt 1994. [.ps]

J. Feigenbaum, M. Liberman, and R. Wright, Cryptographic Protection of Databases and Software, in ``Distributed Computing and Cryptography,'' DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 2, American Mathematical Society, Providence, 1991, pp. 161-172. [.ps]

C. Lim and P. Lee, Another Method for Attaining Security Against Adaptively Chosen Ciphertext Attacks, Crypto '93, pp. 420-434. [.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]

L. Gong, P. Lincoln, and J. Rushby, Byzantine Agreement with Authentication: Observations and Applications in Tolerating Hybrid Faults, Proceedings of the 5th IFIP Working Conference on Dependable Computing for Critical Applications, Urbana-Champaign, Illinois, September 1995.

O. Goldreich, S. Goldwasser, and N. Linial, Fault-tolerant Computation in the Full Information Model; revised October 1995. [.ps]

A. Buldas, H. Lipmaa, and B. Schoenmakers, Optimally Efficient Accountable Time-Stamping, In Yuliang Zheng and Hideki Imai, editors, Public Key Cryptography '2000, volume 1751 of Lecture Notes in Computer Science, pages 293-305, Melbourne, Australia, 18--20 January 2000. Springer Verlag.

A. Buldas and H. Lipmaa, Digital Signatures, Timestamps and the corresponding Infrastructure, Küberneetika AS, Technical Report 1998-21, Jan 1998. [.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.

H. Lipmaa, P. Rogaway, and D. Wagner, Comments to NIST Concerning AES-modes of Operations: CTR-mode Encryption, Symmetric Key Block Cipher Modes of Operation Workshop, Baltimore, Maryland, US, 20 October 2000. Electronic proceedings available from http://www.nist.gov/modes.

H. Lipmaa, Secure and Efficient Time-Stamping Systems, PhD thesis, University of Tartu, 1999, 56 pp.

A. Buldas, P. Laud, and H. Lipmaa, Accountable Certificate Management using Undeniable Attestations, 7th ACM Conference on Computer and Communications Security, Sushil Jajodia and Pierangela Samarati, editors, pp. 9-18, Athens, Greece, 1-4 November 2000. ACM Press. ACM ISBN 1-58113-203-4.

K. Aoki and H. Lipmaa, Fast Implementations of AES Candidates, AES3 conference, New York City, USA, 13--14 April 2000.

H. Lipmaa, IDEA: A Cipher for Multimedia Architectures?, Stafford Tavares and Henk Meijer, eds., Selected Areas in Cryptography '98, volume 1556 of Lecture Notes in Computer Science, pages 248--263, Kingston, Canada, 17-18 August 1998. Springer-Verlag.

A. Buldas, P. Laud, H. Lipmaa, and J. Villemson, Time-stamping with binary linking schemes, Advances on Cryptology -- CRYPTO '98, LNCS v. 1462, Springer-Verlag (August 1998), 486-501.

D. Boneh, R. Lipton, and R. DeMillo, On the Importance of Checking Cryptographic Protocols for Faults, Proceedings of Eurocrypt '97, Lecture Notes in Computer Science, Vol. 1233, Springer-Verlag, 1997, pp. 37-51.

A. Blum, M. Furst, M. Kearns, and R. Lipton, Cryptographic Primitives Based on Hard Learning Problems, Advances in Cryptology -- CRYPTO 93, Lecture Notes in Computer Science #773, pages 278-291, Springer-Verlag, 1994. [.ps.Z]

D. Boneh and R. Lipton, Algorithms for Black-Box fields and their application to cryptography, Proceedings Crypto '96, Lecture Notes in Computer Science, Vol. 1109, Springer-Verlag, 1996, pp. 283-297.

D. Boneh and R. Lipton, A revocable backup system, Proceedings 6th USENIX Security Conference, 1996, pp. 91-96.

D. Boneh and R. Lipton, Quantum Cryptoanalysis of Hidden Linear Forms, Proceedings of Crypto '95, Lecture Notes in Computer Science, Vol. 963, Springer-Verlag, 1995, pp. 424-437.

M. Abadi, T. Mark, A. Lomas, and R. Needham, Strengthening Passwords; SRC Technical Note 1997-033 (September/December 1997). [.ps]

B. Crispo, M. Lomas, A Certification Scheme for Electronic Commerce, Proceedings of the Security Protocols International Workshop, April 10-12, 1996, Cambridge, UK, Springer-Verlag LNCS series vol. 1189 pp. 19-32.

F. Bergadano, B. Crispo, and M. Lomas, Strong Authentication and Privacy with Standard Browsers, submitted for publication.

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]

L. Gong, T. Lomas, R. Needham, and J. Saltzer, Protecting Poorly Chosen Secrets from Guessing Attacks, IEEE Journal on Selected Areas in Communications, Vol.11, No.5, June, 1993, pp.648-656. [.ps.gz]

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.

C. Dwork, J. Lotspiech, and M. Naor, Digital Signets: Self-Enforcing Protection of Digital Information; Proc. 28th Ann. ACM Symp. on Theory of Computing, 1997, pp.

P. Louridas, Some Guidelines for Non-repudiation Protocols, Computer Communication Review, Volume 30, No. 4, October 2000.

J. Hastad, R. Impagliazzo, L. Levin, and M. Luby, Construction of a pseudo-random generator from any one-way function, SIAM Journal on Computing. [.ps]

A. Juels, M. Luby, and R. Ostrovsky, Security of Blind Digital Signatures, Crypto '97. [.ps]

M. Luby, Pseudorandomness and Cryptographic Applications, Princeton Computer Science Notes, David R. Hanson and Robert E. Tarjan, Editors, Princeton University Press, January 1996.

J. Hastad, R. Impagliazzo, L. Levin, and M. Luby, A Pseudorandom generator from any one-way function, SIAM J. on Computing. [.ps]

M. Luby and J. Staddon, Combinatorial Bounds for Broadcast Encryption, Eurocrypt, June 1-4, 1998. [.ps]

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]

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

S. Lucks, How Traveling Salespersons Prove Their Identity [.ps.gz]

S. Lucks, BEAST: A fast block cipher for arbitrary blocksizes [.ps.gz]

N. Ferguson, D. Whiting, B. Schneier, J. Kelsey, S. Lucks, and T. Kohno, Helix: Fast Encryption and Authentication in a Single Cryptographic Primitive, Proceedings of Fast Software Encryption 2003, to appear.

S. Lucks, Open Key Exchange: How to Defeat Dictionary Attacks Without Encrypting Public Keys [.ps.gz]

S. Lucks, Faster Luby-Rackoff Ciphers [.ps.gz]

S. Lucks, Attacking Triple Encryption. [.ps.gz]

S. Lucks, How to Exploit the Intractability of Exact TSP for Cryptography [.ps.gz]

S. Lucks, On the Security of Remotely Keyed Encryption [.ps.gz]

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]

J. Feigenbaum, L. Fortnow, C. Lund, and D. Spielman, The Power of Adaptiveness and Additional Queries in Random-Self-Reductions, Computational Complexity, 4 (1994), pp. 158-174. Extended Abstract in Proceedings of the 1992 IEEE Conference on Structure in Complexity Theory.

A. Condon, J. Feigenbaum, C. Lund, and P. Shor, Probabilistically Checkable Debate Systems and Nonapproximability Results for PSPACE-Hard Functions, Chicago Journal of Theoretical Computer Science, volume 1995, number 4.

A. Condon, J. Feigenbaum, C. Lund, and P. Shor, Random Debaters and the Hardness of Approximating Stochastic Functions; SIAM Journal on Computing, 26 (1997), pp. 369-400. Extended abstract appears in Proceedings of the 1994 IEEE Conference on Structure in Complexity Theory. [.ps]

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