Metrics for Security and Performance in Low-Latency Anonymity Systems

Murdoch, Steven J.; Watson, Robert N. M.

doi:10.1007/978-3-540-70630-4_8

Cited by 37 publications

(27 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We find two approaches to alleviate this problem: using local estimations to improve performance [4,5,152], or providing means for users to make better decisions about routing individually [144]. The latter is known to be prone to attacks [78,110].…”

Section: Cumbersome Managementmentioning

confidence: 99%

Systematizing Decentralization and Privacy: Lessons from 15 Years of Research and Deployments

Troncoso

Isaakidis

Danezis

et al. 2017

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

Decentralized systems are a subset of distributed systems where multiple authorities control different components and no authority is fully trusted by all. This implies that any component in a decentralized system is potentially adversarial. We revise fifteen years of research on decentralization and privacy, and provide an overview of key systems, as well as key insights for designers of future systems. We show that decentralized designs can enhance privacy, integrity, and availability but also require careful trade-offs in terms of system complexity, properties provided, and degree of decentralization. These trade-offs need to be understood and navigated by designers. We argue that a combination of insights from cryptography, distributed systems, and mechanism design, aligned with the development of adequate incentives, are necessary to build scalable and successful privacy-preserving decentralized systems.

show abstract

Section: Cumbersome Managementmentioning

confidence: 99%

Systematizing Decentralization and Privacy: Lessons from 15 Years of Research and Deployments

Troncoso

Isaakidis

Danezis

et al. 2017

Proceedings on Privacy Enhancing Technologies

View full text Add to dashboard Cite

show abstract

“…It is therefore advantageous to directly measure the probability that the user's security will be compromised, under the assumptions of the actual attackers' capabilities, rather than using proxies for this probability such as the various types of entropy. This is the approach used by Murdoch and Watson [5] to analyse the security of Tor directly, against an adversary who wishes to insert malicious nodes into the network so as to de-anonymize users. The goal of this analysis was to discover which of proposed schemes, for selecting Tor nodes in a circuit, is more secure.…”

Section: Low-latency Anonymous Communication Systemsmentioning

confidence: 99%

Quantifying and Measuring Anonymity

Murdoch

2014

Data Privacy Management and Autonomous Spontaneous Security

Self Cite

View full text Add to dashboard Cite

Abstract. The design of anonymous communication systems is a relatively new field, but the desire to quantify the security these systems offer has been an important topic of research since its beginning. In recent years, anonymous communication systems have evolved from obscure tools used by specialists to mass-market software used by millions of people. In many cases the users of these tools are depending on the anonymity offered to protect their liberty, or more. As such, it is of critical importance that not only can we quantify the anonymity these tools offer, but that the metrics used represent realistic expectations, can be communicated clearly, and the implementations actually offer the anonymity they promise. This paper will discuss how metrics, and the techniques used to measure them, have been developed for anonymous communication tools including low-latency networks and high-latency email systems.

show abstract

“…Snader and Borisov proposed in [30] the use of the Gini coefficient, as a way to measure inequalities in the circuit selection process of Tor. Murdoch and Watson propose in [31] to asses the bandwidth available to the adversary, and its effects to degrade the security of several path selection techniques.…”

Section: Related Workmentioning

confidence: 99%