Abstract
Onion routing is a scheme for anonymous communication that is designed for practical use. Until now, however, it has had no formal model and therefore no rigorous analysis of its anonymity guarantees. We give an IO-automata model of an onion-routing protocol and, under possibilistic definitions, characterize the situations in which anonymity and unlinkability are guaranteed. © IFCA/Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Feigenbaum, J., Johnson, A., & Syverson, P. (2007). A model of onion routing with provable anonymity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4886 LNCS, pp. 57–71). Springer Verlag. https://doi.org/10.1007/978-3-540-77366-5_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
