Bruce Schneier

 
 

Crypto Bibliography

Citations by First Author - P

C. Park and K. Kurosawa, New ElGamal type threshold digital signature, IEICE Trans., Vol.E79-A, No. 1, 19996, pp. 86-93. [.ps]

S. Park, S. Kim, and D. Won, ID-based Group Signature, Electronics Letters, 1997, pp. 1616-1617. [.zip]

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]

J. Patarin, L. Goubin, and N. Courtois, Improved Algorithms for Isomorphisms of Polynomials, Proceedings of EUROCRYPT'98, Springer, Lecture Notes in Computer Science, Vol. 1403, May 1998, pp. 184-200. [.pdf]

J. Patarin, L. Goubin, and N. Courtois, C*-+ and HM: Variations around two schemes of T. Matsumoto and H. Imai, Proceedings of ASIACRYPT'98, Springer, Lecture Notes in Computer Science, Vol. 1514, October 1998, pp. 35-49. [.pdf]

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, P. Horster, and M. Michels, Taxonomie digitaler Signaturkonzepte; Proc. Digitale Signaturen, Darmstadt, Vieweg Verlag, (1996), S. 63 - 79. [.zip]

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, A. Herrigel, J. O'Ruanaidh, S. Pereira, and T. Pun, Secure Copyright Protection Techniques for Digital Images; Proc. Workshop on Information Hiding, April, (1998), 12 Seiten, erscheint in LNCS, Springer. [.ps.zip]

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

H. Petersen, 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, Meta signature schemes giving message recovery based on the discrete logarithm problem; Proc. 2nd Int. Workshop on IT-Security, Wien, Oldenbourg Verlag, (1994), S. 82 - 92. [.ps.gz]

H. Petersen and P. Horster, Self certified keys - Concepts and Applications; Proc. Communications and Multimedia Security'97, Athen, Chapman & Hall, (1997), S. 102 - 116 [.ps.gz]

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

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

H. Petersen, Faires elektronisches Geld; 5.Deutscher IT-Sicherheitskongress, SecuMedia, (1997), S. 425 - 444. [.ps.gz]

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

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

F. Petitcolas, R. Anderson, and M. Kuhn, Attacks on Copyright Marking Systems, presented at the Second Workshop on Information Hiding, Portland, Oregon, USA, 14--17 April, 1998. [.pdf]

F. Petitcolas, R. Anderson, and M. Kuhn, Information Hiding - A Survey, Proceedings of the IEEE, Vol. 87, No. 7, July 1999, pp. 1062-1078. [.pdf]

F. Petitcolas and K. Zhang, WebGroup: a secure group access control tool for the world wide web, IEEE Seventh International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises, WET ICE '98, June 17-19, 1998, Stanford University, California, USA. [.pdf]

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, and M. Waidner, ISDN-MIXes - Untraceable Communication with very small Bandwidth Overhead; Proc. Kommunikation in verteilten Systemen, Feb. 1991 Mannheim, Informatik-Fachberichte 267, Springer-Verlag, Heidelberg 1991, 451-463; Slightly extended in: Information Security, Proc. IFIP/Sec'91, Mai 1991, Brighton, D. T. Lindsay, W. L. Price (eds.), North-Holland, Amsterdam 1991, 245-258. [.ps.gz]

A. Pfitzmann and B. Pfitzmann, Technical Aspects of Data Protection in Health Care Informatics; Advances in Medical Informatics, J. Noothoven van Goor and J. P. Christensen (Eds.), IOS Press, Amsterdam 1992, 368-386. [.ps.gz]

A. Pfitzmann, B. Pfitzmann, and M. Waidner, Telefon-MIXe: Schutz der Vermittlungsdaten für zwei 64-kbit/s-Duplexkanäle über den (2*64 + 16)-kbit/s-Teilnehmeranschluß; Datenschutz und Datensicherung DuD /12 (1989) 605-622. [.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. Waidner, Anonymous Fingerprinting; IBM Research Report RZ 2881 (#90829) 11/18/96, IBM Research Division, Zürich, Nov. 1996. [.pdf] [.ps.gz]

B. Pfitzmann, Neu und sicher: Digitale Fail-stop-Signaturen; KES - Zeitschrift für Kommunikations- und EDV-Sicherheit 7/5 (1991) 321-326. [.ps.gz]

B. Pfitzmann and M. Waidner, Formal Aspects of Fail-stop Signatures; Interner Bericht 22/90 der Fakultät für Informatik, Universität Karlsruhe, Dezember 1990. [.ps.gz]

B. Pfitzmann and M. Waidner, A General Framework for Formal Notions of "Secure" System; Hildesheimer Informatik-Berichte 11/94 (April 1994), Institut für Informatik, Universität Hildesheim. [.ps.gz]

B. Pfitzmann and M. Waidner, Unconditionally Untraceable and Fault-tolerant Broadcast and Secret Ballot Election; Hildesheimer Informatik-Berichte (Mai 1992), Institut für Informatik, Universität Hildesheim. [.ps.gz]

B. Pfitzmann and A. Pfitzmann, How to Break the Direct RSA-Implementation of MIXes; Eurocrypt '89, LNCS 434, Springer-Verlag, Berlin 1990, 373-381. [.ps.gz]

B. Pfitzmann, Vergleich der algebraischen und kryptographischen Modellierung von Kryptoprotokollen; Studienarbeit, Institut für Rechnerentwurf und Fehlertoleranz, Universität Karlsruhe 1988. [.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]

B. Pfitzmann and M. Waidner, How to Break Fraud-Detectable Key Recovery; IBM Research Report RZ 2970 11/03/1997, IBM Research Division, Zürich, Oct. 1997. [.pdf] [.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, Fail-Stop Signatures Without Trees; Hildesheimer Informatik-Berichte 16/94 (Juni 1994), Institut für Informatik, Universität Hildesheim. [.ps.gz]

B. Pfitzmann and M. Waidner, Attacks on protocols for server-aided RSA computation; Eurocrypt '92, LNCS 658, Springer-Verlag, Berlin 1993, 153-162. [.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]

B. Pfitzmann and M. Waidner, Fail-stop Signatures and their Application; SECURICOM 91; 9th Worldwide Congress on Computer and Communications Security and Protection, 20.-22. March 1991, Paris La Défense, 145-160. [.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 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, M. Schunter, and M. Waidner, Optimal Efficiency of Optimistic Contract Signing; 17th Symposium on Principles of Distributed Computing (PODC), ACM, New York 1998. [.pdf] [.ps.gz]

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

B. Pfitzmann, Fail-stop Signatures: Principles and Applications; Proc. Compsec '91, 8th world conference on computer security, audit and control, Elsevier, Oxford 1991, 125-134. [.ps.gz]

B. Pfitzmann and M. Waidner, How to Break and Repair a "Provably Secure" Untraceable Payment System; Crypto '91, LNCS 576, Springer Verlag, Berlin 1992, 338-350. [.ps.gz]

B. Pfitzmann, Sorting Out Signature Schemes -- and some Theory of Secure Reactive Systems; Hildesheimer Informatik-Berichte 4/93 (Mai 1993), Institut für Informatik, Universität Hildesheim. [.ps.gz]

B. Pfitzmann, M. Waidner, and A. Pfitzmann, Rechtssicherheit trotz Anonymität in offenen digitalen Systemen; Datenschutz und Datensicherung DuD 14/5-6 (1990) 243-253, 305-315. Nachgedruckt in: Kongreßband 1. Kieler Netztage '93, Verlag Claus Schönleber, Kiel, ISBN 3-926986-18-2, 1993, 55-93. [.ps.gz]

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, Asymmetric Fingerprinting for Larger Collusions; 4th ACM Conference on Computer and Communications Security, Zürich, April 1997, 151-160. [.ps.gz]

B. Pfitzmann and M. Waidner, Unbedingte Unbeobachtbarkeit mit kryptographischer Robustheit; GI-Fachtagung Verläßliche Informationssysteme (VIS '91), Informatik-Fachberichte 271, Springer-Verlag, Heidelberg 1991, 302-320. [.ps.gz]

B. Pfitzmann and M. Waidner, Unconditional Byzantine Agreement for any Number of Faulty Processors (Extended Abstract); STACS '92, LNCS 577, Springer-Verlag, Berlin 1992, 339-350. [.ps.gz]

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.

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, Les Preuves de Connaissance et leurs Preuves de Sécurité, PhD thesis, Université de Caen, dec. 1996. [.ps.Z]

D. Pointcheval and J. Stern, New Blind Signatures Equivalent to Factorization, Proceedings of the 4th ACM Conference on Computer and Communications Security, pages 92-99, ACM Press, 1997.

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.

D. Pointcheval, Strengthened Security for Blind Signatures, Advances in Cryptology - Proceedings of Eurocrypt '98, volume 1403 of Lecture Notes in Computer Science, pages 391-405. Springer-Verlag, 1998.

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]

B. Preneel, M. Nuttin, V. Rijmen, and J. Buelens, Cryptanalysis of the CFB mode of the DES with a reduced number of rounds, Advances in Cryptology, Proceedings Crypto'93, LNCS 773 , D. Stinson, Ed., Springer-Verlag, 1994, pp. 212-223. [.ps.gz]

B. Preneel, A. Bosselaers, and H. Dobbertin, The cryptographic hash function RIPEMD-160, CryptoBytes, Vol. 3, No. 2, 1997, pp. 9-14. [.pdf]

B. Preneel, V. Rijmen, and A. Bosselaers, Recent developments in the design of conventional cryptographic algorithms, Computer Security and Industrial Cryptography, State of the Art and Evolution, LNCS 1528, B. Preneel, R. Govaerts, J. Vandewalle, Eds., Springer-Verlag, 1998, pp. 106-131. [.pdf]

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]

M. Pudovkina, A known plaintext attack on the ISAAC keystream generator, Cryptology ePrint Archive, Report 2001/049, 2001.

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