Networks without user observability—design options
Proc. of a workshop on the theory and application of cryptographic techniques on Advances in cryptology---EUROCRYPT '85
The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
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
Protocols Using Anonymous Connections: Mobile Applications
Proceedings of the 5th International Workshop on Security Protocols
MIXes in Mobile Communication Systems: Location Management with Privacy
Proceedings of the First International Workshop on Information Hiding
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
SNDSS '96 Proceedings of the 1996 Symposium on Network and Distributed System Security (SNDSS '96)
Preserving privacy in a network of mobile computers
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
NON-DISCRETIONARY ACCESS CONTROL FOR DECENTRALIZED COMPUTING SYSTEMS
NON-DISCRETIONARY ACCESS CONTROL FOR DECENTRALIZED COMPUTING SYSTEMS
Anonymous connections and onion routing
IEEE Journal on Selected Areas in Communications
Real-time mixes: a bandwidth-efficient anonymity protocol
IEEE Journal on Selected Areas in Communications
Probabilistic Treatment of MIXes to Hamper Traffic Analysis
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Covert channels and anonymizing networks
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Privacy enhancing identity management: protection against re-identification and profiling
Proceedings of the 2005 workshop on Digital identity management
On the effectiveness of k;-anonymity against traffic analysis and surveillance
Proceedings of the 5th ACM workshop on Privacy in electronic society
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Probabilistic analysis of onion routing in a black-box model
Proceedings of the 2007 ACM workshop on Privacy in electronic society
Passive-Logging Attacks Against Anonymous Communications Systems
ACM Transactions on Information and System Security (TISSEC)
Perfect Matching Disclosure Attacks
PETS '08 Proceedings of the 8th international symposium on Privacy Enhancing Technologies
Information leaks in structured peer-to-peer anonymous communication systems
Proceedings of the 15th ACM conference on Computer and communications security
Privacy-enhancing methods for e-health applications: how to prevent statistical analyses and attacks
International Journal of Business Intelligence and Data Mining
A Combinatorial Approach for an Anonymity Metric
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
On anonymity in an electronic society: A survey of anonymous communication systems
ACM Computing Surveys (CSUR)
Vida: How to Use Bayesian Inference to De-anonymize Persistent Communications
PETS '09 Proceedings of the 9th International Symposium on Privacy Enhancing Technologies
The bayesian traffic analysis of mix networks
Proceedings of the 16th ACM conference on Computer and communications security
Hashing it out in public: common failure modes of DHT-based anonymity schemes
Proceedings of the 8th ACM workshop on Privacy in the electronic society
Deterring voluntary trace disclosure in re-encryption mix-networks
ACM Transactions on Information and System Security (TISSEC)
Attacking unlinkability: the importance of context
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Two-sided statistical disclosure attack
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Anonymity in the wild: mixes on unstructured networks
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Proceedings of the 17th ACM conference on Computer and communications security
Relations among privacy notions
ACM Transactions on Information and System Security (TISSEC)
Trust-based anonymous communication: adversary models and routing algorithms
Proceedings of the 18th ACM conference on Computer and communications security
Stealthy traffic analysis of low-latency anonymous communication using throughput fingerprinting
Proceedings of the 18th ACM conference on Computer and communications security
Statistical disclosure or intersection attacks on anonymity systems
IH'04 Proceedings of the 6th international conference on Information Hiding
The hitting set attack on anonymity protocols
IH'04 Proceedings of the 6th international conference on Information Hiding
Information Leaks in Structured Peer-to-Peer Anonymous Communication Systems
ACM Transactions on Information and System Security (TISSEC) - Special Issue on Computer and Communications Security
Practical traffic analysis: extending and resisting statistical disclosure
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
The traffic analysis of continuous-time mixes
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
On the PET workshop panel “mix cascades versus peer-to-peer: is one concept superior?”
PET'04 Proceedings of the 4th international conference on Privacy Enhancing Technologies
A formal treatment of onion routing
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Linking anonymous transactions: the consistent view attack
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
The effects of location access behavior on re-identification risk in a distributed environment
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Message splitting against the partial adversary
PET'05 Proceedings of the 5th international conference on Privacy Enhancing Technologies
Understanding statistical disclosure: a least squares approach
PETS'12 Proceedings of the 12th international conference on Privacy Enhancing Technologies
Probabilistic analysis of onion routing in a black-box model
ACM Transactions on Information and System Security (TISSEC)
Dissent in numbers: making strong anonymity scale
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
Countering statistical disclosure with receiver-bound cover traffic
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
The dangers of composing anonymous channels
IH'12 Proceedings of the 14th international conference on Information Hiding
Hang with your buddies to resist intersection attacks
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Proactively accountable anonymous messaging in verdict
SEC'13 Proceedings of the 22nd USENIX conference on Security
Crypto-Book: an architecture for privacy preserving online identities
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
| Hi-index | 0.00 |
A user is only anonymous within a set of other users. Hence, the core functionality of an anonymity providing technique is to establish an anonymity set. In open environments, such as the Internet, the established anonymity sets in the whole are observable and change with every anonymous communication. We use this fact of changing anonymity sets and present a model where we can determine the protection limit of an anonymity technique, i.e. the number of observations required for an attacker to "break" uniquely a given anonymity technique. In this paper, we use the popular MIX method to demonstrate our attack. The MIX method forms the basis of most of the today's deployments of anonymity services (e.g. Freedom, Onion Routing, Webmix). We note that our approach is general and can be applied equally well to other anonymity providing techiques.