Herbivore: A Scalable and Efficient Protocol for Anonymous Communication
作者： Emin Sirer , Mark Robson , Sharad Goel , Milo Polte
DOI:
关键词: Clique 、 Computer science 、 Communications system 、 Dining cryptographers problem 、 Anonymity 、 Computer network 、 Communication source 、 The Internet 、 Scalability 、 Distributed computing 、 Communications protocol
摘要: Anonymity is increasingly important for networked applications amidst concerns over censorship and privacy. In this paper, we describe Herbivore, a peer-to-peer, scalable, tamper-resilient communication system that provides provable anonymity Building on dining cryptographer networks, Herbivore scales by partitioning the network into anonymizing cliques. Adversaries able to monitor all traffic cannot deduce identity of sender or receiver beyond an clique. addition strong anonymity, simultaneously high efficiency scalability, distinguishing it from other anonymous protocols. Performance measurements prototype implementation show can achieve bandwidths low latencies when deployed Internet.
freehaven.net参考文章(16)
John R. Douceur, The Sybil Attack international workshop on peer to peer systems. pp. 251- 260 ,(2002) , 10.1007/3-540-45748-8_24
Michael Waidner, Birgit Pfitzmann, The dining cryptographers in the disco: unconditional sender and recipient untraceability with computationally secure serviceability theory and application of cryptographic techniques. pp. 690- 690 ,(1990) , 10.1007/3-540-46885-4_69
Andreas Pfitzmann, Michael Waidner, Networks without user observability—design options theory and application of cryptographic techniques. pp. 245- 253 ,(1986) , 10.1007/3-540-39805-8_29
R. Sherwood, B. Bhattacharjee, A. Srinivasan, P/sup 5/ : a protocol for scalable anonymous communication ieee symposium on security and privacy. pp. 58- 70 ,(2002) , 10.1109/SECPRI.2002.1004362
Michael K. Reiter, Aviel D. Rubin, Crowds: anonymity for Web transactions ACM Transactions on Information and System Security. ,vol. 1, pp. 66- 92 ,(1998) , 10.1145/290163.290168
Shlomi Dolev, Rafail Ostrobsky, Xor-trees for efficient anonymous multicast and reception ACM Transactions on Information and System Security. ,vol. 3, pp. 63- 84 ,(2000) , 10.1145/354876.354877
Clay Shields, Brian Neil Levine, A protocol for anonymous communication over the Internet computer and communications security. pp. 33- 42 ,(2000) , 10.1145/352600.352607
David L. Chaum, Untraceable electronic mail, return addresses, and digital pseudonyms Communications of The ACM. ,vol. 24, pp. 84- 90 ,(1981) , 10.1145/358549.358563
Petar Maymounkov, David Mazières, Kademlia: A Peer-to-Peer Information System Based on the XOR Metric international workshop on peer to peer systems. pp. 53- 65 ,(2002) , 10.1007/3-540-45748-8_5
P.F. Syverson, D.M. Goldschlag, M.G. Reed, Anonymous connections and onion routing ieee symposium on security and privacy. pp. 44- 54 ,(1997) , 10.1109/SECPRI.1997.601314