Xor-trees for efficient anonymous multicast and reception

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.

[1]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[2]  Donald Ervin Knuth,et al.  The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information , 1978 .

[3]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[4]  Manuel Blum,et al.  How to Generate Cryptographically Strong Sequences of Pseudo Random Bits , 1982, FOCS.

[5]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[6]  Shafi Goldmer.  An Eflcient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information , 1985 .

[7]  Andreas Pfitzmann.  How to implement ISDNs without user observability---Someremarks , 1987, SGSC.

[8]  Andreas Pfitzmann,et al.  Networks without user observability , 1987, Comput. Secur..

[9]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[10]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[11]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.

[12]  Birgit Pfitzmann,et al.  The Dining Cryptographers in the Disco - Underconditional Sender and Recipient Untraceability with Computationally Secure Serviceability (Abstract) , 1990, EUROCRYPT.

[13]  Johan Hstad,et al.  Construction of a pseudo-random generator from any one-way function , 1989 .

[14]  Bert den Boer,et al.  Detection of Disrupters in the DC Protocol , 1990, EUROCRYPT.

[15]  Michael Waidner,et al.  Unconditional Sender and Recipient Untraceability in Spite of Active Attacks , 1990, EUROCRYPT.

[16]  Johan Håstad,et al.  Pseudo-random generators under uniform assumptions , 1990, STOC '90.

[17]  Birgit Pfitzmann,et al.  ISDN-MIXes: Untraceable Communication with Small Bandwidth Overhead , 1991, Kommunikation in Verteilten Systemen.

[18]  David Chaum,et al.  Achieving Electronic Privacy , 1992 .

[19]  Daniel R. Simon,et al.  Cryptographic defense against traffic analysis , 1993, STOC.

[20]  Matthew K. Franklin,et al.  Eavesdropping games: a graph-theoretic approach to privacy in distributed systems , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[21]  Rafail Ostrovsky,et al.  Reducibility and completeness in multi-party private computations , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[22]  Moni Naor,et al.  Adaptively secure multi-party computation , 1996, STOC '96.

[23]  Rafail Ostrovsky,et al.  Randomness vs. fault-tolerance , 1997, PODC '97.

[24]  Paul F. Syverson,et al.  Anonymous connections and onion routing , 1998, IEEE J. Sel. Areas Commun..

[25]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

[26]  Eavesdropping games: a graph-theoretic approach to privacy in distributed systems , 2000, JACM.

[27]  David Thomas,et al.  The Art in Computer Programming , 2001 .