Networks without user observability
Computers and Security
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
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
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
A protocol for anonymous communication over the Internet
Proceedings of the 7th ACM conference on Computer and communications security
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Password authentication with insecure communication
Communications of the ACM
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Practical byzantine fault tolerance and proactive recovery
ACM Transactions on Computer Systems (TOCS)
Tarzan: a peer-to-peer anonymizing network layer
Proceedings of the 9th ACM conference on Computer and communications security
ISDN-MIXes: Untraceable Communication with Small Bandwidth Overhead
Kommunikation in Verteilten Systemen, Grundlagen, Anwendungen, Betrieb, GI/ITG-Fachtagung
Traffic Analysis Attacks and Trade-Offs in Anonymity Providing Systems
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
SNDSS '96 Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS '96)
Mixminion: Design of a Type III Anonymous Remailer Protocol
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
k-anonymous message transmission
Proceedings of the 10th ACM conference on Computer and communications security
Proceedings of the 11th ACM conference on Computer and communications security
Scalable Supernode Selection in Peer-to-Peer Overlay Networks
HOT-P2P '05 Proceedings of the Second International Workshop on Hot Topics in Peer-to-Peer Systems
The design of a robust peer-to-peer system
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Almost optimal hash sequence traversal
FC'02 Proceedings of the 6th international conference on Financial cryptography
Provably secure public-key encryption for length-preserving chaumian mixes
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Anonymous connections and onion routing
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Anonymity is increasingly important for network applications concerning about censorship and privacy. The existing anonymous communication protocols generally stem from mixnet and DC-net. They either cannot provide provable anonymity or suffer from transmission collision. In this paper, we introduce a novel approach which takes advantage of hierarchical ring structure and mix technique. This proposed protocol is collision free and provides provable k-anonymity for both the sender and the recipient, even if a polynomial time adversary can eavesdrop all network traffic and control a fraction of participants. Furthermore, it can hide the sender and the recipient from each other and thus can be used for anonymous file sharing. The analysis shows the proposed protocol is secure against various attacks. Measurements further demonstrate it is practical.