P/sup 5/ : a protocol for scalable anonymous communication
暂无分享,去创建一个
Aravind Srinivasan | Rob Sherwood | Bobby Bhattacharjee | Rob Sherwood | A. Srinivasan | Bobby Bhattacharjee
[1] Michael K. Reiter,et al. Crowds: anonymity for Web transactions , 1998, TSEC.
[2] Brian Neil Levine,et al. Responder anonymity and anonymous peer-to-peer file sharing , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.
[3] Micah Adler,et al. An Analysis of the Degradation of Anonymous Protocols , 2002, NDSS.
[4] Birgit Pfitzmann,et al. Real-time mixes: a bandwidth-efficient anonymity protocol , 1998, IEEE J. Sel. Areas Commun..
[5] Vince Fuller,et al. Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy , 1993, RFC.
[6] P. A. Karger. NON-DISCRETIONARY ACCESS CONTROL FOR DECENTRALIZED COMPUTING SYSTEMS , 1977 .
[7] Paul Syverson,et al. Onion Routing for Anonymous and Private Internet Connections , 1999 .
[8] Paul F. Syverson,et al. Onion routing , 1999, CACM.
[9] Daniel A. Spielman,et al. Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.
[10] Aravind Srinivasan,et al. P/sup 5/ : a protocol for scalable anonymous communication , 2002, Proceedings 2002 IEEE Symposium on Security and Privacy.
[11] Robert Tappan Morris,et al. Introducing Tarzan, a Peer-to-Peer Anonymizing Network Layer , 2002, IPTPS.
[12] David Chaum,et al. Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.
[13] George Danezis,et al. Mixminion: design of a type III anonymous remailer protocol , 2003, 2003 Symposium on Security and Privacy, 2003..
[14] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[15] Brian Neil Levine,et al. A protocol for anonymous communication over the Internet , 2000, CCS.
[16] Birgit Pfitzmann,et al. The Dining Cryptographers in the Disco - Underconditional Sender and Recipient Untraceability with Computationally Secure Serviceability (Abstract) , 1990, EUROCRYPT.
[17] I. Reed,et al. Polynomial Codes Over Certain Finite Fields , 1960 .
[18] David Chaum,et al. The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.
[19] Andreas Pfitzmann,et al. The Disadvantages of Free MIX Routes and how to Overcome Them , 2000, Workshop on Design Issues in Anonymity and Unobservability.
[20] H. Chernoff. A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .