A Survey on Measuring Anonymity in Anonymous Communication Systems

The popularity of Internet applications has made communication privacy an increasingly important security requirement. As an important aspect of privacy, anonymity ensures that a subject may use resources or services without disclosing user identity or corresponding relationships. Since the seminal work by Chaum for anonymous communication, many different anonymous communication systems, and anonymous protocols have been developed and investigated extensively. In recent years, anonymous communication systems have evolved from academic tools used by specialists to mass-market software used by millions of ordinary people. How to evaluate and quantify the anonymity that different anonymous communication systems can offer has been a new focus. Though some efforts have been made on anonymity metrics and measuring techniques, systematic research on measuring anonymity of anonymous communication systems is still needed. In this paper, we give a comprehensive overview of state-of-the-art research on measuring anonymity. We first summarize the anonymous mechanisms applied by different anonymous systems. We then introduce the formalization of the notion of anonymity for measuring the anonymity degree. Further, metrics based on various theories and approaches are reviewed. We particularly elaborate on the metrics based on information theory as a separate section because of its popularity and multiple branches. The metrics based on information entropy is probably of the greatest interest.

[1]  Dogan Kesdogan,et al.  Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System , 1998, Information Hiding.

[2]  G. Tóth,et al.  Measuring Anonymity Revisited , 2004 .

[3]  Emin Gün Sirer,et al.  Herbivore: A Scalable and Efficient Protocol for Anonymous Communication , 2003 .

[4]  Brian Neil Levine,et al.  Forensic investigation of the OneSwarm anonymous filesharing system , 2011, CCS '11.

[5]  A. Juels,et al.  Universal Re-encryption for Mixnets , 2004, CT-RSA.

[6]  Konstantinos Chatzikokolakis,et al.  Spécification et vérification des protocoles de sécurité probabilistes. (Probabilistic and Information-Theoretic Approaches to Anonymity) , 2007 .

[7]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[8]  Joan Feigenbaum,et al.  Probabilistic analysis of onion routing in a black-box model , 2007, WPES '07.

[9]  Carmela Troncoso,et al.  Privacy Games Along Location Traces , 2016, ACM Trans. Priv. Secur..

[10]  Joan Feigenbaum,et al.  A Model of Onion Routing with Provable Anonymity , 2007, Financial Cryptography.

[11]  Simona Orzan,et al.  A Framework for Automatically Checking Anonymity with mu CRL , 2006, TGC.

[12]  Gene Tsudik,et al.  Mixing E-mail with Babel , 1996, Proceedings of Internet Society Symposium on Network and Distributed Systems Security.

[13]  Birgit Pfitzmann,et al.  Real-time mixes: a bandwidth-efficient anonymity protocol , 1998, IEEE J. Sel. Areas Commun..

[14]  Catuscia Palamidessi,et al.  Probabilistic Anonymity , 2005, CONCUR.

[15]  I. S. Moskowitz,et al.  Metrics for Traffic Analysis Prevention , 2003 .

[16]  Prateek Mittal,et al.  Information leaks in structured peer-to-peer anonymous communication systems , 2008, CCS.

[17]  Li Xiao,et al.  A design of overlay anonymous multicast protocol , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[18]  Parv Venkitasubramaniam,et al.  Admissible Length Study in Anonymous Networking: A Detection Theoretic Perspective , 2013, IEEE Journal on Selected Areas in Communications.

[19]  Ming Gu,et al.  USOR: An Unobservable Secure On-Demand Routing Protocol for Mobile Ad Hoc Networks , 2012, IEEE Transactions on Wireless Communications.

[20]  Prakash Panangaden,et al.  Probability of Error in Information-Hiding Protocols , 2007, 20th IEEE Computer Security Foundations Symposium (CSF'07).

[21]  Dijiang Huang On Measuring Anonymity For Wireless Mobile Ad-hoc Networks , 2006, Proceedings. 2006 31st IEEE Conference on Local Computer Networks.

[22]  Arthur P. Dempster,et al.  Upper and Lower Probabilities Induced by a Multivalued Mapping , 1967, Classic Works of the Dempster-Shafer Theory of Belief Functions.

[23]  Marie Elisabeth Gaup Moe Quantification of Anonymity for Mobile Ad Hoc Networks , 2009, Electron. Notes Theor. Comput. Sci..

[24]  Robert Tappan Morris,et al.  Tarzan: a peer-to-peer anonymizing network layer , 2002, CCS '02.

[25]  Aniket Kate,et al.  Ace: an efficient key-exchange protocol for onion routing , 2012, WPES '12.

[26]  Carmela Troncoso,et al.  Revisiting a combinatorial approach toward measuring anonymity , 2008, WPES '08.

[27]  George Danezis,et al.  HORNET: High-speed Onion Routing at the Network Layer , 2015, CCS.

[28]  Mauro Conti,et al.  Providing Source Location Privacy in Wireless Sensor Networks: A Survey , 2013, IEEE Communications Surveys & Tutorials.

[29]  Brian Neil Levine,et al.  A protocol for anonymous communication over the Internet , 2000, CCS.

[30]  George Danezis,et al.  Mixminion: design of a type III anonymous remailer protocol , 2003, 2003 Symposium on Security and Privacy, 2003..

[31]  Tony Q. S. Quek,et al.  Resilience of DoS Attacks in Designing Anonymous User Authentication Protocol for Wireless Sensor Networks , 2017, IEEE Sensors Journal.

[32]  L. Tennant Improving the Anonymity of the IOTA Cryptocurrency , 2017 .

[33]  Qiang Ni,et al.  A K-Anonymity Based Schema for Location Privacy Preservation , 2019, IEEE Transactions on Sustainable Computing.

[34]  Prateek Mittal,et al.  ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies , 2009, CCS.

[35]  Fikret Sivrikaya,et al.  A Combinatorial Approach to Measuring Anonymity , 2007, 2007 IEEE Intelligence and Security Informatics.

[36]  Paul F. Syverson,et al.  Anonymous connections and onion routing , 1997, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097).

[37]  Eric Wustrow,et al.  TapDance: End-to-Middle Anticensorship without Flow Blocking , 2014, USENIX Security Symposium.

[38]  Tom Chothia,et al.  Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus , 2006, FORTE.

[39]  Aravind Srinivasan,et al.  P/sup 5/ : a protocol for scalable anonymous communication , 2002, Proceedings 2002 IEEE Symposium on Security and Privacy.

[40]  Nicholas Hopper,et al.  Shadow: Running Tor in a Box for Accurate and Efficient Experimentation , 2011, NDSS.

[41]  Marek Klonowski,et al.  Onions Based on Universal Re-encryption - Anonymous Communication Immune Against Repetitive Attack , 2004, WISA.

[42]  Peter Palfrader,et al.  Mixmaster protocol --- version 2 , 2000 .

[43]  Ewa J. Infeld Symmetric Disclosure: a Fresh Look at k-anonymity , 2014, FOCI.

[44]  Bart Preneel,et al.  ARM: Anonymous Routing Protocol for Mobile Ad hoc Networks , 2006, 20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06).

[45]  Rong Li,et al.  An Accurate System-Wide Anonymity Metric for Probabilistic Attacks , 2011, PETS.

[46]  George Danezis,et al.  A Survey of Anonymous Communication Channels , 2008 .

[47]  Vitaly Shmatikov,et al.  Information Hiding, Anonymity and Privacy: a Modular Approach , 2004, J. Comput. Secur..

[48]  James Heather,et al.  Automated Analysis of Voting Systems under an Active Intruder Model in CSP , 2017, ArXiv.

[49]  Lang Tong,et al.  A Game-Theoretic Approach to Anonymous Networking , 2012, IEEE/ACM Transactions on Networking.

[50]  Angele M. Hamel,et al.  A Combinatorial Enumeration Approach For Measuring Anonymity , 2009 .

[51]  Ichiro Hasuo,et al.  Probabilistic anonymity via coalgebraic simulations , 2007, Theor. Comput. Sci..

[52]  Kim-Kwang Raymond Choo,et al.  An untraceable and anonymous password authentication protocol for heterogeneous wireless sensor networks , 2017, J. Netw. Comput. Appl..

[53]  G. Danezis Measuring anonymity : a few thoughts and a differentially private bound , 2013 .

[54]  Ian Goldberg,et al.  PCTCP: per-circuit TCP-over-IPsec transport for anonymous communication overlay networks , 2013, CCS.

[55]  Micah Sherr,et al.  A3: An Extensible Platform for Application-Aware Anonymity , 2010, NDSS.

[56]  Christopher Krügel,et al.  Practical Attacks against the I2P Network , 2013, RAID.

[57]  Ana Sokolova,et al.  Information Hiding in Probabilistic Concurrent Systems , 2010, 2010 Seventh International Conference on the Quantitative Evaluation of Systems.

[58]  Nathalie Weiler Secure anonymous group infrastructure for common and future Internet applications , 2001, Seventeenth Annual Computer Security Applications Conference.

[59]  Riccardo Bettati,et al.  An optimal strategy for anonymous communication protocols , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[60]  Yuguang Fang,et al.  MASK: anonymous on-demand routing in mobile ad hoc networks , 2006, IEEE Transactions on Wireless Communications.

[61]  Dijiang Huang Unlinkability Measure for IEEE 802.11 Based MANETs , 2008, IEEE Transactions on Wireless Communications.

[62]  Erik P. de Vink,et al.  A Formalization of Anonymity and Onion Routing , 2004, ESORICS.

[63]  Ian Goldberg,et al.  SkypeMorph: protocol obfuscation for Tor bridges , 2012, CCS.

[64]  Riccardo Bettati,et al.  A quantitative analysis of anonymous communications , 2004, IEEE Transactions on Reliability.

[65]  Bernhard Plattner,et al.  Introducing MorphMix: peer-to-peer based anonymous Internet usage with collusion detection , 2002, WPES '02.

[66]  Nicholas Hopper,et al.  k-anonymous message transmission , 2003, CCS '03.

[67]  C. Caballero-Gila,et al.  Providing k-anonymity and revocation in ubiquitous VANETs , .

[68]  Xiaoxin Wu,et al.  Achieving K-anonymity in mobile ad hoc networks , 2005, 1st IEEE ICNP Workshop on Secure Network Protocols, 2005. (NPSec)..

[69]  Carmela Troncoso Design and Analysis Methods for Privacy Technologies (Ontwerp- en analysemethodes van privacytechnologieën) , 2011 .

[70]  Qinghua Li,et al.  Achieving k-anonymity in privacy-aware location-based services , 2014, IEEE INFOCOM 2014 - IEEE Conference on Computer Communications.

[71]  Amir Herzberg,et al.  Anonymous RAM , 2016, ESORICS.

[72]  Ling Liu,et al.  Location Privacy in Mobile Systems: A Personalized Anonymization Model , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[73]  Ian Goldberg,et al.  Telex: Anticensorship in the Network Infrastructure , 2011, USENIX Security Symposium.

[74]  Nick Mathewson,et al.  Tor: The Second-Generation Onion Router , 2004, USENIX Security Symposium.

[75]  Panayiotis Kotzanikolaou,et al.  Broadcast anonymous routing (BAR): scalable real-time anonymous communication , 2017, International Journal of Information Security.

[76]  John Krumm,et al.  A survey of computational location privacy , 2009, Personal and Ubiquitous Computing.

[77]  Vinod Yegneswaran,et al.  StegoTorus: a camouflage proxy for the Tor anonymity system , 2012, CCS.

[78]  Max Mühlhäuser,et al.  AnonPubSub: Anonymous publish-subscribe overlays , 2016, Comput. Commun..

[79]  Paul F. Syverson,et al.  Group Principals and the Formalization of Anonymity , 1999, World Congress on Formal Methods.

[80]  Micah Adler,et al.  The predecessor attack: An analysis of a threat to anonymous communications systems , 2004, TSEC.

[81]  Michael K. Reiter,et al.  Crowds: anonymity for Web transactions , 1998, TSEC.

[83]  Micah Sherr,et al.  ExperimenTor: A Testbed for Safe and Realistic Tor Experimentation , 2011, CSET.

[84]  Dijiang Huang,et al.  Modeling Anonymous MANET Communications Using Super-Nodes , 2013, MILCOM 2013 - 2013 IEEE Military Communications Conference.

[85]  Peng Ning,et al.  A k-anonymous communication protocol for overlay networks , 2007, ASIACCS '07.

[86]  Krishna P. Gummadi,et al.  On Profile Linkability despite Anonymity in Social Media Systems , 2016, WPES@CCS.

[87]  Jürg Kohlas,et al.  A Mathematical Theory of Hints , 1995 .

[88]  W. Timothy Strayer,et al.  Decoy Routing: Toward Unblockable Internet Communication , 2011, FOCI.

[89]  Michael K. Reiter,et al.  M2: Multicasting Mixes for Efficient and Anonymous Communication , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

[90]  A. Pfitzmann,et al.  A terminology for talking about privacy by data minimization: Anonymity, Unlinkability, Undetectability, Unobservability, Pseudonymity, and Identity Management , 2010 .

[91]  Luke O'Connor,et al.  Entropy Bounds for Traffic Confirmation , 2008, IACR Cryptol. ePrint Arch..

[92]  Cynthia Dwork,et al.  Differential Privacy: A Survey of Results , 2008, TAMC.

[93]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[94]  Shaobo Zhang,et al.  A caching and spatial K-anonymity driven privacy enhancement scheme in continuous location-based services , 2019, Future Gener. Comput. Syst..

[95]  Nikita Borisov,et al.  Cirripede: circumvention infrastructure using router redirection with plausible deniability , 2011, CCS '11.

[96]  Ran Canetti,et al.  Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[97]  Zoltán Hornák,et al.  Measuring Anonymity in a Non-adaptive, Real-Time System , 2004, Privacy Enhancing Technologies.

[98]  Riccardo Bettati,et al.  Anonymity vs. Information Leakage in Anonymity Systems , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[99]  Jie Wu,et al.  Survey on anonymous communications in computer networks , 2010, Comput. Commun..

[100]  Steve A. Schneider,et al.  CSP and Anonymity , 1996, ESORICS.

[101]  Eiji Okamoto,et al.  Anonymous On-Demand Position-based Routing in Mobile Ad-hoc Networks , 2006 .

[102]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[103]  Denh Sy,et al.  ODAR: On-Demand Anonymous Routing in Ad Hoc Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[104]  Hassan Artail,et al.  A Pseudonym Management System to Achieve Anonymity in Vehicular Ad Hoc Networks , 2016, IEEE Transactions on Dependable and Secure Computing.

[105]  Bryan Ford,et al.  Dissent: Accountable Group Anonymity , 2010, CCS 2010.

[106]  Jun Pang,et al.  Weak Probabilistic Anonymity , 2007, Electron. Notes Theor. Comput. Sci..

[107]  Tom Chothia,et al.  Statistical Measurement of Information Leakage , 2010, TACAS.

[108]  H. W. Chan,et al.  MIX-Crowds, an Anonymity Scheme for File Retrieval Systems , 2009, IEEE INFOCOM 2009.

[109]  Radu Marculescu,et al.  Real-Time Anonymous Routing for Mobile Ad Hoc Networks , 2007, 2007 IEEE Wireless Communications and Networking Conference.

[110]  Mohan S. Kankanhalli,et al.  Anonymous secure routing in mobile ad-hoc networks , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[111]  J. Boyan DATA AND INFORMATION COLLECTION ON THE NET The Anonymizer Protecting User Privacy on the Web , 1997 .

[112]  Kaoru Kurosawa,et al.  Efficient Anonymous Channel and All/Nothing Election Scheme , 1994, EUROCRYPT.

[113]  Bart Preneel,et al.  Towards Measuring Anonymity , 2002, Privacy Enhancing Technologies.

[114]  Michael Backes,et al.  TUC: Time-Sensitive and Modular Analysis of Anonymous Communication , 2014, 2014 IEEE 27th Computer Security Foundations Symposium.

[115]  David Chaum,et al.  cMix: Mixing with Minimal Real-Time Asymmetric Cryptographic Operations , 2017, ACNS.

[116]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

[117]  Dan S. Wallach,et al.  AP3: cooperative, decentralized anonymous communication , 2004, EW 11.

[118]  Basel Alomair,et al.  Toward a Statistical Framework for Source Anonymity in Sensor Networks , 2013, IEEE Transactions on Mobile Computing.

[119]  Vitaly Shmatikov,et al.  Measuring relationship anonymity in mix networks , 2006, WPES '06.

[120]  Peter Y. A. Ryan,et al.  Modelling and analysis of security protocols , 2001 .

[121]  Carmela Troncoso,et al.  The bayesian traffic analysis of mix networks , 2009, CCS.

[122]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[123]  Aniket Kate,et al.  (Nothing else) MATor(s): Monitoring the Anonymity of Tor's Path Selection , 2014, IACR Cryptol. ePrint Arch..

[124]  Vitaly Shmatikov,et al.  Probabilistic analysis of anonymity , 2002, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15.

[125]  Michael Backes,et al.  A Survey on Routing in Anonymous Communication Protocols , 2016, ACM Comput. Surv..

[126]  Ronald L. Rivest,et al.  Marked Mix-Nets , 2017, Financial Cryptography Workshops.

[127]  Yunhao Liu,et al.  Mutual Anonymity for Mobile P2P Systems , 2008, IEEE Transactions on Parallel and Distributed Systems.

[128]  Dijiang Huang,et al.  Refining Traffic Information for Analysis Using Evidence Theory , 2014, 2014 IEEE Military Communications Conference.

[129]  A. Hamel The Mis-entropists : New Approaches to Measures in Tor , 2011 .

[130]  Sebastian Clauß,et al.  Structuring anonymity metrics , 2006, DIM '06.

[131]  Joseph Y. Halpern,et al.  Anonymity and information hiding in multiagent systems , 2003, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings..

[132]  Catuscia Palamidessi,et al.  Probable Innocence Revisited , 2005, Formal Aspects in Security and Trust.

[133]  Martin Schmiedecker,et al.  NavigaTor: Finding Faster Paths to Anonymity , 2016, 2016 IEEE European Symposium on Security and Privacy (EuroS&P).

[134]  A. Rényi On Measures of Entropy and Information , 1961 .

[135]  Steven J. Murdoch Quantifying and Measuring Anonymity , 2013, DPM/SETOP.

[136]  Jun Pang,et al.  Measuring Anonymity with Relative Entropy , 2006, Formal Aspects in Security and Trust.

[137]  C.E. Shannon,et al.  Communication in the Presence of Noise , 1949, Proceedings of the IRE.

[138]  Bharat K. Bhargava,et al.  AO2P: ad hoc on-demand position-based private routing protocol , 2005, IEEE Transactions on Mobile Computing.

[139]  Tianbo Lu,et al.  Some Remarks on Universal Re-encryption and A Novel Practical Anonymous Tunnel , 2005, ICCNMC.

[140]  Parv Venkitasubramaniam,et al.  Anonymity of Memory-Limited Chaum Mixes Under Timing Analysis: An Information Theoretic Perspective , 2015, IEEE Transactions on Information Theory.

[141]  Fan Yang,et al.  k-Anonymity Location Privacy Algorithm Based on Clustering , 2018, IEEE Access.

[142]  Mohsen Guizani,et al.  A survey on location privacy protection in Wireless Sensor Networks , 2019, J. Netw. Comput. Appl..

[143]  Bart Preneel,et al.  APES - Anonymity and Privacy in Electronic Services , 2003, Datenschutz und Datensicherheit.

[144]  Kaoru Sezaki,et al.  Towards Modeling Wireless Location Privacy , 2005, Privacy Enhancing Technologies.

[145]  Wolter Pieters,et al.  Provable anonymity , 2005, FMSE '05.

[146]  Hanpin Wang,et al.  Conditional anonymity with non-probabilistic adversary , 2015, Inf. Sci..

[147]  J. Bergstra,et al.  Measuring and predicting anonymity , 2012 .

[148]  Lang Tong,et al.  Throughput Anonymity Trade-off in Wireless Networks under Latency Constraints , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[149]  Jordi Forné,et al.  On the measurement of privacy as an attacker’s estimation error , 2012, International Journal of Information Security.

[150]  Stefan Köpsell,et al.  Modelling Unlinkability , 2003, Privacy Enhancing Technologies.

[151]  Ning Hu,et al.  A Hierarchical Anonymous Routing Scheme for Mobile Ad-Hoc Networks , 2006, MILCOM 2006 - 2006 IEEE Military Communications conference.

[152]  George Danezis,et al.  Towards an Information Theoretic Metric for Anonymity , 2002, Privacy Enhancing Technologies.

[153]  Barry E. Mullins,et al.  Exploring Extant and Emerging Issues in Anonymous Networks: A Taxonomy and Survey of Protocols and Metrics , 2012, IEEE Communications Surveys & Tutorials.

[154]  Chunhua Jin,et al.  Cost-Effective and Anonymous Access Control for Wireless Body Area Networks , 2018, IEEE Systems Journal.

[155]  Jordi Forné,et al.  Optimizing the design parameters of threshold pool mixes for anonymity and delay , 2014, Comput. Networks.

[156]  Xun Gong,et al.  CensorSpoofer: asymmetric communication using IP spoofing for censorship-resistant web browsing , 2012, CCS.

[157]  Xiaoyan Hong,et al.  ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks , 2003, MobiHoc '03.

[158]  Andreas Pfitzmann,et al.  The Disadvantages of Free MIX Routes and how to Overcome Them , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[159]  Carmela Troncoso,et al.  Unraveling an old cloak: k-anonymity for location privacy , 2010, WPES '10.

[160]  Nicholas Hopper,et al.  On the effectiveness of k;-anonymity against traffic analysis and surveillance , 2006, WPES '06.

[161]  Jan van Eijck,et al.  Epistemic Verification of Anonymity , 2007, VODCA@FOSAD.

[162]  Tianbo Lu,et al.  WonGoo: A Peer-to-Peer Protocol for Anonymous Communication , 2004, PDPTA.

[163]  Ian Goldberg,et al.  Provably Secure and Practical Onion Routing , 2012, 2012 IEEE 25th Computer Security Foundations Symposium.

[164]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[165]  George Danezis,et al.  The Loopix Anonymity System , 2017, USENIX Security Symposium.

[166]  Jian Shen,et al.  An Efficient and Certificateless Conditional Privacy-Preserving Authentication Scheme for Wireless Body Area Networks Big Data Services , 2018, IEEE Access.

[167]  Aniket Kate,et al.  AnoA: A Framework for Analyzing Anonymous Communication Protocols , 2013, 2013 IEEE 26th Computer Security Foundations Symposium.

[168]  Steve A. Schneider,et al.  Verifying anonymity in voting systems using CSP , 2012, Formal Aspects of Computing.

[169]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[170]  Chen Wang,et al.  RobLoP: Towards Robust Privacy Preserving Against Location Dependent Attacks in Continuous LBS Queries , 2018, IEEE/ACM Transactions on Networking.

[171]  Pedro Moreno-Sanchez,et al.  P2P Mixing and Unlinkable Bitcoin Transactions , 2017, NDSS.

[172]  David Wolinsky,et al.  Security Analysis of Accountable Anonymity in Dissent , 2014, TSEC.

[173]  Hannes Federrath,et al.  Web MIXes: A System for Anonymous and Unobservable Internet Access , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[174]  Dogan Kesdogan,et al.  Measuring Anonymity: The Disclosure Attack , 2003, IEEE Secur. Priv..

[175]  Yossi Matias,et al.  Consistent, yet anonymous, Web access with LPWA , 1999, CACM.

[176]  Vitaly Shmatikov,et al.  Probabilistic Model Checking of an Anonymity System , 2004 .