Efficient anonymous multicast and reception

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

Volumn 1294, Issue , 1997, Pages 395-409

  Dolev, Shlomi ^a   Ostrovsky, Rafail ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; POLYNOMIALS;

ANONYMOUS BROADCAST; ANONYMOUS COMMUNICATION; COMMUNICATION COMPLEXITY; LOW COMPUTATIONAL COMPLEXITY; SECURITY PARAMETERS;

COMPLEX NETWORKS;

EID: 84937578372     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0052251     Document Type: Conference Paper

References (20)

1. M. Blum and S. Goldwassei, "An efficient probabilistic public-key encryption scheme which hides all partial information", CRYPTO 84
2. 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.
3. M. Ben-or, S. Goldwasser, and A. Wigderson, "Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation", STOC 88.
4. R. Canetti, U. Feige, O. Goldreich, and M. Naor, "Adaptively Secure Multi-Party Computation", STOC 96.
5. R. Canetti, E. Kushilevitz, R. Ostrovsky, and A. Rosen, "Randomness vs. Fault-Tolerance", PODC 97.
6. D. Chaum, "Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms", Communication of the ACM, vol. 24, no. 2 (1981), pp. 84-88.
7. D. Chaum, C. Crepeau, and I. Damgard, "Multiparty Unconditionally Secure Protocols", STOC 88.
8. D. Chaum, "The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability", Journal of Cryptology, vol. 1 (1988), pp. 65-75.
9. D. Chaum, "Achieving Electronic Privacy", Scientific American, vol. 267, no. 2 (1992), pp. 96-101.
10. M. Franklin, Z. Galil and M. Yung "Eavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems," FOCS 93.
11. O. Goldreich, S. Micali and A. Wigderson, "How To Play Any Mental Game", STOC 87.
12. J. Hastad, "Pseudo-Random Generators under Uniform Assumptions", STOC 90.
13. R. Impagliazzo, L. Levin, and M. Luby "Pseudo-Random Generation from OneWay Functions," STOC 89.
14. E. Kushilevitz, S. Micali, and R. Ostrovsky, "Reducibility and Completeness in Multi-Party Private Computations", FOCS 94.
15. A. Pfitzmann, "How to Implement ISDNs Without User Observability — Some Remarks", TR 14/85, Fakultat fur Informatik, Universitat Karlsruhe, 1985.
16. A. Pfitzmann, M. Waidner, "Network without User Observability," Computer & Security 6 (1987) 158-166.
17. 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.
18. P. F. Syverson, D. M. Goldsclag, M. G. Reed, "Anonymous Connections and Onion Routing" Proc. of the Symposium on Security and Privacy 1997.
19. M. Waidner and B. Pfitzmann, "The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability Eurocrypt 89.
20. C. Rackoff and D. Simon, "Cryptographic Defense Against Traffic Analysis", STOC 93