Abstract
In this work we examine the problem of efficient anonymous broadcast and reception in general communication networks. We show an algorithm which achieves anonymous communication with O(1) amortized communication complexity on each link and low computational complexity. In contrast, all previous solutions require polynomial (in the size of the network and security parameter) amortized communication complexity.
Part of this work was done while this author visited Bellcore with the support of DIMACS. Partially supported by the Israeli ministry of science and arts grant #6756196.
Chapter PDF
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
M. Blum and S. Goldwasser, “An efficient probabilistic public-key encryption scheme which hides all partial information”, CRYPTO 84.
M. Blum, and S. Micali “How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits”, FOCS 82 and SIAM J. on Computing, Vol 13, 1984, pp. 850–864.
M. Ben-or, S. Goldwasser, and A. Wigderson, “Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation”, STOC 88.
R. Canetti, U. Feige, O. Goldreich, and M. Naor, “Adaptively Secure Multi-Party Computation”, STOC 96.
R. Canetti, E. Kushilevitz, R. Ostrovsky, and A. Rosén, “Randomness vs. Fault-Tolerance”, PODC 97.
D. Chaum, “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms”, Communication of the ACM, vol. 24, no. 2 (1981), pp. 84–88.
D. Chaum, C. Crépeau, and I. Damgård, “Multiparty Unconditionally Secure Protocols”, STOC 88.
D. Chaum, “The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability”, Journal of Cryptology, vol. 1 (1988), pp. 65–75.
D. Chaum, “Achieving Electronic Privacy”, Scientific American, vol. 267, no. 2 (1992), pp. 96–101.
M. Franklin, Z. Galil and M. Yung “Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems,” FOCS 93.
O. Goldreich, S. Micali and A. Wigderson, “How To Play Any Mental Game”, STOC 87.
J. Hastad, “Pseudo-Random Generators under Uniform Assumptions”, STOC 90.
R. Impagliazzo, L. Levin, and M. Luby “Pseudo-Random Generation from One-Way Functions,” STOC 89.
E. Kushilevitz, S. Micali, and R. Ostrovsky, “Reducibility and Completeness in Multi-Party Private Computations”, FOCS 94.
A. Pfitzmann, “How to Implement ISDNs Without User Observability — Some Remarks”, TR 14/85, Fakultat fur Informatik, Universitat Karlsruhe, 1985.
A. Pfitzmann, M. Waidner, “Network without User Observability,” Computer & Security 6 (1987) 158–166.
A. Pfitzmann, B. Pfitzmann and M. Waidner, “ISDN-MIXes — Untraceable Communication with Very Small Bandwidth Overhead,” Proc. Kommunikation in verteilten Systemen (1991), pp. 451–463.
P. F. Syverson, D. M. Goldsclag, M, G. Reed, “Anonymous Connections and Onion Routing” Proc. of the Symposium on Security and Privacy 1997.
M. Waidner and B. Pfitzmann, “The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability Eurocrypt 89.
C. Rackoff and D. Simon, “Cryptographic Defense Against Traffic Analysis”, STOC 93
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag
About this paper
Cite this paper
Dolev, S., Ostrovsky, R. (1997). Efficient anonymous multicast and reception. In: Kaliski, B.S. (eds) Advances in Cryptology — CRYPTO '97. CRYPTO 1997. Lecture Notes in Computer Science, vol 1294. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052251
Download citation
DOI: https://doi.org/10.1007/BFb0052251
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63384-6
Online ISBN: 978-3-540-69528-8
eBook Packages: Springer Book Archive