Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

FC
2007
Springer

favoriteEmaildiscussreport

148views Cryptology» more FC 2007»

A Model of Onion Routing with Provable Anonymity

13 years 10 months ago

A Model of Onion Routing with Provable Anonymity

Download www.cs.yale.edu

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 deﬁnitions, characterize the situations in which anonymity and unlinkability are guaranteed.

Joan Feigenbaum, Aaron Johnson, Paul F. Syverson

Real-time Traffic

Anonymity Guarantees | Anonymous Communication | FC 2007 | Onion Routing |

claim paper

Related Content

» Provably Secure and Practical Onion Routing

» Provable anonymity

» Towards an Analysis of Onion Routing Security

» IPLess Stochastic Anonymous Routing Algorithm Using MultiAgent Systems

» An Inductive Approach to Provable Anonymity

» More Anonymous Onion Routing Through Trust

» Trustbased anonymous communication adversary models and routing algorithms

» A novel solution for achieving anonymity in wireless ad hoc networks

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	FC
Authors	Joan Feigenbaum, Aaron Johnson, Paul F. Syverson

Comments (0)