Crypto Bibliography

Citations by Year - 1996

M. Abadi and R. Needham, Prudent Engineering Practice for Cryptographic Protocols, IEEE Transactions on Software Engineering 22, 1 (January 1996), 6-15. [.ps]

M. Abadi, L. van Doorn, M. Burrows, and E. Wobber, Secure Network Objects, Proceedings of the 1996 IEEE Symposium on Security and Privacy (May 1996), 211-221. [.ps]

I. Agi and L. Gong, An Empirical Study of Secure MPEG Video Transmissions, Proceedings of the Internet Society Symposium on Network and Distributed System Security, pp.137--144, San Diego, California, February, 1996.

P. Ammann, S. Jajodia, and I. Ray, P. Ammann, S. Jajodia, and I. Ray, ``Ensuring atomicity of multilevel transactions, Proc. IEEE Symp. on Research in Security and Privacy, Oakland, Calif., May 1996, pp. 74-84. [.ps]

R. Anderson and E. Biham, Tiger: A Fast New Hash Function, Fast Software Encryption 3, 1996, LNCS 1039 [.ps.gz]

R. Anderson and M. Kuhn, Tamper Resistance - a Cautionary Note, The Second USENIX Workshop on Electronic Commerce Proceedings, Oakland, California, November 18-21, 1996, pp. 1-11, ISBN 1-880446-83-9. [.pdf]

R. Anderson and S. Bezuidenhoudt, On the Reliability of Electronic Payment Systems, IEEE Transactions on Software Engineering v. 22 no. 5 (May 96) pp 294-301. [.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, Stretching the Limits of Steganography, Info Hiding 96, pp. 39-48. [.ps.gz]

R. Anderson, The Eternity Service, Pragocrypt '96.

R. Anderson, S. Vaudenay, B. Preneel, and K. Nyberg, The Newton Channel, Info Hiding 96, pp. 39-48. [.ps.Z] [.ps.gz]

N. Asokan, G. Tsudik, and M. Waidner, Server-Supported Signatures, Journal of Computer Security, 5(1), pp 91-108, 1997. [.ps.gz]

G. Ateniese, C. Blundo, A. De Santis, and D. Stinson, Visual cryptography for general access structures; Information and Computation 129 (1996), 86-106. [.ps]

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]

M. Atici and D. Stinson, Universal hashing and multiple authentication; Lecture Notes in Computer Science 1109 (1996), 16-30 (Advances in Cryptology - CRYPTO '96). [.ps]

T. Aura, Practical invisibility in digital communication, Proceedings of the Workshop on Information Hiding, Cambridge, England, May 1996, pp. 265-278, Lecture Notes in Computer Science 1174, Springer Verlag 1996.

S. Bakhtiari, R. Safavi-Naini, and J. Pieprzyk, On Password-Based Authenticated Key Exchange using Collisionful Hash Functions. In Australian Conference on Information Security and Privacy (ACISP '96), Springer-Verlag, LNCS 1172, pp. 299-310, 1996. [.ps.Z]

T. Baldin and G. Bleumer, CryptoManager++ -- An object oriented software library for cryptographic mechanisms; 12th IFIP International Conference on Information Security (IFIP/Sec '96), Chapman & Hall, London 1996, 489-491. [.ps.gz]

A. Beimel, Secure Schemes for Secret Sharing and Key Distribution, Ph.D. Thesis, Dept. of Computer Science, Technion, 1996. [.ps]

A. Beimel and B. Chor, Communication in key distribution schemes, IEEE Trans. on Info. Theory, 42(1):19-28, 1996. Extended abstract in CRYPTO '93, vol. 773 of LNCS, pp. 444-455. 1994. [.ps]

M. Bellare, J. Garay, and T. Rabin, Distributed Pseudo-Random Bit Generators - A New Way to Speed Up Shared Coin Tossing, Proc. 15th Annual Symp. on Principles of Distributed Computing pp. 191-200, Philadelphia, May 1996. [.ps]

M. Bellare and P. Rogaway, The exact security of digital signatures: How to sign with RSA and Rabin. Extended abstract in Advances in Cryptology - Eurocrypt 96 Proceedings, Lecture Notes in Computer Science Vol. 1070, U. Maurer ed, Springer-Verlag, 1996.

M. Bellare, C. Canetti, and H. Krawczyk, Message authentication using hash functions: The HMAC construction, RSA Laboratories' CryptoBytes v. 2, no. 1, Spring 1996.

M. Bellare and M. Yung, Certifying permutations: Non-interactive zero-knowledge based on any trapdoor permutation, Journal of Cryptology Vol. 9, No. 1, pp. 149-166, 1996.

M. Bellare and S. Goldwasser, Encapsulated key escrow. Early version was MIT Laboratory for Computer Science Technical Report 688, April 1996.

M. Bellare, R. Canetti, and H. Krawczyk, Pseudorandom functions revisited: The cascade construction and its concrete security, Extended abstract in Proc. 37th Annual Symposium on the Foundations of Computer Science, IEEE, 1996.

M. Bellare and S. Goldwasser, Encapsulated key escrow; Early version was MIT Laboratory for Computer Science Technical Report 688, April 1996.

M. Bellare, R. Canetti, and H. Krawczyk, Keying hash functions for message authentication. Extended abstract in Advances in Cryptology - Crypto 96 Proceedings, Lecture Notes in Computer Science Vol. 1109, N. Koblitz ed, Springer-Verlag, 1996.

M. Bellare and R. Rivest, Translucent cryptography -- An alternative to key escrow, and its implementation via fractional oblivious transfer. Earlier version was MIT Laboratory for Computer Science Technical Memo No. 683, February 1996.

S. Bellovin, Problem Areas for the IP Security Protocols, Proceedings of the Sixth Usenix Unix Security Symposium, pp. 1-16, San Jose, CA, July 1996. [.pdf] [.ps]

S. Bellovin, Defending Against Sequence Number Attacks; RFC 1948, May 1996.

I. Ben-Aroya and E. Biham, Differential Cryptanalysis of Lucifer, CS 782, October 1993, Proceedings of Crypto'93, LNCS 773, Journal of Cryptology, Vol. 9, No. 1, pp. 21-34, 1996. [.ps.gz]

E. Bertino, S. Jajodia, and P. Samarati, Supporting multiple access control policies in database systems, Proc. IEEE Symp. on Research in Security and Privacy, Oakland, Calif., May 1996, pages 94-107. [.ps]

J. Bierbrauer, K. Gopalakrishnan, and D. Stinson, Orthogonal arrays, resilient functions, error-correcting codes and linear programming bounds; SIAM J. Discrete Math 9 (1996), 424-452. [.ps]

E. Biham, How to Forge DES-Encrypted Messages in 2²⁸ Steps, August 1996 . [.ps.gz]

E. Biham, Cryptanalysis of Triple-Modes of Operation, CS 885, August 1996. [.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]

M. Blaze, Efficient Symmetric-Key Ciphers Based on an NP-Complete Subproblem (DRAFT), Submitted for publication, October 2, 1996. [.ps]

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]

M. Blaze, Oblivious Key Escrow. Revised paper originally presented at Cambridge Workshop on Information Hiding, May 1996. [.ps]

M. Blaze, W. Diffie, R. Rivest, B. Schneier, T. Shimomura, E. Thompson, and M. Weiner, Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security, January 1996.

M. Blaze, Cryptography Policy and the Information Economy. Draft, 17 December 1996. [.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]

D. Bleichenbacher, Generating ElGamal signatures without knowing the secret key, Advances in Cryptology - EUROCRYPT '96 (corrected version), LNCS vol. 1070, Springer Verlag, pp. 10-18, 1996. [.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]

U. Blumenthal and S. Bellovin, A Better Key Schedule for DES-like Ciphers, Proceedings of PRAGOCRYPT '96, Prague, September 1996. [.pdf] [.ps]

C. Blundo, L. Frota Mattos, and D. Stinson, Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution; Lecture Notes in Computer Science 1109 (1996), 387-400 (Advances in Cryptology - CRYPTO '96). [.ps]

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 Venkie, Hardness of computing most significant bit of Diffie-Hellman and related schemes, Proceedings Crypto '96, Lecture Notes in Computer Science, Vol. 1109, Springer-Verlag, 1996, pp. 129-142.

A. Bosselaers, R. Govaerts, and J. Vandewalle, Fast hashing on the Pentium, Advances in Cryptology, Proceedings Crypto'96, LNCS 1109, N. Koblitz, Ed., Springer-Verlag, 1996, pp. 298-312. [.pdf]

C. Boyd, A Class of Flexible and Efficient Key Management Protocols, Proceedings of 9th IEEE Computer Security Foundations Workshop, IEEE Computer Society, 1996, pp. 2-8. [.ps]

C. Boyd, A Framework for Design of Key Establishment Protocols, Information Security and Privacy, LNCS 1172, pp.146-157, 1996. [.ps]

G. Brassard and C. Crépeau, Cryptology Column -- 25 Years of Quantum Cryptography; SIGACT News, Volume 27, Number. 3, Whole Number 100, pp. 13-24, September 1996. [.ps.gz]

G. Brassard, C. Crépeau, and M. Sántha, Oblivious Transfers and Intersecting Codes, IEEE Transaction on Information Theory, special issue on coding and complexity, v. 42, n. 6, November 1996, pp. 1769-1780. [.ps]

G. Brassard and C. Crépeau and M. Sántha, Oblivious Transfers and Intersecting Codes; IEEE Transaction on Information Theory, special issue in coding and complexity, Volume 42, Number 6, pp. 1769-1780, November 1996. [.ps.gz]

L. Brown, Mobile Code Security, AUUG96, Melbourne, Sept 1996. Also published as Technical Report CS07/96, Aug 1996.

J. Buchmann, M. Jacobson, and E. Teske, On some computational problems in finite abelian groups; Technical Report No. TI-2/96, 17.07.96, Mathematics of Computation 1996. [.ps.gz]

J. Buchmann and F. Eisenbrand, On Factor Refinement in Number Fields; Technical Report No. TI-5/96, 1996. [.ps.gz]

J. Buchmann and S. Neis, Algorithms for Linear Algebra Problems over Principal Ideal Rings; Technical Report No. TI-7/96, 1996. [.ps]

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]

J. Camenisch, J.-M. Piveteau, and M. Stadler, An Efficient Fair Payment System, Proceedings of 3rd ACM Conference on Computer Communications Security, ACM press, March 1996, pp. 88-94. [.ps]

K. Candan, S. Jajodia, and V. Subrahmanian, Secure mediated databases, Proc. 12th Int'l. Conf. on Data Engineering, 1996, pp. 28-37. [.ps]

R. Canetti and R. Gennaro, Incoercible Multiparty Computation, 1996 IEEE Symposium on the Foundations of Computer Science (FOCS 96). [.ps.Z]

R. Canetti, U. Feige, O. Goldreich, and M. Naor, Adaptively Secure Multi-party Computation; TR-682, LCS/MIT, 1996. [.ps]

A. Clark, Cryptographic Controls, The Eternal Triangle, COMPSEC '96, London, Elsevier. [.pdf]

C. Crépeau, calcul partagé à base d'encryption probabiliste; Prepared for the "Camps Mathématique", AMQ, 2 pages, June 1996. [.ps.gz]

C. Crépeau, What is going on with Quantum Bit Commitment?; invited paper in Proceedings of Pragocrypt '96, Czech Technical University Publishing House, Prague, pages 193-203, 1996. [.ps.gz]

R. Cramer, B. Schoenmakers, and M. Yung, Multi-authority secret ballot elections with linear work, Advances in Cryptology -- Eurocrypt '96 Proceedings, 1996. Earlier version in CWI Research Report CS-R9571, January 1996. [.ps]

R. Cramer and I. Damgård, New Generation of Secure and Practical RSA-based Signatures, CRYPTO '96, Springer Verlag LNCS, vol. 1109, pp. 173--185 [.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.

D. Currie and C. Irvine, Surmounting the Effects of Lossy Compression on Steganography, Proceedings of the 19th National Information System Security Conference, Baltimore, MD, October 1996, pp. 194-201. [.pdf]

I. Damgård, T. Pedersen, and B. Pfitzmann, Statistical Secrecy and Multi-Bit Commitments; BRICS Report Series RS-96-45, Computer Science Department, Aarhus University, Nov. 1996. [.ps.gz]

D. Davis, Compliance Defects in Public-Key Cryptography, Proc. 6th Usenix Security Symp, (San Jose, CA, 1996), pp. 171-178. [.pdf] [.ps]

A. De Santis, C. Blundo, L. Gargano, and U. Vaccaro, On the Information Rate of Secret Sharing Schemes, Theoretical Computer Science, v. 154, 1996, pp. 283-306. [.ps.gz]

A. De Santis, G. Ateniese, C. Blundo, and D. R. Stinson, Constructions and Bounds for Visual Cryptography, ICALP '96. [.ps]

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]

Y. Desmedt, Simmons' protocol is not free of subliminal channels; In Proceedings: 9th IEEE Computer Security Foundations Workshop, p. 170--175, Kenmare, Ireland, June 10--12, 1996. [.ps]

Y. Desmedt, Establishing Big Brother using covert channels and other covert techniques, R. Anderson, ed., Information Hiding, First International Workshop, Proceedings (Lecture Notes in Computer Science 1174), pp. 65-71. Springer-Verlag, 1996. Cambridge, U.K., May/June.

Y. Ding, H. Petersen, and P. Horster, A new approach for delegation using hierarchical delegation tokens; Proc. 2nd Int. Conference on Computer and Communications Security, Essen, Chapman and Hall, (1996), S. 128 - 143. [.ps.Z]

H. Dobbertin, A. Bosselaers, and B. Preneel, RIPEMD-160, a strengthened version of RIPEMD, Fast Software Encryption, LNCS 1039, D. Gollmann, Ed., Springer-Verlag, 1996, pp. 71-82. [.pdf]

R. Fagin, M. Naor, and P. Winkler, Comparing Inforamtion Without Leaking It; Communications of the ACM, vol 39, May 1996, pp. 77-85.

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

S. Foley, L. Gong, and X. Qian, A Security Model of Dynamic Labeling Providing a Tiered Approach to Verification, Proceedings of the IEEE Symposium on Security and Privacy, Oakland, California, May 1996, pp.142--153. [.ps.gz]

D. Fox and A. Röhm, Effiziente Digitale Signatursysteme auf der Basis Elliptischer Kurven; In: Horster, P. (Hrsg.): Digitale Signaturen. Proceedings der Arbeitstagung Digitale Signaturen 96, Vieweg-Verlag, Braunschweig, September 1996, S. 201-220.

Y. Frankel and M. Yung, Witness-based Cryptographic Program Checking; 1996 Symposium on the Theory of Computation [.ps]

M. Franklin, R. Cramer, B. Schoenmakers, and M. Yung, Multi-authority secret ballot elections with linear work, Advances in Cryptology -- Eurocrypt '96 Proceedings. [.ps]

M. Franklin, D. Coppersmith, J. Patarin, and M. Reiter, Low exponent RSA with related messages, Advances in Cryptology -- Eurocrypt '96 Proceedings. [.ps]

M. Franklin and M. Reiter, The design and implementation of a secure auction service, IEEE Transactions on Software Engineering, Vol. 22, No. 5, May 1996, pp. 302-312. [.ps]

H. Fujii, W. Kachen, and K. Kurosawa, Combinatorial bounds and design of broadcast authentication, IEICE Trans., Vol.E79-A, No. 4, 1996, pp. 502-506. [.ps]

D. Geer and D. Davis, Token-Mediated Certification and Electronic Commerce, Proc. 2nd USENIX Workshop on Electronic Commerce, (Oakland, CA, 1996), pp. 13-22. [.ps]

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust and Efficient Sharing of RSA Functions, Proceedings of CRYPTO'96. [.ps]

R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, Robust Threshold DSS Signatures, Proceedings of EUROCRYPT'96, Springer Verlag, LNCS 1070, pp. 354-371. [.ps]

R. Gennaro, Theory and Practice of Verifiable Secret Sharing; Ph.D. Thesis MIT EECS Department. [.ps.Z]

I. Goldberg, D. Wagner, R. Thomas, and E. Brewer, A secure environment for untrusted helper applications: confining the wily hacker; 1996 USENIX Security Symposium. [.pdf]

I. Goldberg and D. Wagner, Randomness and the Netscape Browser, Dr. Dobb's Journal, January 1996.

O. Goldreich and E. Petrank, Quantifying Knowledge Complexity; revised July 1996. [.ps]

O. Goldreich and A. Wigderson, On the Circuit Complexity of Perfect Hashing; July 1996. [.ps]

O. Goldreich, S. Goldwasser, and S. Halevi, Public-key Cryptosystems from Lattice Problems, Proceedings of CRYPTO'97.

O. Goldreich, S. Goldwasser, and S. Halevi, and Public-Key Cryptosystems from Lattice Reduction Problems, CRYPTO '97.

O. Goldreich and D. Ron, A Universal Learning Algorithm; June 1996. [.ps]

O. Goldreich and S. Safra, A Combinatorial Consistency Lemma with application to the PCP Theorem; 1996. [.ps]

O. Goldreich, S. Goldwasser, and D. Ron, Property Testing and its connection to Learning and Approximation; 1996.

O. Goldreich and A. Kahan, How to Construct Constant-Round Zero-Knowledge Proof Systems for NP; March 1996. [.ps]

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

O. Goldreich, The Graph Clustering Problem has a Perfect Zero-Knowledge Proof; October 1996. [.ps]

O. Goldreich and A. Wigderson, Tiny Families of Functions with Random Properties:A Quality-Size Trade-off for Hashing; revised January 1996. [.ps]

O. Goldreich, S. Goldwasser, and S. Halevi, Collision-Free Hashing from Lattice Problems; Available as Theory of Cryptography Library: Record 96-09. [.ps]

L. Gong and X. Qian, Computational Issues in Secure Interoperation, IEEE Transactions on Software Engineering, 22(1):43--52, January, 1996. [.ps.gz]

K. Gopalakrishnan and D. Stinson, A simple analysis of the error probability of two-point based sampling; Information Processing Letters 60 (1996), 91-96. [.ps]

K. Gopalakrishnan and D. Stinson, A short proof of the non-existence of certain cryptographic functions; J. Combin. Math. Combin. Comput. 20 (1996), 129-137. [.ps]

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. Herzberg, H. Krawczyk, M. Yung, and S. Jarecki, Proactive Secret Sharing and Public Key Cryptosystems; MIT M.Eng. Thesis: Feb'96 [.ps.gz]

H. Heys and S. Tavares, Cryptanalysis of Substitution-Permutation Networks Using Key-Dependent Degeneracy, Cryptologia, v. XX, n. 3, 1996, pp. 258-274. [.ps]

H.M. Heys, Avalanche Characteristics of DES-like Ciphers, Proceedings of SAC '96 - Workshop on Selected Areas in Cryptography, Queen's University, Kingston, Ontario, Aug. 1996. [.ps]

D. Jablon, Strong Password-Only Authenticated Key Exchange, Computer Communication Review, ACM SIGCOMM, vol. 26, no. 5, pp. 5-26, October 1996.

T. Jakobsen and C. Harpes, Non-Uniformity Measures for Generalized Linear Cryptanalysis and Partitioning Cryptanalysis, Proceedings of Pragocrypt '96, 1996. [.ps] [.ps.gz]

T. Jakobsen, Correlation Attacks on Block Ciphers, Dept. of Mathematics, Technical University of Denmark, January 1996. [.ps] [.ps.gz]

M. Jakobsson and M. Yung, Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers, Advances in Cryptology: Crypto '96, ed. Neal Kolblitz. [.pdf]

M. Jakobsson, Designated Verifier Proofs and Their Applications, Eurocrypt '96. [.pdf]

R. Jenkins, ISAAC and RC4, Proceedings of the 3rd Fast Software Encryption Workshop, Lecture Notes in Computer Science 1039, Springer-Verlag, 1996. (Note: the online version is somewhat more complete than the published version).

M. Joye, Common modulus attack against Lucas-based cryptosystems; Tech. Report CG-1996/10, UCL Crypto Group, Louvain-la-Neuve, December 1996. [.ps.gz]

M. Joye and J.-J. Quisquater, Efficient computation of full Lucas sequences; Electronics Letters, Vol. 32, No. 6, pp. 537-538, March 1996. [.ps.gz]

M. Joye and J.-J. Quisquater, Note on the preliminary version of Meyer-Müller cryptosystem, Technical Report CG-1996/2, UCL Crypto Group, Louvain-la-Neuve, January 1996. [.ps.gz]

M. Just and S. Vaudenay, Authenticated Multi-Party Key Agreement, Advances in Cryptology - Asiacrypt '96, Lecture Notes in Computer Science 1163, Springer-Verlag, pp. 36-49, November, 1996. [.html - abstract] [.ps]

J.-P. Katoen and B. Schoenmakers, Systolic Arrays for the Recognition of Permutation-Invariant Segments; Science of Computer Programming 27 (1996) 119-137. [.ps.gz]

J. Kelsey, B. Schneier, and D. Wagner, Key-Schedule Cryptanalysis of 3-WAY, IDEA, G-DES, RC4, SAFER, and Triple-DES, Advances in Cryptology--CRYPTO '96 Proceedings, Springer-Verlag, August 1996, pp. 237-251.

J. Kelsey, B. Schneier, and C. Hall, An Authenticated Camera, 12th Annual Computer Security Applications Conference, ACM Press, December 1996, pp. 24-30.

J. Kelsey and B. Schneier, Authenticating Outputs of Computer Software Using a Cryptographic Coprocessor, Proceedings 1996 CARDIS, September 1996, pp. 11-24.

J. Kilian and P. Rogaway, How to protect DES against exhaustive key search; Advances in Cryptology - CRYPTO '96, Lecture Notes in Computer Science, Vol. 1109, N. Koblitz, ed., Springer-Verlag, 1996, pp. 252-267. [.ps] [.ps.gz]

S. Kim, S. Park, and D. H. Won, Convertible Group Signatures, Advances in Cryptology - Asiacrypt'96, Springer, Lecture Notes in Computer Science, LNCS 1163, 1996, pp. 311-321. [.zip]

S. Kim, S. Park, and D. Won, Zero-Knowledge Nominative Signatures, Proc. of Pragocrypt'96, International Conference on the Theory and Applications of Cryptology, 1996, pp. 380-392. [.zip]

L. Knudsen and B. Preneel, Hash Functions Based on Block Ciphers and Quaternary Codes, Advances in Cryptology - Proc. AsiaCrypt'96, LNCS 1163, Springer Verlag, 1996, pp. 77-90. [.ps.Z]

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]

L. Knudsen and T. Pedersen, On the Difficulty of Software Key Escrow, Advances in Cryptology -- Proc. EUROCRYPT'96, LNCS 1070, pp. 237-244, Springer Verlag, 1996. [.ps.Z]

L. Knudsen and M. Robshaw, Non-linear Approximations in Linear Cryptanalysis, Advances in Cryptology -- Proc. EUROCRYPT'96, LNCS 1070, Springer Verlag, 1996, pp. 224-236. [.ps.Z]

K. Kurosawa and T. Satoh, Generalization of higher order SAC to vector output Boolean function, IEICE Trans. E81-A, pp. 41-47 (1998). (Preliminary version appeared in Advances in Cryptology - ASIACRYPT '96, LNCS 1163 (1996), 218-231.) [.ps]

E. Kushilevitz, R. Ostrovsky, and A. Rosén, Characterizing Linear Size Circuits in Terms of Privacy, STOC 96. [.ps.Z]

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. 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. Levein, L. McCarthy and M. Blaze, Transparent Internet E-mail Security (DRAFT). August 9, 1996. Submitted for publication. [.ps]

M. Luby, Pseudorandomness and Cryptographic Applications, Princeton Computer Science Notes, David R. Hanson and Robert E. Tarjan, Editors, Princeton University Press, January 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, 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, Blind Certification of Public Keys, HP Labs Technical Reports, HPL-96-71, May 16, 1996.

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, 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, 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 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 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, Factoring with an Oracle, Institute for Theoretical Computer Science, ETH Zürich. 1996. in Computational Complexity. Birkhäuser, Basel. Pages: 12. [.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, Language Generation and Verification in the NRL Protocol Analyzer, Proceedings of the 9th Computer Security Foundations Workshop, IEEE Computer Society Press, 1996. [.pdf] [.ps]

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

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]

M. Naor and A. Shamir, Visual Cryptography II; Cambrdige Workshop on Protocols, 1996. [.ps.gz]

M. Naor and A. Wool, Acceess Control and Signatures via Quorum Secret Sharing; 5th ACM Conf. on Computer and Communication Security, 1996.

S. Obana and K. Kurosawa, Veto is Impossible in Secret Sharing Schemes, Information Processing Letters, Vol. 58, No 6, 1996, pp. 293-295. [.ps]

W. Ogata and K. Kurosawa, Optimum Secret Sharing Scheme Secure against Cheating, Advances in Cryptology - EUROCRYPT '96, LNCS 1070, 1996, pp. 200-211. [.ps]

J. Patarin, Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): two new families of Asymmetric Algorithms, Proceedings of EUROCRYPT'96, Springer, Lecture Notes in Computer Science, Vol. 1070, May 1996, pp. 33-48. Extended version. [.pdf] [.dvi] [.ps]

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

H. Petersen, Man-in-the-middle-Angriff auf ein Schlüsselaustauschprotokoll; Anmerkung auf der Fachkonferenz Digitale Signaturen, Darmstadt, September (1996) [.ps.gz]

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

B. Pfitzmann (collected by), Information Hiding Terminology -- Results of an informal plenary meeting and additional proposals; Information Hiding, LNCS 1174, Springer-Verlag, Berlin 1996, 347-350. [.ps.gz]

A. Pfitzmann, B. Pfitzmann, M. Schunter, and M. Waidner, Mobile User Devices and Security Modules: Design for Trustworthiness; IBM Research Report RZ 2784 (#89262) 02/05/96, IBM Research Division, Zurich, Feb. 1996. [.ps.gz]

B. Pfitzmann and M. Schunter, Asymmetric Fingerprinting; Eurocrypt '96, LNCS 1070, Springer-Verlag, Berlin 1996, 84-95. [.ps.gz]

B. Pfitzmann, Trials of Traced Traitors; Information Hiding, LNCS 1174, Springer-Verlag, Berlin 1996, 49-64. [.ps.gz]

B. Pfitzmann, Sorting Out Signature Schemes; CWI Quarterly 8/2 (1995) 147-172 (appeared March 1996). [.ps.gz]

B. Pfitzmann and M. Waidner, Properties of Payment Systems - General Definition Sketch and Classification; IBM Research Report RZ 2823 (#90126) 05/06/96, IBM Research Division, Zürich, May 1996. [.ps.gz]

B. Pfitzmann and M. Waidner, Anonymous Fingerprinting; IBM Research Report RZ 2881 (#90829) 11/18/96, IBM Research Division, Zürich, Nov. 1996. [.pdf] [.ps.gz]

B. Pfitzmann and M. Waidner, Information-Theoretic Pseudosignatures and Byzantine Agreement for t >= n/3; IBM Research Report RZ 2882 (#90830) 11/18/96, IBM Research Division, Zürich, Nov. 1996. [.ps.gz]

D. Pointcheval, Les Preuves de Connaissance et leurs Preuves de Sécurité, PhD thesis, Université de Caen, dec. 1996. [.ps.Z]

D. Pointcheval and J. Stern, Security Proofs for Signature Schemes, Advances in Cryptology - Proceedings of Eurocrypt '96, volume 1070 of Lecture Notes in Computer Science, pages 387-398. Springer-Verlag, 1996.

D. Pointcheval and J. Stern, Provably Secure Blind Signature Schemes, Advances in Cryptology - Proceedings of Asiacrypt '96, volume 1163 of Lecture Notes in Computer Science, pages 252--265. Springer-Verlag, 1996.

B. Preneel and P. van Oorschot, On the security of two MAC algorithms, Advances in Cryptology, Proceedings Eurocrypt '96, LNCS 1070, Ueli Maurer, Ed., Springer-Verlag, 1996, pp. 19-32. [.ps]

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. Rees and D. Stinson, Combinatorial characterizations of authentication codes II; Designs, Codes and Cryptography 7 (1996), 239-259. [.ps]

V. Rijmen, J. Daemen, B. Preneel, A. Bosselaers, and E. De Win, The cipher SHARK, Fast Software Encryption, LNCS 1039, D. Gollmann, Ed., Springer-Verlag, 1996, pp. 99-112. [.ps]

H. Ritter, Breaking Knapsack Cryptosystems by Max-Norm Enumeration, Proceedings of 1st International Conference of the Theory and Appications of Cryptology - Pragocrypt '96, pp. 480-492, 1996. [.ps]

R. Rivest and A. Shamir, PayWord and MicroMint--Two Simple Micropayment Schemes. [.ps] [.ppt]

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);

P. Rogaway, The security of DESX; Less technical summary of the above article. RSA Laboratories' CryptoBytes, Summer 1996. [.ps] [.ps.gz]

A. Rubin, Independent One-Time Passwords; USENIX Journal of Computer Systems (February, 1996). [.pdf] [.ps.gz]

B. Schneier and J. Kelsey, A Peer-to-Peer Software Metering System, The Second USENIX Workshop on Electronic Commerce Proceedings, USENIX Press, November 1996, pp. 279-286.

B. Schneier, J. Kelsey, and J. Walker, Distributed Proctoring, ESORICS 96 Proceedings, Springer-Verlag, September 1996, pp. 172-182.

B. Schneier and J. Kelsey, Unbalanced Feistel Networks and Block Cipher Design, Fast Software Encryption, Third International Workshop Proceedings (February 1996), Springer-Verlag, 1996, pp. 121-144.

B. Schneier and J. Kelsey, Automatic Event Stream Notarization Using Digital Signatures, Security Protocols, International Workshop April 1996 Proceedings, Springer-Verlag, 1997, pp. 155-169.

V. Shoup and A. Rubin, Session-key distrubution using smart cards; in Proc. Eurocrypt '96, pp. 321-31, 1996. [.ps.Z]

V. Shoup, On the security of a practical identification scheme, in Proc. Eurocrypt '96, pp. 344-353, 1996. [.ps.Z]

V. Shoup, A note on session-key distrubution using smart cards; manuscript, 1996. This contains some corrections and modifications to the previous paper. [.ps.Z]

V. Shoup, On fast and provably secure message authentication based on universal hashing; in Proc. Crypto '96, pp. 313-328, 1996. This contains some corrections to the conference version. [.ps.Z]

V. Shoup and A. Rubin, Session Key Distribution Using Smart Cards; Proc. of Eurocrypt '96 (May, 1996). [.ps]

D. Stinson, On the connections between universal hashing, combinatorial designs and error-correcting codes; Congressus Numerantium 114 (1996), 7-27. [.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]

P. Syverson, Limitations on Design Principles for Public Key Protocols, Proceedings of the 1996 IEEE Symposium on Security and Privacy, Oakland, CA, 1996, IEEE CS Press, pp. 62-73. [.pdf] [.ps]

A. Treacher and G. Bleumer, An Overview of SEISMED; Studies in Health Technology and Informatics, Volume 27, Towards Security in Medical Telematics, IOS Press, Amsterdam 1996, 4-8. [.ps.gz]

Y. Tsiounis, Y. Frankel, and M. Yung, Indirect Discourse Proofs: Achieving Fair Off-Line Electronic Cash; Asiacrypt '96, Lecture Notes in Computer Science 1163, pages 286-300, November 3-7, South Korea.

D. Wagner and B. Schneier, Analysis of the SSL 3.0 Protocol, The Second USENIX Workshop on Electronic Commerce Proceedings, USENIX Press, November 1996, pp. 29-40.

D. Wagner and S. Bellovin, A "Bump in the Stack" Encryptor for MS-DOS Systems, Proceedings of the Symposium on Network and Distributed System Security, San Diego, CA, pp. 155-160, February 1996. [.pdf] [.ps]

A. Young and M. Yung, Cryptovirology: Extortion-Based Security Threats and Countermeasures, Proceedings of the 1996 IEEE Symposium on Security and Privacy, pp. 129-140, May 6-8, IEEE Computer Society Press, 1996. [.ps]

A. Young and M. Yung, The Dark Side of Black-Box Cryptography -or- Should We Trust Capstone?, CRYPTO '96, pp 89-103, Springer-Verlag. [.ps]

X. Zhang and Y. Zheng, Characterizing the structures of cryptographic functions satisfying the propagation criterion for almost all vectors; Design, Codes and Cryptography, Vol. 7, No. 1/2, pp. 111-134, 1996. [.ps] [.ps.Z]

X. Zhang and Y. Zheng, Auto-Correlation and New Bounds on the Nonlinearity of Cryptographic Functions; Advances in Cryptology -- EuroCrypt'96, Lecture Notes in Computer Science, Vol. 1070, pp. 294-306, Springer-Verlag, 1996. [.ps] [.ps.Z]

X. Zhang and Y. Zheng, On the Difficulty of Constructing Cryptographically Strong Substitution Boxes; Journal of Universal Computer Science, Vol. 2, No. 3, pp. 147-162, 1996. [.ps] [.ps.Z]

X. Zhang and Y. Zheng, Difference Distribution Table of a Regular Substitution Box; Proceedings of the Third Annual Workshop on Selected Areas in Cryptography (SAC'96), pp. 57-60, August 1996. [.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, An Authentication and Security Protocol for Mobile Computing; Mobile Communications - Technology, Tools, Applications, Authentication and Security (Proceedings of IFIP World Conference on Mobile Communications), Edited by J. L. Encarnacao and J. M. Rabaey, pp.249-257, Chapman & Hall, 2-6 September 1996, Canberra, Australia. [.ps] [.ps.Z]

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