Abstract
The Dining Cryptographers algorithm [Chaum 87] allows participants to send messages in a way ensuring that they cannot be traced.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Herbert O. Burton: “Inversionless Decoding of Binary BCH Codes”, IEEE transactions on Information Theory, Vol. IT-17, No. 4, July 1971.
D. Chaum: “The Dining Cryptographers Problem: Unconditional sender and Recipient Untraceability”. Journal of Cryptology (1988) 1:65–75.
D. W. Davies, D. L. A. Barber, W. L. Price, C. M. Solomides: “Computer Networks and their Protocols”, John Wiley and Sons, 1979.
Rudold Lidl, Harald Niederreiter: “Finite fields”, “Encyclopedia of mathematics and its applications”, Vol. 20, section Algebra.
A. Pfitzmann: “Dienseintegrierende Kommunaktionsnetze mit Teilnehmer-überprüfbarem Datenschutz”, Ph. D. thesis, 1987.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bos, J., den Boer, B. (1990). Detection of Disrupters in the DC Protocol. In: Quisquater, JJ., Vandewalle, J. (eds) Advances in Cryptology — EUROCRYPT ’89. EUROCRYPT 1989. Lecture Notes in Computer Science, vol 434. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46885-4_33
Download citation
DOI: https://doi.org/10.1007/3-540-46885-4_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53433-4
Online ISBN: 978-3-540-46885-1
eBook Packages: Springer Book Archive