Crypto Bibliography

Citations by Year - 1995

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.

R. Anderson and E. Biham, Two Practical and Provably Secure Block Ciphers: BEAR and LION, CS 875, December 1995; Fast Software Encryption 3, 1996, LNCS 1039. [.ps.gz]

R. Anderson and R. Needham, Programming Satan's Computer, Computer Science Today, LNCS 1000, Springer-Verlag, 1995, pp 426-441. [.ps.gz]

R. Anderson, Crypto in Europe - Markets, Law and Policy, Cryptography: Policy and Algorithms, Springer LNCS v 1029 pp 75-89. [.ps.Z]

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]

T. Aura, Modelling the Needham-Schröder authentication protocol with high level Petri nets, Digital Systems Laboratory Report B14, September 1995.

M. Bellare, O. Goldreich, and M. Sudan, Free Bits, PCPs and Non-Approximability; 1995.

M. Bellare, O. Goldreich, and S. Goldwasser, Incremental Cryptography; 1995.

M. Bellare, J. Garay, R. Hauser, A. Herzberg, H. Krawczyk, M. Steiner, G. Tsudik, and M. Waidner, iKP - A Family of Secure Electronic Payment Protocols, Proc. First USENIX Workshop on Electronic Commerce, New York City, July 1995.

M. Bellare and P. Rogaway, The complexity of approximating a nonlinear program; Journal of Mathematical Programming B, Vol. 69, No. 3, pp. 429-441, September 1995. [.ps] [.ps.gz]

M. Bellare, R. Guerin, and P. Rogaway, XOR MACs: New methods for message authentication using finite pseudorandom functions. Extended abstract in Advances in Cryptology - Crypto 95 Proceedings, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed, Springer-Verlag,1995.

M. Bellare, O. Goldreich, and S. Goldwasser, Incremental cryptography with application to virus protection. Proc. 27th Annual Symposium on the Theory of Computing, ACM, 1995.

M. Bellare and P. Rogaway, Optimal asymmetric encryption -- How to encrypt with RSA, Advances in Cryptology - Eurocrypt 94 Proceedings, Lecture Notes in Computer Science Vol. 950, A. De Santis ed, Springer-Verlag, 1995.

M. Bellare and P. Rogaway, Provably secure session key distribution: the three party case. Proc. 27th Annual Symposium on the Theory of Computing, ACM, 1995.

S. Bellovin, Using the Domain Name System for System Break-Ins; in Proceedings of the Fifth Usenix UNIX Security Symposium, Salt Lake City, UT, June, 1995. [.pdf] [.ps]

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]

J. Biskup and G. Bleumer, Cryptographic Protection of Health Information: Cost and Benefit; IMIA, International Medical Information Association (WG4), Data Protection and Security Working Conference, Helsinki, 30.9.-3.10.1995, Preproceedings, 60-67. [.ps.gz]

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

M. Blaze, High-Bandwidth Encryption with Low-Bandwidth Smartcards, January 18, 1995. Presented at Cambridge workshop on Fast Software Encryption, February 1996. [.ps]

M. Blaze and S. Bellovin, Session-Layer Encryption. Proceedings of the USENIX Security Workshop, June 1995. [.ps]

C. Blundo, A. Giorgio Gaggia, and D. Stinson, On the dealer's randomness required in secret sharing schemes; Designs, Codes and Cryptography 11 (1997), 235-259. [Preliminary version appeared in Lecture Notes in Computer Science 950 (1995), 35-46 (Advances in Cryptology - EUROCRYPT '94).] [.ps]

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.

C. Cachin, On-line secret sharing [.ps], Cryptography and Coding: 5th IMA Conference, C. Boyd, ed., Cirencester, UK, Lecture Notes in Computer Science v.1025, Springer Verlag, 1995, pp. 190-198. [.ps] [.ps.gz]

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

J. Camenisch, J.-M. Piveteau, and M. Stadler, Blind Signatures Based on the Discrete Logarithm Problem, Advances in Cryptology - EUROCRYPT '94, Lecture Notes in Computer Science v. 950, Springer Verlag, 1995, pp. 428-432. [.txt - abstract] [.pdf] [.ps]

J. Camenisch, J.-M. Piveteau, and M. Stadler, Fair Anonyme Zahlungssysteme, Proceedings of GISI 95 - Herausforderungen eine globalen Informationsverbundes für die Informatik, Informatik aktuell, Springer Verlag, 1995, pp. 254-265. [.ps] [.ps.Z] [.ps.gz]

P. Cheng, J. Garay, A. Herzberg, and H. Krawczyk, Design and Implementation of Modular Key Management Protocol and IP Secure Tunnel on AIX, Proc. 5th USENIX UNIX Security Symposium, Salt Lake City, Utah, June 1995. [.ps]

B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, Private Information Retrieval, FOCS 95. [.ps.Z]

B. Chor, M. Gereb-Graus, and E. Kushilevitz, Private Computations Over the Integers, SICOMP 24(2), 1995, pp. 376-386. [.ps.Z]

A. Clark, Security Technology and Electronic Commerce, Internet and Online Business Security, London. [.pdf]

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.

D. Coppersmith, M. Franklin, J. Patarin, and M. Reiter, Low exponent RSA with related messages, Advances in Cryptology -- Eurocrypt '96 Proceedings, 1996. Earlier version in IBM Research Report RC 20318, December 27, 1995. [.ps]

C. Crépeau and L. Salvail, Oblivious Verification of Common String, CWI Quarterly, v. 8, n. 2, June 1995, pp. 97-109. [.ps]

C. Crépeau, J. van de Graaf, and A. Tapp, Committed Oblivious Transfer and Private Multi-Party Computations; Advances in Cryptology: Proceedings of Crypto '95, Springer-Verlag, pages 110-123, 1995. [.ps.gz]

C. Crépeau, Réconcilliation et Distillation publiques de secret; unpublished manuscript, 13 pages, 1995. [.ps.gz]

C. Crépeau and L. Salvail, Quantum Oblivious Mutual Identification; Advances in Cryptology: Proceedings of Eurocrypt '95, Springer-Verlag, pages 133-147, 1995. [.ps.gz]

A. Cresti and P. Béguin, General Short Computational Secret Sharing Scheme, Advances in Cryptology -- Proceedings of Eurocrypt '95. [.pdf]

J. Daemen, Cipher and hash function design. Strategies based on linear and differential cryptanalysis, Doctoral Dissertation , March 1995.

J. Daemen, R. Govaerts, and J. Vandewalle, Correlation matrices, Fast Software Encryption, LNCS 1008, B. Preneel, Ed., Springer-Verlag, 1995, pp. 275-285. [.ps.gz]

I. Damgård, O. Goldreich, and A. Wigderson, Information Theory versus Complexity Theory: Another Test Case; September 1995. [.ps]

D. Davis, Kerberos Plus RSA for World Wide Web Security, Proc. 1st USENIX Workshop on Electronic Commerce, (NYC, July 1995).. [.pdf] [.ps] [.txt]

D. Davis, D. Geer, and T. Y. Ts'o, Kerberos With Clocks Adrift: History, Protocols, and Implementation, USENIX Computing Systems 9:1 (Jan. '96). [.pdf] [.ps]

P. De Gersem and E. De Win, Analysis and implementation of arithmetic operations in GF(2n), Thesis, K.U.Leuven, 1995.

A. De Santis, C. Blundo, G. Gaggia, and U. Vaccaro, New Bounds on the Information Rate of Secret Sharing Schemes, IEEE Transactions on Information Theory, v. 41, n. 2, 1995, 549-554. [.ps.gz]

A. De Santis, G. Crescenzo, and G. Persiano, Zero-Knowledge Arguments and Public-Key Cryptography, Information and Computation, v. 121, n. 1, 1995, pp. 23-40 [.ps.gz]

A. De Santis, C. Blundo, G. Persiano, and U. Vaccaro, On the Number of Random Bits in Totally Private Computation. An extended abstract of this paper appeared in Proc. of the 22nd International Colloquium on Automata, Languages, and Programming (ICALP '95), Z. Fülöp and F. Gecseg (Eds.), Lectures Notes in Computer Science, vol. 944, Springer-Verlag, 1995, pp. 171-182. [.ps.gz]

A. De Santis, C. Blundo, D. R. Stinson, and U. Vaccaro, Graph Decompositions and Secret Sharing Schemes, Journal of Cryptology, v. 8, 1995, 39-64. [.ps.gz]

A. De Santis, C. Blundo, G. Persiano, and U. Vaccaro, On the Number of Random Bits in Totally Private Computation, ICALP '95. [.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]

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]

Y. Ding and P. Horster, Undetectable On-line Password Guessing Attacks; Operating Systems Review, Vol. 29, No. 4, (1995), S. 77 - 86. [.ps.Z]

Y. Ding and H. Petersen, Eine Klassifikation von Authentifikationsmodellen; Proc. Trust Center'95, Siegen, Vieweg Verlag, (1995), S. 292 - 302. [.ps.Z]

H. Federrath, A. Jerichow, A. Pfitzmann, and B. Pfitzmann, Mehrseitig sichere Schlüsselerzeugung; Proc. Arbeitskonferenz Trust Center 95, DuD Fachbeiträge, Vieweg, Wiesbaden 1995, 117-131. [.ps.gz]

J. Feigenbaum, D. Koller, and P. Shor, A Game-Theoretic Classification of Interactive Complexity Classes; submitted for journal publication. Extended abstract appears in Proceedings of the 1995 IEEE Conference on Structure in Complexity Theory.

J. Feigenbaum, The Use of Coding Theory in Computational Complexity; in Different Aspects of Coding Theory, Proceedings of Symposia on Applied Mathematics, American Mathematical Society, Providence, 1995, pp. 207--233. [.ps.gz]

D. Fox, Zeitabhängiges Key Escrowing; In: Horster, P. (Hrsg.): Trust Center. Proceedings der Arbeitstagung Trust Center 95, Vieweg-Verlag, Braunschweig, 1995, S. 232-245.

D. Fox, P. Horster, and P. Kraaibeek, Grundüberlegungen zu Trust Centern; In: Horster, P. (Hrsg.): Trust Center. Proceedings der Arbeitstagung Trust Center 95, Vieweg-Verlag, Braunschweig, 1995, S. 1-10.

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.

D. Fox, T. Henn, K. Reichel, and C. Ruland, Guarded Authentic Local Area Network - GALAN; In: Brüggemann, H.-H.; Gerhardt, W. (Hrsg.): Proceedings der Fachtagung Verläßliche IT-Systeme VIS '95. DuD-Fachbeiträge 22, Vieweg-Verlag, Braunschweig, April 1995, S. 163-180.

Y. Frankel, E. Brickell, and D. Kravitz, Trustee-traceable Electronic Cash and the Making of Anonymous Change; 1995 Symposium on Discrete Algorithms [.ps]

M. Franklin and M. Yung, Privacy from partial broadcast, Proc. 27th Annual ACM Symposium on Theory of Computing (STOC 1995). [.ps]

M. Franklin and M. Yung, Secure Hypergraphs: Privacy from partial broadcast, SIAM Journal on Discrete Mathematics. Earlier version in Proc. 27th Annual ACM Symposium on Theory of Computing (STOC 1995). [.ps]

M. Franklin and M. Reiter, The design and implementation of a secure auction service, IEEE Transactions on Software Enginerring, Vol. 22, No. 5, May 1996, 302--312. Earlier version in Proc. 1995 IEEE Conference on Security and Privacy. [.ps]

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

R. Gennaro, Achieving Independence Efficiently and Securely, 1995 ACM Conference on Principles of Distributed Computing Systems (PODC95). [.ps.Z]

D. Gillman and R. Rivest, Complete Variable-Length `FixFree' Codes; Designs, Codes, and Cryptography 5,2 (March 1995), 109--114. [.ps]

O. Goldreich, R. Ostrovsky, and E. Petrank, Computational Complexity and Knowledge Complexity; revised March 1995. [.ps]

O. Goldreich and R. Ostrovsky, Software Protection and Simulation on Oblivious RAMs; revised October 1995. [.ps]

O. Goldreich, Probabilistic Proof Systems (survey), 1995. [.ps]

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

O. Goldreich, N. Nisan, and A. Wigderson, On Yao's XOR-Lemma; March 1995. [.ps]

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

L. Gong, P. Syverson, Fail-Stop Protocols: An Approach to Designing Secure Protocols, Proceedings of the 5th IFIP Working Conference on Dependable Computing for Critical Applications, Urbana-Champaign, Illinois, September 1995. [.ps.gz]

L. Gong, Collisionful Keyed Hash Functions with Selectable Collisions, Information Processing Letters, 55(3):167--170, August 1995. Elsevier Science B.V.

L. Gong, N. Shacham, Multicast Security and Its Extension to a Mobile Environment, ACM-Baltzer Journal of Wireless Networks, 1(3):281--295, October 1995. [.ps.gz]

L. Gong, Efficient Network Authentication Protocols: Lower Bounds and Optimal Implementations, Distributed Computing, 9(3):131--145, 1995. Springer-Verlag. [.ps.gz]

L. Gong, Optimal Authentication Protocols Resistant to Password Guessing Attacks, Proceedings of the 8th IEEE Computer Security Foundations Workshop, County Kerry, Ireland, June 1995, pp. 24-29. [.ps.gz]

L. Gong and X. Qian, Enriching the Expressive Power of Security Labels, IEEE Transactions on Knowledge and Data Engineering, 7(5):839--841, October 1995.

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.

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]

S. Halevi, Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver, Advances in Cryptography - CRYPTO '95, Springer-Verlag, 1995. [.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]

C. Harpes, Partitioning Cryptanalysis, Post-Diploma Thesis, Signal and Information Processing Lab., Swiss Federal Institute of Technology, Zurich, March 1995. [.ps]

C. Harpes, A Generalization of Linear Cryptanalysis Applied to SAFER, Internal report, Signal and Information Processing Lab., Swiss Federal Institute of Technology, Zurich, March 9, 1995. [.ps]

A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung, Proactive Secret Sharing, Or: How To Cope With Perpetual Leakage, Proceedings of CRYPTO'95, Springer Verlag, LNCS 963, pp. 339-352. [.ps]

H. Heys and S. Tavares, Avalanche Characteristics of Substitution-Permutation Encryption Networks, IEEE Trans. on Computers, v. 44, n. 9, pp. 1131-1139, 1995. [.ps]

T. Jakobsen, Security Against Generalized Linear Cryptanalysis and Partitioning Cryptanalysis, Semester Project at Signal and Information Processing Laboratory, Swiss Federal Institute of Technology Zurich, Zürich 1995. [.ps] [.ps.gz]

T. Jakobsen, Thomas Jakobsen, A Fast Method for Cryptanalysis of Substitution Ciphers, Cryptologia 19(3), July 1995. [.ps] [.ps.gz]

M. Jakobsson, Ripping Coins for a Fair Exchange; Eurocrypt '95 [.ps]

L. Knudsen and T. Berson, Truncated Differentials of SAFER, Fast Software Encryption, Third International Workshop, Cambridge, UK, February 1996, LNCS 1039, D., Gollmann, Springer Verlag, 1995, pp. 15-26. [.ps.Z]

L. Knudsen, Truncated and Higher Order Differentials, Fast Software Encryption - Second International Workshop, Leuven, Belgium, LNCS 1008, Springer Verlag, 1995, pp. 196-211. [.ps.Z]

L. Knudsen, A Key-schedule Weakness in SAFER K-64, Advances in Cryptology - Proc. Crypto'95, LNCS 963, pp. 274-286, Springer Verlag, 1995. [.ps.Z]

L. Knudsen, New potentially weak keys for DES and LOKI, Advances in Cryptology -- EUROCRYPT'94, LNCS 950, A. De Santis, pp. 419-424, Springer Verlag, 1995. [.ps.Z]

L. Knudsen and K. Nyberg, Provable Security Against a Differential Attack, The Journal of Cryptology, vol.8, No. 1, 1995. [.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]

L. Knudsen and I. Damgaard, Multiple Encryption with Minimum Key, Cryptography: Policy and Algorithms, International Conference, Brisbane, Queensland, Australia, July 1995, LNCS 1029, Springer Verlag, Berlin Heidelberg, pp. 156-164. [.ps.Z]

H. Krawczyk, SKEME: A Versatile Secure Key Exchange Mechanism for the Internet, August 1995. [.ps]

K. Kurosawa, K. Okada, and S. Tsujii, Low Exponent Attack against Elliptic Curve RSA, Information Processing Letters, Vol. 53, No. 2, 1995, 77-83. (Preliminary version appeared in Advances in Cryptology - ASIACRYPT '94, LNCS 917, 1995, 376-386.) [.ps]

K. Kurosawa, S. Obana, and W. Ogata, t-Cheater Identifiable (k,n) Threshold Secret Sharing Schemes, Advances in Cryptology - CRYPTO '95, LNCS 963 (1995), 410-423. [.ps]

K. Kurosawa and K. Okada, Combinatorial Lower Bounds for Secret Sharing Schemes, Information Processing Letters, Vol.60, No. 6, 1996, pp. 301-304. (Preliminary version appeared in Advances in Cryptology - ASIACRYPT '94, LNCS 917, 1995, pp. 55-66.) [.ps]

K. Kurosawa, K. Okada, and K. Sakano, Security of the Center in Key Distribution Schemes, Advances in Cryptology - ASIACRYPT 94, LNCS 917 (1995), 333-341. [.ps]

K. Kurosawa and S. Obana, Combinatorial Bounds for Authentication Codes with Arbitration, Advances in Cryptology - EUROCYPT '95, LNCS 921, 1995, 289-300. [.ps]

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]

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 and S. Zaba, The HP Protocol for Internet Secure Payment Transactions. 33rd Internet Engineering Task Force, pp 493-496, 1995. [.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, An Augmentation of BAN-Like Logics, 8th IEEE Computer Security Foundations Workshop, IEEE Computer Society Press, June 1995, pp. 44-56. [.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, 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, 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]

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

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

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

M. Naor and O. Reingold, Synthesizers and their application to the parallel construction of pseudo-random functions; Extended abstract in: Proc. 36th IEEE Symp. on Foundations of Computer Science, 1995, pp. 170-181.

A. Odlyzko, The future of integer factorization, CryptoBytes (The technical newsletter of RSA Laboratories) 1 (no. 2) (1995), pp. 5-12. [.pdf] [.ps]

W. Ogata and K. Kurosawa, Some new results on nonperfect secret sharing scheme, Technical Report, ISEC95-44, Dec. 1995. [.ps]

K. Okada and K. Kurosawa, Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes, Advances in Cryptology - ASIACRYPT '94, LNCS 917 (1995), 33-41. [.ps]

S. Park, T. Kim, Y. An, and D. Won, A Provably Entrusted Undeniable Signature, Proc. of IEEE SICON/ICIE'95, IEEE Singapore International Conference on Network/International Conference on Information Engineering, 1995, pp.644--648. [.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]

B. Pfitzmann, Breaking an Efficient Anonymous Channel; Eurocrypt '94, LNCS 950, Springer-Verlag, Berlin 1995, 332-340. [.ps.gz]

B. Pfitzmann and A. Weber, News from CAFE -- High Security Digital Payment Systems --; Abstract of 5-minute Talk, distributed at 1995 IEEE Symposium on Research in Security and Privacy, Oakland. [.ps.gz]

B. Pfitzmann and M. Waidner, Strong Loss Tolerance for Untraceable Electronic Coin Systems; Hildesheimer Informatik-Berichte 15/95 (June 1995), Institut für Informatik, Universität Hildesheim. [.ps.gz]

B. Pfitzmann, M. Schunter, and M. Waidner, How to Break Another "Provably Secure" Payment System; Eurocrypt '95, LNCS 921, Springer-Verlag, Berlin 1995, 121-132. [.ps.gz]

D. Pointcheval, A New Identification Scheme Based on The Perceptrons Problem, Advances in Cryptology - Proceedings of Eurocrypt '95, volume 921 of Lecture Notes in Computer Science, pages 319-328. Springer-Verlag, 1995.

B. Preneel and P. van Oorschot, MDx-MAC and building fast MACs from hash functions, Advances in Cryptology, Proceedings Crypto'95, LNCS 963, D. Coppersmith, Ed., Springer-Verlag, 1995, pp. 1-14. [.ps.gz]

V. Rijmen and B. Preneel, On weaknesses of non-surjective round functions, Proceedings of the Workshop on Selected Areas in Cryptography - SAC'95, Ottawa, May 18-19, 1995, pp. 100-106. [.ps.gz]

V. Rijmen and B. Preneel, Improved characteristics for differential cryptanalysis of hash functions based on block ciphers, Fast Software Encryption, LNCS 1008, B. Preneel, Ed., Springer-Verlag, 1995, pp. 242-248. [.ps.gz]

V. Rijmen and B. Preneel, Cryptanalysis of McGuffin, Fast Software Encryption, LNCS 1008, B. Preneel, Ed., Springer-Verlag, 1995, pp. 353-358. [.ps.gz]

P. Rogaway, Bucket hashing and its application to fast message authentication; Advances in Cryptology - CRYPTO '95, Lecture Notes in Computer Science, Vol. 963, D. Coppersmith, ed., Springer-Verlag, 1995. [.ps] [.ps.gz]

J. Schiller, D. Atkins, Scaling the Web of Trust: Combining Kerberos and PGP to Provide Large Scale Authentication [.txt], Usenix 1995 Technical Conference Proceedings, Jan. 16-20, 1995. [.ps] [.txt]

B. Schneier, Blowfish--One Year Later, Dr. Dobb's Journal, September 1995.

C. Schnorr and H. Hörner, Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction, Advances in Cryptology - Eurocrypt '95, Lecture Notes in Computer Science, Vol. 921, Springer Verlag, pp.1-12, 1995.

B. Schoenmakers, A New Algorithm for the Recognition of Series Parallel Graphs; Report CS-R9504, Centrum voor Wiskunde en Informatica (CWI), January 1995.

B. Schoenmakers, An Efficient Electronic Payment System Withstanding Parallel Attacks, Report CS-R9522, Centrum voor Wiskunde en Informatica (CWI), March 1995.

J. Seberry, X. Zhang, and Y. Zheng, The Relationship Between Propagation Characteristics and Nonlinearity of Cryptographic Functions; Journal of Universal Computer Science, Vol. 1, No. 2, pp. 136-150, 1995. [.ps] [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, Relating Nonlinearity to Propagation Characteristics; Proceedings of 1995 Cryptography Policy and Algorithms Conference, pp.283-297, Brisbane, July 1995. [.ps] [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, Nonlinearity and propagation characteristics of balanced Boolean functions; Information and Computation, Vol. 119, No. 1, pp. 1-13, 1995. [.ps] [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, Structures of cryptographic functions with strong avalanche characteristics; Advances in Cryptology -- AsiaCrypt'94, Lecture Notes in Computer Science, Vol.917, pp.119-132, Springer-Verlag, 1995. [.ps] [.ps.Z]

J. Seberry, X. Zhang, and Y. Zheng, Relationships among nonlinearity criteria; Advances in Cryptology -- EuroCrypt'95, Lecture Notes in Computer Science, Vol. 950, pp. 376-388, Springer-Verlag, 1995 [.ps] [.ps.Z]

V. Shoup, A new polynomial factorization algorithm and its implementation; Journal of Symbolic Computation 20:363-397, 1995. [.ps.Z]

M. Stadler, J.-M. Piveteau, and J. Camenisch, Fair Blind Signatures, Advances in Cryptology -- EUROCRYPT '95, Lecture Notes in Computer Science v. 921, pp. 209-219, Springer Verlag, 1995. [.txt - abstract] [.pdf] [.ps]

D. Wagner, The security of MacGuffin. Princeton University senior thesis, April 1995. [.ps]

X. Zhang and Y. Zheng, GAC -- the criterion for global avalanche characteristics of cryptographic functions; Journal of Universal Computer Science, Vol. 1, No. 5, pp. 316-333, 1995. [.ps] [.ps.Z]

X. Zhang and Y. Zheng, On Nonlinear Resilient Functions; Advances in Cryptology -- EuroCrypt'95, Lecture Notes in Computer Science, Vol. 921, pp. 274-288, Springer-Verlag, 1995. [.ps] [.ps.Z]

Y. Zheng, On key agreement protocols based on tamper-proof hardware; Information Processing Letters, Vol.53, pp.49-54, 1995. [.ps] [.ps.Z]

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