ISDN-Mixes: Untraceable Communication with Very Small Bandwidth Overhead

  • Andreas Pfitzmann
  • Birgit Pfitzmann
  • Michael Waidner
Conference paper
Part of the Informatik-Fachberichte book series (INFORMATIK, volume 267)

Abstract

Untraceable communication for services like telephony is often considered infeasible in the near future because of bandwidth limitations. We present a technique, called ISDN-Mixes, which shows that this is not the case.

As little changes as possible are made to the narrowband-ISDN planned by the PTTs. In particular, we assume the same subscriber lines with the same bit rate, and the same long-distance network between local exchanges, and we offer the same services.

ISDN-Mixes are a combination of a new variant of Chaum’s Mixes, dummy traffic on the subscriber lines (where this needs no additional bandwidth), and broadcast of incoming-call messages in the subscriber-area.

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. BoBo_89.
    Jurjen Bos, Bert den Boer: Detection of Disrupters in the DC Protocol; Eurocrypt ‘89; Houthalen, 10.–13. April 1989, Abstracts; Proc. to appear in the series LNCS, Springer-Verlag Heidelberg.Google Scholar
  2. Bock_88.
    Peter Bocker: ISDN - The Integrated Services Digital Network; Concepts, Methods, Systems; In collaboration with G. Arndt, V. Frantzen, O. Fundneider, L. Hagenhaus, H. J. Rothamel, L. Schweizer; Springer-Verlag, Heidelberg 1988.Google Scholar
  3. Cha8_85.
    David Chaum: Security without Identification: Transaction Systems to make Big Brother Obsolete; Communications of the ACM 28 /10 (1985) 1030–1044.Google Scholar
  4. Chau_81.
    David Chaum: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms; Communications of the ACM 24 /2 (1981) 84–88.CrossRefGoogle Scholar
  5. Chau_88.
    David Chaum: The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability; Journal of Cryptology 1 /1 (1988) 65–75.MathSciNetMATHCrossRefGoogle Scholar
  6. Chau_89.
    David Chaum: Privacy Protected Payments - Unconditional Payer and/or Payee Untraceability; SMART CARD 2000: The Future of IC Cards, Proceedings of the MP WG 11.6 International Conference; Laxenburg (Austria), 19.–20. 10. 1987, North-Holland, Amsterdam 1989, 69–93.Google Scholar
  7. DaPr_89.
    D. W. Davies, W. L. Price: Security for Computer Networks, An Introduction to Data Security in Teleprocessing and Electronic Funds Transfer; (2nd ed.) John Wiley & Sons, New York 1989.Google Scholar
  8. GoGM_86.
    O. Goldreich, S. Goldwasser, S. Micali: How to construct random functions; Journal of the ACM 33 /4 (1986) 792–807.CrossRefGoogle Scholar
  9. GoMR_88.
    Shafi Goldwasser, Silvio Micali, Ronald L. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks; SIAM J. Comput. 17 /2 (1988) 281–308.MathSciNetMATHCrossRefGoogle Scholar
  10. Kah2_85.
    Peter Kahl (Hrsg.): ISDN, Das künftige Fernmeldenetz der Deutschen Bundespost; R. V. Decker’s Taschenbuch Telekommunikation (TTK ), R. V. Decker’s Verlag G. Schenk, 1985.Google Scholar
  11. Pfit_90.
    Andreas Pfitzmann: Diensteintegrierende Kommunikationsnetze mit teilnehmerüberprüfbarem Datenschutz; IFB 234, Springer-Verlag, Heidelberg 1990.CrossRefGoogle Scholar
  12. PfPf_89.
    Birgit Pfitzmann, Andreas Pfitzmann: How to Break the Direct RSA-Implementation of MIXes; Eurocrypt ‘89; Houthalen, 10.–13. April 1989, Abstracts; Proc. to appear in the series LNCS, Springer-Verlag Heidelberg.Google Scholar
  13. PfPW_88.
    Andreas Pfitzmann, Birgit Pfitzmann, Michael Waidner: Datenschutz garantierende offene Kommunikationsnetze; Informatik-Spektrum 11 /3 (1988) 118–142.Google Scholar
  14. PfWa_86.
    Andreas Pfitzmann, Michael Waidner: Networks without user observability - design options; Eurocrypt ‘85, LNCS 219, Springer-Verlag, Berlin 1986, 245–253;Google Scholar
  15. Andreas Pfitzmann, Michael Waidner: Extended version in: Computers & Security 6/2 (1987) 158–166.Google Scholar
  16. RSA_78.
    Ronald L. Rivest, Adi Shamir, Leonard Adleman: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems; CACM 21 /2 (1978) 120–126MATHGoogle Scholar
  17. Ronald L. Rivest, Adi Shamir, Leonard Adleman: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems; CACM 26 /1 (1983) 96–99.Google Scholar
  18. Tane_88.
    Andrew S. Tanenbaum: Computer Networks; 2nd ed., Prentice-Hall, Englewood Cliffs 1988.Google Scholar
  19. Waid_89.
    Michael Waidner: Unconditional Sender and Recipient Untraceability in spite of Active Attacks; Eurocrypt ‘89; Houthalen, 10.–13. April 1989, Abstracts; Proc. to appear in the series LNCS, Springer-Verlag Heidelberg.Google Scholar
  20. WaPf_89.
    Michael Waidner, Birgit 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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heilderberg 1991

Authors and Affiliations

  • Andreas Pfitzmann
    • 1
  • Birgit Pfitzmann
    • 1
  • Michael Waidner
    • 1
  1. 1.Institut für Rechnerentwurf und FehlertoleranzUniversität KarlsruheKarlsruhe 1Federal Republic of Germany

Personalised recommendations