How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Networks without user observability
Computers and Security
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Unconditional sender and recipient untraceability in spite of active attacks
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Detection of disrupters in the DC protocol
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Cryptographic defense against traffic analysis
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Randomness vs. fault-tolerance
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
ISDN-MIXes: Untraceable Communication with Small Bandwidth Overhead
Kommunikation in Verteilten Systemen, Grundlagen, Anwendungen, Betrieb, GI/ITG-Fachtagung
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
An efficient protocol for anonymous multicast and reception
Information Processing Letters
Mobile traffic sensor network versus motion-MIX: tracing and protecting mobile wireless nodes
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
On the effectiveness of k;-anonymity against traffic analysis and surveillance
Proceedings of the 5th ACM workshop on Privacy in electronic society
New bounds for randomized busing
Theoretical Computer Science
Anonymity Architecture for Mobile Agent Systems
HoloMAS '07 Proceedings of the 3rd international conference on Industrial Applications of Holonic and Multi-Agent Systems: Holonic and Multi-Agent Systems for Manufacturing
An Indistinguishability-Based Characterization of Anonymous Channels
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Privacy-conscious P2P data sharing scheme with bogus profile distribution
Web Intelligence and Agent Systems
Anonymous Transactions in Computer Networks
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Anonymity and Censorship Resistance in Unstructured Overlay Networks
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
Survey on anonymous communications in computer networks
Computer Communications
Trustable Relays for Anonymous Communication
Transactions on Data Privacy
Proceedings of the 2010 ACM Symposium on Applied Computing
Magnifying computing gaps: establishing encrypted communication over unidirectional channels
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Rendezvous tunnel for anonymous publishing
Proceedings of the 17th ACM conference on Computer and communications security
A framework for secure and private P2P publish/subscribe
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Trust-based anonymous communication: adversary models and routing algorithms
Proceedings of the 18th ACM conference on Computer and communications security
Rendezvous tunnel for anonymous publishing: clean slate and tor based designs
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Anonymous Communication Over Invisible Mix Rings
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
A survey of anonymous peer-to-peer file-sharing
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Anonymous transactions in computer networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
| Hi-index | 0.00 |
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.