Back to Results
First PageMeta Content
Network architecture / Routing / Cryptographic software / Onion routing / Tor / Static routing / Router / Proxy server / Adversary model / Computing / Internet privacy / Internet


Trust-based Anonymous Communication: Adversary Models and Routing Algorithms ∗ Aaron Johnson
Add to Reading List

Document Date: 2011-09-03 19:34:39


Open Document

File Size: 364,76 KB

Share Result on Facebook

City

Chicago / /

Company

Syverson U.S. Naval Research Laboratory / U.S. Naval Research Laboratory / Creative Commons / /

Country

United States / /

Currency

pence / /

/

Facility

U.S. Naval Research Laboratory / Aaron Johnson Paul Syverson U.S. Naval Research Laboratory / The University of Texas / /

IndustryTerm

real-world Internet / penultimate static router / communications network / adjacent routers / path algorithms / anonymous communication protocols / anonymity networks / few good routers / client software / web browsing / entry router / online activities / path-selection algorithm / reasonably-sized anonymity network / software runs / dynamic routers / onion routing systems / untrusted routers / private network / final router / straightforward algorithm / compromises router / downhill-trust algorithm / together routers / given router / onion-routing network / Onion routers / probabilistic protocol / model and algorithms / volunteer routers / anonymity network / few highly-trusted routers / adjacent router / onion routing anonymity protocols / anonymity protocols / uphill-trust algorithm / downhill-path algorithm / path-selection algorithms / public Internet communication / to many protocols / large networks / exit router / trusted router / trusted routers / last dynamic routers / public network / static router / trust algorithms / few bad routers / given algorithm / final static router / model systems / larger network / onion-routing networks / onion routing network / ith router / application-layer protocols / /

OperatingSystem

DoS / /

Organization

University of Texas at Austin / U.S. Government / Aaron Johnson Paul Syverson U.S. Naval Research Laboratory / Department of Computer Science / /

Person

Suppose / Roger Dingledine Nick Mathewson / Now / Aaron Johnson Paul / /

Position

guard / General / general public communication / contractor / entry guard / network and adversary model for anonymous communication / representative / /

ProgrammingLanguage

E / R / /

ProvinceOrState

Texas / Illinois / Arkansas / /

Technology

last dynamic routers / roughly 2500 volunteer routers / two routers / path algorithms / two dynamic routers / analyzing anonymity protocols / exit router / same router / compromises router / onion routing anonymity protocols / anonymity protocols / entry router / individual trust algorithms / straightforward algorithm / one-connection algorithm / ISP / uphill-trust algorithm / few good routers / routing algorithm / dynamic routers / static router / downhill-trust algorithm / ith router / anonymous communication protocols / adjacent router / Av / path-selection algorithm / few bad routers / last router / Onion routers / downhill-path algorithm / P2P / last / static router / application-layer protocols / path-selection algorithms / penultimate static router / 4.1.4 Analyzing The Downhill Algorithm / last two routers / final static router / given router / final router / connections The path-selection algorithm / given algorithm / dynamic router / HTTP / Simulation / probabilistic protocol / randomly choosing routers / Network Protocols / compromised router / /

SocialTag