The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
How to break the direct RSA-implementation of mixes
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
On the complexity of dualization of monotone disjunctive normal forms
Journal of Algorithms
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Web MIXes: a system for anonymous and unobservable Internet access
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the First International Workshop on Information Hiding
Limits of Anonymity in Open Environments
IH '02 Revised Papers from the 5th 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)
Probabilistic Treatment of MIXes to Hamper Traffic Analysis
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Preserving privacy in a network of mobile computers
SP '95 Proceedings of the 1995 IEEE Symposium on Security and Privacy
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Privacy enhancing identity management: protection against re-identification and profiling
Proceedings of the 2005 workshop on Digital identity management
Does additional information always reduce anonymity?
Proceedings of the 2007 ACM workshop on Privacy in electronic society
C-Mix: A Lightweight Anonymous Routing Approach
Information Hiding
Lower bounds for three algorithms for transversal hypergraph generation
Discrete Applied Mathematics
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
Using Linkability Information to Attack Mix-Based Anonymity Services
PETS '09 Proceedings of the 9th International Symposium on Privacy Enhancing Technologies
Breaking Anonymity by Learning a Unique Minimum Hitting Set
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
The bayesian traffic analysis of mix networks
Proceedings of the 16th ACM conference on Computer and communications security
Two-sided statistical disclosure attack
PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies
Low-latency Mix Using Split and Merge Operations
Journal of Network and Systems Management
A practical complexity-theoretic analysis of mix systems
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Towards practical attacker classification for risk analysis in anonymous communication
CMS'06 Proceedings of the 10th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
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
You cannot hide for long: de-anonymization of real-world dynamic behaviour
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
| Hi-index | 0.01 |
A passive attacker can compromise a generic anonymity protocol by applying the so called disclosure attack, i.e. a special traffic analysis attack. In this work we present a more efficient way to accomplish this goal, i.e. we need less observations by looking for unique minimal hitting sets. We call this the hitting set attack or just HS-attack. In general, solving the minimal hitting set problem is NP-hard. Therefore, we use frequency analysis to enhance the applicability of our attack. It is possible to apply highly efficient backtracking search algorithms. We call this approach the statistical hitting set attack or SHS-attack. However, the statistical hitting set attack is prone to wrong solutions with a given small probability. We use here duality checking algorithms to resolve this problem. We call this final exact attack the HS*-attack.