Crypto Bibliography

N. Daswani, D. Boneh, H. Gracia-Molina, S. Ketchpel, and A. Paepcke, A Generalized Wallet Architecture, Proceedings of the 3rd USENIX Workshop on Electronic Commerce, 1998.

H. Handschuh and P. Paillier, Reducing the collision probability of Alleged Comp128, CARDIS'98, Louvain-la-Neuve, Belgique, LNCS, Springer-Verlag, 1998. [.ps.gz]

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

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]

S. Kim, S.H. Oh, S. Park, and D. Won, Verifiable Self-Certified Public Keys, Proc. of WCC'99, INRIA Workshop on Coding and Cryptography, January 1999. [.zip]

S. Kim, B. Kim, and S. Park, Comments on password-based private key download protocol of NDSS'99, Electronics Letters, 35(22), IEE Press, 1999, pp.1937-1938. [.zip]

S. Kim, S. Park, and D. Won, Group Signatures for Hierarchical Multigroups, Proc. of ISW'97, Information Security Workshop, Springer, Lecture Notes in Computer Science, LNCS 1396, 1998, pp. 273-281. [.zip]

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. Park, S. Kim, and D. Won, ID-based Group Signature, Electronics Letters, 1997, pp. 1616-1617. [.zip]

S. Kim, S. Park, and D. Won, Proxy Signatures, Revisited, Proc. of ICICS'97, International Conference on Information and Communications Security, Springer, Lecture Notes in Computer Science, LNCS 1334, 1997, pp. 223-232. [.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]

S. Kim, S. Oh, S. Park, and D. Won, Cryptanalysis and Enhancement of Saeednia's Key-Exchange Protocols, Proceeding of KICS'98, Korean Institute of Communication Sciences Summer Conference, Vol.17/No.2, 1998, pp. 1001--1004. [.ps]

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

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

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]

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]

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]

D. Bleichenbacher and S. Patel, SOBER Cryptanalysis [.ps], Fast Software Encryption Workshop 1999, LNCS vol. 1636, Springer-Verlag, pp. 305-316, 1999. [.ps] [.ps.gz]

Y. Tsiounis, Y. Frankel, and B. Patt-Shamir, Exact Analysis of Exact Change; The 5th Israel Symposium on the Theory of Computing Systems (ISTCS '97), June 17-19, Ran-Gatan Israel, pages 107-119, IEEE Computer Society Press.

J. Buchmann and S. Paulus, A one way function based on ideal arithmetic in number fields; Technical Report No. TI-5/97, 1997. [.ps.gz]

E. van Heijst, T. Pedersen, and B. Pfitzmann, New Constructions of Fail-Stop Signatures and Lower Bounds; Crypto '92, LNCS 740, Springer-Verlag, Berlin 1993, 15-30. [.ps.gz]

J.P. Boly, A. Bosselaers, R. Cramer, R. Michelsen, S. Mjølsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmakers, M. Schunter, L. Vallée, and M. Waidner, The ESPRIT project CAFE - High security digital payment systems, Proceedings ESORICS'94, LNCS 875, D. Gollmann, Ed., Springer-Verlag, 1994, pp. 217-230. [.pdf]

R. Cramer and T. Pedersen, Improved Privacy in Wallets with Observers, Proceedings of EUROCRYPT '93, Lofthus, Norway, Springer Verlag LNCS, vol. 765, pp. 329-343. [.ps]

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]

I. Damgård, T. Pedersen, and B. Pfitzmann, On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures; Crypto '93, LNCS 773, Springer-Verlag, Berlin 1994, 250-265. [.ps.gz]

J.-P. Boly, A. Bosselaers, R. Cramer, S. Mjølsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmaker, L. Vallée, and M. Waidner, Digital Payment Systems in the ESPRIT Project CAFE; Securicom 94, Paris 1.-3.6.1994, 35-45. [.ps.gz]

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]

R. Cramer and T. Pedersen, Efficient and provable security amplifications. [.ps.Z]

J.-P. Boly, A. Bosselaers, R. Cramer, R. Michelsen, S. Mjolsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmakers, M. Schunter, L. Vallee, and M. Waidner, The ESPRIT Project CAFE: High Security Digital Payment Systems; In ESORICS 94 (Third European Symposium on Research in Computer Security), volume 875 of Lecture Notes in Computer Science, pages 217-230, Berlin, 1994. Springer-Verlag. [.ps.gz]

L. Claesen, J. Daemen, M. Genoe, and G. Peeters, Subterranean: a 600 Mbit/sec cryptographic VLSI chip, Proceedings of ICCD '93: VLSI in Computers and Processors, R. Camposano, A. Domic, Eds., IEEE Computer Society Press, 1993, pp. 610-613. [.ps.gz]

J. Daemen, M. Peeters, and G. Van Assche, Bitslice Ciphers and Power Analysis Attacks, Fast Software Encryption 2000.

J. Daemen, M. Peeters, V. Rijmen, and G. Van Assche, The Noekeon Block Cipher, Nessie Proposal, First Open Nessie Workshop, November 2000.

A. Juels and M. Peinado, Hiding Cliques for Cryptographic Security, Proceedings of the ninth annual ACM-SIAM Symposium on Discrete Algorithms, ACM Press, January 1998. [.ps.gz]

B. Awerbuch, O. Goldreich, D. Peleg, and R. Vainish, A Trade-off between Information and Communication in Broadcast Protocols; June 1989. [.ps]

N. Alon, O. Goldreich, J. Hastad, and R. Peralta, Simple Constructions of Almost $k$-wise Independent Random Variables; June 1992. [.ps] Addendum: [.ps]

V. Shoup and R. Peralta, Primality testing with fewer random bits; Computational Complexity 3:355-367, 1993. [.ps.Z]

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]

C. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. Wootters, Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels; Physical Review Letters, vol. 70, 29 March 1993, pp. 1895 - 1899. [.ps.gz]

C. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres, and W. Wootters, Teleporting an unkown quantum state by dual classical and EPR channels; Physical Review Letter, 70:1895-1898, 1993. [.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]

A. De Santis, G. Di Crescenzo, G. Persiano, and M. Yung, On Monotone Formula Closure of SZK, Proceedings of the 35th Symposium on Foundations of Computer Science 1994, (FOCS '94), pp. 454-465. [.ps.gz]

A. De Santis and G. Persiano, Zero-Knowledge Proofs of Knowledge Without Interaction, Proceedings of the 33rd Symposium on Foundations of Computer Science 1992 (FOCS '92), 1992, pp. 427-437. [.ps.gz]

A. De Santis, M. Blum, S. Micali, and G. Persiano, NonInteractive Zero-Knowledge, SIAM Journal on Computing, 20(6):1084-1118, 1991. [.ps.gz]

A. De Santis, G. Di Crescenzo, and G. Persiano, Randomness-efficient Non-Interactive Zero-knowledge, ICALP '97 (with G. Di Crescenzo, and G. Persiano). [.ps]

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]

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

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]

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

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. Petersen and M. Michels, GOST 34.10 - A brief overview about Russian's DSS; Computers and Security, Dezember, (1996). [.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]

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

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, Cryptanalysis and improvement of signcryption schemes; IEE Computers and Digital Communications, Vol. 145, No. 2, (1998), Seite 149 - 151. [.ps.zip]

R. Anderson and F. Peticolas, On the Limits of Steganography, IEEE Journal on Selected Areas in Communications (J-SAC), Special Issue on Copyright & Privacy Protection, vol. 16 no. 4, pp. 474-481, May 1998.

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

R. Anderson, B. Crispo, C. Manifavas, V. Matyas, and F. Petitcolas, The Global Trust Register, Datasem '98, pp 219-241, Brno, Czech Republic, October 1998.

R. Anderson, V. Matyas, and F. Petitcolas, The Eternal Resource Locator: An Alternative Means of Establishing Trust on the World Wide Web, 3rd USENIX workshop on electronic commerce, ISBN 1-880-446-97-9, pp. 141-153. [.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]

R. Anderson, V. Matyas, and F. Petitcolas, Secure Books: Protecting the Secure Distribution of Knowledge, Security Protocols Workshop, 1997.

R. Anderson, V. Matyas, F. Petitcolas, I. Buchan, and R. Hanka, On the Importance of Trusted Distribution and Authentic Channels for the Distribution of Medical Knowledge,

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

S. Halevi and E. Petrank, Storing Classified Files [.ps.gz]

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

O. Goldreich and E. Petrank, The Best of Both Worlds: Guaranteeing Termination in Fast Randomized Byzantine Agreement Protocols; October 1990. [.ps]

C. Burwick, D. Coppersmith, E. D'Avignon, R. Gennaro, S. Halevi, C. Jutla, S. Matyas Jr., L. O'Connor, M. Peyravian, D. Safford, and N. Zunic, MARS - a candidate cipher for AES, First AES conference, 1998. [.pdf] [.ps]

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]

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]

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

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]

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]

A. Ort, R. Aßmann, G. Bleumer, M. Böttger, D. Fox, A. Pfitzmann, B. Pfitzmann, and M. Waidner, Schutz in verteilten Systemen durch Kryptologie - Ein Praktikum im Informatik-Hauptstudium; Datenschutz und Datensicherung DuD 16/11 (1992) 571-579. [.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 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]

M. Waidner, B. Pfitzmann, and A. Pfitzmann, Über die Notwendigkeit genormter kryptographischer Verfahren; Datenschutz und Datensicherung DuD /6 (1987) 293-299. [.ps.gz]

D. Fox and B. Pfitzmann, Effiziente Software-Implementierung des GMR-Signatursystems; GI-Fachtagung Verläßliche Informationssysteme (VIS'91), März 1991, Darmstadt, Informatik-Fachberichte 271, Springer-Verlag, Heidelberg 1991, 329-345. [.ps.gz]

B. Pfitzmann and M. Schunter, Asymmetric Fingerprinting; Eurocrypt '96, LNCS 1070, Springer-Verlag, Berlin 1996, 84-95. [.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]

M. Waidner and B. Pfitzmann, Loss-Tolerance for Electronic Wallets; FTCS 20, 26-28th June 1990, Newcastle upon Tyne (UK), 140-147. [.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]

E. van Heijst, T. Pedersen, and B. Pfitzmann, New Constructions of Fail-Stop Signatures and Lower Bounds; Crypto '92, LNCS 740, Springer-Verlag, Berlin 1993, 15-30. [.ps.gz]

A. Ort, R. Aßmann, G. Bleumer, M. Böttger, D. Fox, A. Pfitzmann, B. Pfitzmann, and M. Waidner, Schutz in verteilten Systemen durch Kryptologie - Ein Praktikum im Informatik-Hauptstudium; Datenschutz und Datensicherung DuD 16/11 (1992) 571-579. [.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]

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. Chaum, E. van Heijst, and B. Pfitzmann, Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer; Interner Bericht 1/91, Fakultät für Informatik, Universität Karlsruhe, February 1991. [.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, 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 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]

J.-P. Boly, A. Bosselaers, R. Cramer, R. Michelsen, S. Mjolsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmakers, M. Schunter, L. Vallee, and M. Waidner, The ESPRIT Project CAFE: High Security Digital Payment Systems; In ESORICS 94 (Third European Symposium on Research in Computer Security), volume 875 of Lecture Notes in Computer Science, pages 217-230, Berlin, 1994. Springer-Verlag. [.ps.gz]

N. Baric and B. Pfitzmann, Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees; Eurocrypt '97, LNCS 1233, Springer-Verlag, Berlin 1997, 480-494. [.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]

J.P. Boly, A. Bosselaers, R. Cramer, R. Michelsen, S. Mjølsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmakers, M. Schunter, L. Vallée, and M. Waidner, The ESPRIT project CAFE - High security digital payment systems, Proceedings ESORICS'94, LNCS 875, D. Gollmann, Ed., Springer-Verlag, 1994, pp. 217-230. [.pdf]

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]

M. Waidner and B. Pfitzmann, The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability; Universität Karlsruhe 1989; Abstract in: Eurocrypt '89, LNCS 434, Springer-Verlag, Berlin 1990, 690. [.ps.gz]

D. Chaum, E. van Heijst, and B. Pfitzmann, Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer (Extended abstract); Crypto '91, LNCS 576, Springer Verlag, Berlin 1992, 470-484. [.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]

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]

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

M. Waidner, B. Pfitzmann, and A. Pfitzmann, Über die Notwendigkeit genormter kryptographischer Verfahren; Datenschutz und Datensicherung DuD /6 (1987) 293-299. [.ps.gz]

M. Waidner and B. Pfitzmann, Anonyme und verlusttolerante elektronische Brieftaschen; Interner Bericht 1/87 der Fakultät für Informatik, Universität Karlsruhe 1987 (80 Seiten). [.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, 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]

M. Waidner and B. Pfitzmann, Unconditional Sender and Recipient Untraceability in spite of Active Attacks - Some Remarks; Fakultät für Informatik, Universität Karlsruhe, Interner Bericht 5/89, March 1989. [.ps.gz]

G. Bleumer, B. Pfitzmann, and M. Waidner, A Remark on a Signature Scheme where Forgery can be Proved; Eurocrypt '90, LNCS 473, Springer-Verlag, Berlin 1991, 441-445. [.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. Baum-Waidner, B. Pfitzmann, and M. Waidner, Unconditional Byzantine Agreement with Good Majority; STACS'91, LNCS 480, Springer-Verlag, Heidelberg 1991, 285-295. [.ps.gz]

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

I. Damgård and B. Pfitzmann, Sequential Iteration of Interactive Arguments and an Efficient Zero-Knowledge Argument for NP; BRICS Report Series RS-97-50, Computer Science Department, Aarhus University, Dec. 1997.

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, 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 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, Trials of Traced Traitors; Information Hiding, LNCS 1174, Springer-Verlag, Berlin 1996, 49-64. [.ps.gz]

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

D. Fox and B. Pfitzmann, Effiziente Softwareimplementierung des GMR-Signatursystems; In: Pfitzmann, A.; Raubold, E. (Hrsg.): Proceedings der Fachtagung Verläßliche Informationssysteme - VIS '91. Informatik Fachberichte Nr. 271, Springer Verlag, Heidelberg 1991, S. 329-345.

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

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]

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

O. Goldreich, B. Pfitzmann, and R. Rivest, Self-Delegation with Controlled Propagation -- or -- What If You Lose Your Laptop; Theory of Cryptography Library 97-12, September 1997.

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]

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]

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]

I. Damgård, T. Pedersen, and B. Pfitzmann, On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures; Crypto '93, LNCS 773, Springer-Verlag, Berlin 1994, 250-265. [.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 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]

O. Goldreich, B. Pfitzmann, and R. Rivest, Self-Delegation with Controlled Propagation; September 1997. [.ps]

J.-P. Boly, A. Bosselaers, R. Cramer, S. Mjølsnes, F. Muller, T. Pedersen, B. Pfitzmann, P. de Rooij, B. Schoenmaker, L. Vallée, and M. Waidner, Digital Payment Systems in the ESPRIT Project CAFE; Securicom 94, Paris 1.-3.6.1994, 35-45. [.ps.gz]

S. Bakhtiari, R. Safavi-Naini, and J. Pieprzyk, A Message Authentication Code based on Latin Squares, Australian Conference on Information Security and Privacy (ACISP '97), Springer-Verlag, LNCS 1270, pp. 194-203, 1997. [.ps.Z]

Y. Zheng, J. Pieprzyk, and J. Seberry, HAVAL -- a one-way hashing algorithm with variable length of output; Advances in Cryptology -- AusCrypt'92, Lecture Notes in Computer Science, Vol. 718, pp. 83-104, Springer-Verlag, Berlin, 1993. [.tar.Z]

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]

Y. Zheng, T. Hardjono, and J. Pieprzyk, The sibling intractable function family (SIFF): notion, construction and applications; IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science, Vol. E76-A, No. 1, pp. 4-13, January 1993. [.ps] [.ps.Z]

L. Brown, J. Pieprzyk, R. Safavi-Naini, and J. Seberry, A Generalised Testbed for Analysing Block and Stream Ciphers [.txt], Technical Report CS10/91, March 1991. [.ps.gz] [.txt]

Y. Zheng, T. Hardjono, and J. Pieprzyk, Sibling intractable function families and their applications; Advances in Cryptology -- AsiaCrypt'91, Lecture Notes in Computer Science, Vol.739, pp. 124-138, Springer-Verlag, 1993. [.ps] [.ps.Z]

L. Brown and J. Pieprzyk, Introducing the new LOKI97 Block Cipher, Technical Report No. CS02/98, Jun 1998. [.ps] [.ps.gz]

M. Naor and B. Pinkas, Visual Authentication; Crypto 97. [.ps.gz]

M. Naor and B. Pinkas, Secure and Efficient Metering; Eurocrypt 98. [.ps] [.ps.gz]

V. Anupam, A. Mayer, K. Nissim, B. Pinkas, and M. Reiter On the Security of Pay-per-Click and Other Web Advertising Schemes, Proc. 8th World Wide Web Conference, 1999.

R. Canetti, J. Garay, G. Itkis, D. Micciancio, M. Naor, and B. Pinkas, Multicast Security: A Taxonomy and Efficient Constructions, Proc. INFOCOM '99, Vol. 2, pp. 708-716, March 1999. [.ps]

L. Brown, J. Piprzyk, and J. Seberry, LOKI - A Cryptographic Primitive for Authentication and Secrecy Applications [.txt], in Advances in Cryptology - Auscrypt'90, Lecture Notes in Computer Science, vol 453, pp229-236, J Seberry, J Pieprzyk (eds), Springer-Verlag, 1990. [.ps.gz] [.txt]

S. Bakhtiari, R. Safavi-Naini, and J. Piprzyk, On Selectable Collisionful Hash Functions, Australian Conference on Information Security and Privacy (ACISP '96), Springer-Verlag, LNCS 1172, pages 287-298, 1996. [.ps.Z]

P. Delsarte, Y. Desmedt, A. Odlyzko, and P. Piret, Fast cryptanalysis of the Matsumoto-Imai public key scheme, Advances in Cryptology: Proceedings of EUROCRYPT 84, T. Beth, N. Cot, and I. Ingemarsson (eds.), Springer-Verlag, Lecture Notes in Computer Science #209, 1985, pp. 142-149. [.pdf] [.ps]

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]

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]

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]

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]

J. Camenisch, J.-M. Piveteau, and M. Stadler, An Efficient Electronic Payment System Protecting Privacy, Computer Security -- ESORICS 94, Lecture Notes in Computer Science v. 875, pp. 207-215, Springer Verlag, 1994. [.txt - abstract] [.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]

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.

O. Baudron, H. Gilbert, L. Granboulan, H. Handschuh, A. Joux, P. Nguyen, F. Noilhan, D. Pointcheval, T. Pornin, G. Poupard, J. Stern, and S. Vaudenay, Report on the AES Candidates, Proceedings of the Second AES Candidate Conference, Rome, Italy, 1999. [.pdf]

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, 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 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, New Blind Signatures Equivalent to Factorization, Proceedings of the 4th ACM Conference on Computer and Communications Security, pages 92-99, ACM Press, 1997.

M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway, Relations among notions of security for public-key encryption schemes; Advances in Cryptology - CRYPTO '98, Lecture Notes in Computer Science, Vol. 1462, H. Krawczyk, ed., Springer-Verlag.

K. Martin, B. Preneel, C. Mitchell, H. Hitz, G. Horn, A. Poliakova, and P. Howard, Secure billing for mobile information services in UMTS, 5th International Conference in Services and Networks, IS&N'98, LNCS 1430, Springer-Verlag, 1998, pp. 535-548. [.ps.gz]

P. Beauchemin, G. Brassard, C. Crépeau, C. Goutier, and C. Pomerance, Two observations on probabilistic primality testing; In Advances in Cryptology: Proceedings of Crypto '86, volume 263 of Lecture Notes in Computer Science, pages 443-450. Springer-Verlag, 1987. [.ps.gz]

P. Beauchemin, G. Brassard, C. Crépeau, C. Goutier, and C. Pomerance, The generation of random numbers that are probably prime, Journal of Cryptology, 1(1):53-64, 1988. [.ps]

O. Baudron, H. Gilbert, L. Granboulan, H. Handschuh, A. Joux, P. Nguyen, F. Noilhan, D. Pointcheval, T. Pornin, G. Poupard, J. Stern, and S. Vaudenay, Report on the AES Candidates, Proceedings of the Second AES Candidate Conference, Rome, Italy, 1999. [.pdf]

O. Baudron, H. Gilbert, L. Granboulan, H. Handschuh, A. Joux, P. Nguyen, F. Noilhan, D. Pointcheval, T. Pornin, G. Poupard, J. Stern, and S. Vaudenay, Report on the AES Candidates, Proceedings of the Second AES Candidate Conference, Rome, Italy, 1999. [.pdf]

L. Gong, M. Mueller, H. Prafullchandra, and R. Schemers, Going Beyond the Sandbox: An Overview of the New Security Architecture in the Java Development Kit 1.2, Proceedings of the USENIX Symposium on Internet Technologies and Systems, Monterey, California, December 1997, pp. 103-112. [.ps.gz]

J. Claessens, B. Preneel, and J. Vandewalle, Anonymity Controlled Electronic Payment Systems, Proceedings of the 20th Symposium on Information Theory in the Benelux, 1999, pp. 109-116. [.ps.gz]

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. Handschuh and B. Preneel, On the Security of Double and 2-key Triple Modes of Operation, Fast Software Encryption, 6th International Workshop, LNCS 1636, Springer Verlag, 1999, pp. 231-244. [.ps.gz]

J. Claessens, M. Vandenwauver, B. Preneel, and J. Vandewalle, Setting up a secure web server and clients on an Intranet, IEEE 7th International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE'98), 1998, pp 295-300. [.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]

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

J. Claessens, B. Preneel, and J. Vandewalle, Solutions for Anonymous Communication on the Internet, Proceedings of the IEEE 33rd Annual 1999 International Carnahan Conference on Security Technology (ICCST'99), pp 298-303. [.ps.gz]

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, 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, A. Bosselaers, and H. Dobbertin, The cryptographic hash function RIPEMD-160, CryptoBytes, Vol. 3, No. 2, 1997, pp. 9-14. [.pdf]

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

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]

K. Martin, B. Preneel, C. Mitchell, H. Hitz, G. Horn, A. Poliakova, and P. Howard, Secure billing for mobile information services in UMTS, 5th International Conference in Services and Networks, IS&N'98, LNCS 1430, Springer-Verlag, 1998, pp. 535-548. [.ps.gz]

V. Rijmen and B. Preneel, A family of trapdoor ciphers, Fast Software Encryption, LNCS 1267, E. Biham, Ed., Springer-Verlag, 1997, pp. 139-148. [.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]

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]

E. De Win and B. Preneel, Elliptic curve public-key cryptosystems - an introduction, State of the Art in Applied Cryptography, LNCS 1528, B. Preneel and V. Rijmen, Eds., Springer-Verlag, 1998, pp. 131-141. [.ps]

G. Horn, B. Preneel, Authentication and payment in future mobile systems, Proceedings ESORICS '98, LNCS 1485, J.-J. Quisquater, Y. Deswarte, C. Meadows, D. Gollmann, Eds., Springer-Verlag, 1998, pp. 277-293. [.ps]

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]

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

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]

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