Output details
11 - Computer Science and Informatics
University of Oxford
Output title
A Practical Complexity-Theoretic Analysis of Mix Systems
Type
E - Conference contribution
Name of conference/published proceedings
(ESORICS ’11) Proceedings of the 16th European Conference on Research in Computer Security
Volume number
6879
Issue number
-
First page of article
508
ISSN of proceedings
0302-9743
Year of publication
2011
URL
-
Number of additional authors
2
Additional information
<19>
This work was published in ESORICS 2011, one of the highest-ranked security conferences internationally and the foremost in Europe, with an acceptance rate of 23%. The paper analyses a provably optimal attack against the Mix, a fundamental anonymity mechanism that nonetheless relies on solving an NP-complete problem. We analyse the average, rather than worst case, complexity of the attack to show that it is, in fact, feasible in many real-world scenarios, dependent on the parameters of the Mix. This approach provides a practical means both to analyse the strength of Mixes, and for the design of Mix-based systems.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
