Shlomi Dolev
Skip Abstract Section
Abstract
We examine the problem of efficient anonymous multicast and reception in general communication networks. We present algorithms that achieve anonymous communication, are protected against traffic analysis, and require O(1) amortized communication complexity on each link and low computational comlexity. The algorithms support sender anonymity, receiver(s) anonymity, or sender-receiver anonymity.
- BEN-OR, M., GOLDWASSER, S., AND WIGDERSON, A. 1988. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC '88, Chicago, IL, May 2-4), J. Simon, Chair. ACM Press, New York, NY, 1-10. Google Scholar
- BLUM,M.AND MICALI, S. 1984. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13, 4 (Nov.), 850-864. Google Scholar
- BOS,J.AND DEN BOER, B. 1990. Detection of disrupters in the DC protocol. In Proceedings of the Workshop on Advances in Cryptology (EUROCRYPT '89, Houthalen, Belgium, Apr. 10-13), J.-J. Quisquater and J. Vandewalle, Eds. Springer Lecture Notes in Computer Science. Springer-Verlag, New York, NY, 320-327. Google Scholar
- CANETTI, R., FEIGE, U., GOLDREICH, O., AND NAOR, M. 1996. Adaptively secure multi-party computation. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC '96, Philadelphia, PA, May 22-24), G. L. Miller, Chair. ACM Press, New York, NY, 639-648. Google Scholar
- CANETTI, R., KUSHILEVITZ, E., OSTROVSKY, R., AND ROS~N, A. 1997. Randomness vs. fault-tolerance. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC '97, Santa Barbara, CA, Aug. 21-24), J. E. Burns and H. Attiya, Chairs. ACM Press, New York, NY, 35-44. Google Scholar
- CHAUM, D. 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24, 2 (Feb.), 84-88. Google Scholar
- CHAUM, D. 1988. The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptology 1, 1 (), 65-75. Google Scholar
- CHAUM,D.AND DAMGARD, I. 1988. Multiparty unconditionally secure protocols. In Proceed-ings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC '88, Chicago, IL, May 2-4), J. Simon, Chair. ACM Press, New York, NY, 11-19. Google Scholar
- FRANKLIN, M., GALIL, Z., AND YUNG, M. 1993. Eavesdropping games: A graph-theoretic approach to privacy in distributed systems. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS '93). IEEE Computer Society Press, Los Alamitos, CA.Google Scholar
- GOLDREICH, O., MICALI, S., AND WIGDERSON, A. 1987. How to play ANY mental game. In Proceedings of the 19th Annual ACM Conference on Theory of Computing (STOC '87, New York, NY, May 25-27), A. V. Aho, Ed. ACM Press, New York, NY, 218-229. Google Scholar
- HASTAD, J., IMPAGLIAZZO, R., LEVIN,L.A.,AND LUBY, M. 1999. Construction of a pseudo-random generator from any one-way function. SIAM J. Comput. 28, 4, 1364-1396. Google Scholar
- KNUTH, D. E. 1997. The Art of Computer Programming. 3rd ed. Addison-Wesley, Reading, MA. Google Scholar
- KUSHILEVITZ, E., MICALI, S., AND OSTROVSKY, R. 1994. Reducibility and completeness in multi-party private computations. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (Nov.). IEEE Computer Society Press, Los Alamitos, CA.Google Scholar
- PFITZMANN, A. 1985. How to implement ISDNs without user observability: some remarks. Tech Rep. TR 14/85. University of Karlsruhe, Germany.Google Scholar
- PFITZMANN,A.AND WAIDNER, M. 1987. Networks without user observability. Comput. Secur. 6, 2 (Apr.), 158-166. Google Scholar
- PFITZMANN, A., PFITZMANN, B., AND WAIDNER, M. 1991. ISDN-mixes: Untraceable communica-tion with very small bandwidth overhead. In Proceedings of the GI/ITG Conference on Communication in Distributed Systems (Feb., Mannheim, Germany). 451-463. Google Scholar
- RACKOFF,C.AND SIMON, D. R. 1993. Cryptographic defense against traffic analysis. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC '93, San Diego, CA, May 16-18), R. Kosaraju, D. Johnson, and A. Aggarwal, Chairs. ACM Press, New York, NY, 672-681. Google Scholar
- SYVERSON,P.F.,GOLDSCHLAG,D.M.,AND REED, M. G. 1997. Anonymous connections and onion routing. In Proceedings of the 1997 IEEE Computer Society Symposium on Reasearch in Security and Privacy (Oakland, CA, May). IEEE Computer Society Press, Los Alamitos, CA. Google Scholar
- WAIDNER, M. 1990. Unconditional sender and recipient untraceability in spite of active attacks. In Proceedings of the Workshop on Advances in Cryptology (EUROCRYPT '89, Houthalen, Belgium, Apr. 10-13), J.-J. Quisquater and J. Vandewalle, Eds. Springer Lecture Notes in Computer Science. Springer-Verlag, New York, NY, 302-319. Google Scholar
- WAIDNER,M.AND PFITZMANN, B. 1990. The dining cryptographers in the disco: Unconditional sender and recipient untraceability with computationally secure serviceability. In Proceed-ings of the Workshop on Advances in Cryptology (EUROCRYPT '89, Houthalen, Belgium, Apr. 10-13), J.-J. Quisquater and J. Vandewalle, Eds. Springer Lecture Notes in Computer Science. Springer-Verlag, New York, NY, 690. Google Scholar
Index Terms
- Xor-trees for efficient anonymous multicast and reception
Recommendations
An efficient protocol for anonymous multicast and reception
In this paper, we shall propose a scheme for anonymous multicast and reception. Since the scheme can hide the identity of the receiver, we can resist the attack of traffic analysis. Besides that, we shall also extend our method to anonymous multicast. In ...
An efficient anonymous communication protocol for wireless sensor networks
Anonymous communication is very important for many wireless sensor networks, because it can be used to hide the identity of important nodes, such as the base station and a source node. In sensor networks, anonymous communication includes several ...
Comments