Unconditional sender and recipient untraceabelity in spite of active attacks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 434 LNCS, Issue , 1990, Pages 302-319

  Waidner, Michael ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; CRYPTOGRAPHY;

ACTIVE ATTACK; ARBITRARY COMMUNICATION; BROADCAST MESSAGES; BYZANTINE AGREEMENT; RELIABLE BROADCAST; UNCONDITIONALLY SECURE;

NETWORK SECURITY;

EID: 84896508047     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46885-4_32     Document Type: Conference Paper

References (28)

1. M. Ben-Or, S. Goldwasser, A. Wigderson: Completeness theorems for non-cryptographic fault-tolerant distributed computation; 20th STOC, ACM, New York 1988, 1-10.
2. J. Bos, B. den Boer Detection of Disrupters in the DC Protocol; Abstracts of Eurocrypt '89.
3. D. Chaum: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms; CACM 24/2 (1981) 84-88.
4. D. Chaum: The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability; J. of Cryptology 1/1 (1988) 65-75 (draft received May 13, 1985).
5. D. Chaum: The Spymasters Double-Agent Problem - Multiparty Computations Secure Unconditionally from Minorities and Cryptographically from Majorities; rec. July 21,1989, announced for Crypto '89.
6. D. Chaum: Security without Identification: Transaction Systems to make Big Brother Obsolete; CACM 28/10 (1985) 1030-1044.
7. D. Chaum, C. Crépeau, I. Damgård: Multiparty unconditional secure protocols; 20th STOC, ACM, NY 1988,11-19.
8. W. Diffie, M. E. Heilman: New Directions in Cryptography; IEEE Trans, on Information Theory 22/6 (1976) 644-654.
9. R. G. Gallager: Information Theory and Reliable Communication; John Wiley & Sons, New York 1968.
10. E. N. Gilbert, F. J. Mac Williams, N. J. A. Sloane: Codes which detect deception; BSTJ 53/3 (1974) 405-424.
11. S. Goldwasser, S. Micali, R. L. Rivest: A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks; SIAM J. Comput 17/2 (1988) 281-308.
12. L. Lamport, R. Shostak, M. Pease: The Byzantine Generals Problem; ACM TOPLAS 4/3 (1982) 382-401.
13. E. Marchel: Leistungsbewertung von überlagemdem Empfangen bei Mehrfachzugriffsverfahren mittels Kollisions- auflösung; Diplomarbeit am Institut fur Rechnerentwurf and Fehlertoleranz, Universitat Karlsruhe 1988.
14. J. L. Massey: Collision-Resolution Algorithms and Random-Access Communications; Multi-User Communication Systems; Edited by G. Longo; CISM Courses and Lectures No. 265, International Centre for Mechanical Sciences; Springer-Verlag, Wien 1981, 73-137.
15. M. Pease, R. Shostak, L. Lamport: Reaching Agreement in the Presence of Faults; JACM, 27/2 (1980) 228-234.
16. A. Pfitzmann: A switched/broadcast ISDN to decrease user observability; 1984 International Zurich Seminar on Digital Communications, IEEE, 1984, 183-190.
17. B. Pfitzmann: private communication, 1987.
18. A. Pfitzmann: Diensteintegrierende Kommunikationsnetze mit Teilnehmer-überprüfbarem Datenschutz; Dissertation Fakultät für Informatik, Universität Karlsruhe 1989 (will be published in: IFB, Springer-Verlag, Berlin 1989).
19. A. Pfitzmann: How to implement ISDNs without user observability - Some remarks; Fakultät für Informatik, Intemer Bericht 14/85, Universität Karlsruhe 1986.
20. A. Pfitzmann, B. Pfitzmann, M. Waidnen Datenschutz garantierende offene Kommunikationsnetze; Informatik- Spektrum 11/3 (1988) 118-142.
21. A. Pfitzmann, M. Waidner: Networks without user observability - design options; Eurocrypt '85, LNCS 219, Springer- Verlag, Berlin 1986, 245-253; revised version: Computers & Security 6/2 (1987) 158-166.
22. M. O. Rabin: Probabilistic Algorithms in Finite Fields; SIAM J. Comput 9/2 (1980) 273-280.
23. GJ. Simmons: A Survey of Information Authentication; Proc. IEEE 76/5 (1988) 603-620.
24. A. S. Tanenbaum: Computer Networks; 2nd ed., Prentice-Hall, Englewood Cliffs 1988.
25. K. S. Trivedi: Probability and Statistics with Reliability, Queuing, and Computer Science Applications; Prentice-Hall, Englewood Cliffs 1982.
26. U. V. Vazirani, V. V. Vazirani: Efficient and Secure Pseudo-Random Number Generation (extended abstract); Crypto '84, LNCS 196, Springer-Verlag, Berlin 1985, 193-202.
27. M. Waidner, B. Pfitzmann: Unconditional Sender and Recipient Untraceability in spite of Active Attacks - Some Remarks; Fakultät für Informatik, Intemer Bericht 5/89, Universitat Karlsruhe 1989.
28. M. Waidner, B. Pfitzmann: The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability; presented at Eurocrypt '89; final version: these proceedings.