Mix Cascades vs. Peer-to-Peer: Is One Concept Superior?
暂无分享,去创建一个
George Danezis | Rainer Böhme | Andreas Pfitzmann | Claudia Diaz | Stefan Kopsell | G. Danezis | Rainer Böhme | A. Pfitzmann | Claudia Díaz | Stefan Kopsell
[1] George Danezis,et al. Mixminion: design of a type III anonymous remailer protocol , 2003, 2003 Symposium on Security and Privacy, 2003..
[2] Robert Tappan Morris,et al. Tarzan: a peer-to-peer anonymizing network layer , 2002, CCS '02.
[3] Claudia Díaz,et al. Comparison Between Two Practical Mix Designs , 2004, ESORICS.
[4] George Danezis,et al. Towards an Information Theoretic Metric for Anonymity , 2002, Privacy Enhancing Technologies.
[5] Andreas Pfitzmann. Diensteintegrierende Kommunikationsnetze mit teilnehmerüberprüfbarem Datenschutz , 1990, Informatik-Fachberichte.
[6] David Chaum,et al. Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.
[7] Roger Dingledine,et al. Reliable MIX Cascade Networks through Reputation , 2002, Financial Cryptography.
[8] George Danezis. Mix-Networks with Restricted Routes , 2003, Privacy Enhancing Technologies.
[9] John R. Douceur,et al. The Sybil Attack , 2002, IPTPS.
[10] Dakshi Agrawal,et al. Limits of Anonymity in Open Environments , 2002, Information Hiding.
[11] Bart Preneel,et al. Reasoning About the Anonymity Provided by Pool Mixes That Generate Dummy Traffic , 2004, Information Hiding.
[12] Hannes Federrath,et al. Web MIXes: A System for Anonymous and Unobservable Internet Access , 2000, Workshop on Design Issues in Anonymity and Unobservability.
[13] Oliver Berthold,et al. Dummy Traffic against Long Term Intersection Attacks , 2002, Privacy Enhancing Technologies.
[14] Roger Dingledine,et al. A Reputation System to Increase MIX-Net Reliability , 2001, Information Hiding.
[15] David A. Farber,et al. Network security via dynamic process renaming , 1975 .
[16] Bart Preneel,et al. Towards Measuring Anonymity , 2002, Privacy Enhancing Technologies.
[17] David Chaum,et al. Security without identification: transaction systems to make big brother obsolete , 1985, CACM.
[18] Andreas Pfitzmann,et al. Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology , 2000, Workshop on Design Issues in Anonymity and Unobservability.
[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] Michael J. Freedman,et al. A peer-to-peer anonymizing network layer , 2002 .
[21] Anton Stiglic,et al. Traffic Analysis Attacks and Trade-Offs in Anonymity Providing Systems , 2001, Information Hiding.
[22] Nick Mathewson,et al. Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.
[23] Bernhard Plattner,et al. Practical Anonymity for the Masses with MorphMix , 2004, Financial Cryptography.
[24] Roger Dingledine,et al. From a Trickle to a Flood: Active Attacks on Several Mix Types , 2002, Information Hiding.
[25] G Danezis,et al. Statistical disclosure attacks: Traffic confirmation in open environments , 2003 .
[26] Markus Jakobsson,et al. Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking , 2002, USENIX Security Symposium.
[27] C. Andrew Neff,et al. A verifiable secret shuffle and its application to e-voting , 2001, CCS '01.
[28] Roger Dingledine,et al. On the Economics of Anonymity , 2003, Financial Cryptography.
[29] Vitaly Shmatikov,et al. Synchronous Batching: From Cascades to Free Routes , 2004, Privacy Enhancing Technologies.