A Model of Onion Routing With Provable Anonymity

Abstract

Onion routing is a scheme for anonymous communication that is designed for practical use. It has not been modeled formally, however, and therefore its anonymity guarantees have not been rigorously analyzed. 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 30, 2006
Accession Number
ADA459411

Entities

People

  • Aaron M. Johnson

Organizations

  • Yale University

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Anonymous Communications
  • Asymetric Encryption
  • Asynchronous Computation
  • Automata
  • Computer Science
  • Cryptography
  • Guarantees
  • Internet Routing
  • Notation
  • Permutations
  • Probability
  • Routing
  • Routing Protocols
  • Security Protocols
  • Sequences

Fields of Study

  • Computer science

Readers

  • Computer Networking
  • Mathematical Modeling and Probability Theory.