Sciweavers

9 search results - page 2 / 2
» A Model of Onion Routing with Provable Anonymity
Sort
View
ARESEC
2011
104views more  ARESEC 2011»
12 years 5 months ago
An Inductive Approach to Provable Anonymity
—We formalise in a theorem prover the notion of provable anonymity proposed by Garcia et al. Our formalization relies on inductive definitions of message distinguish ability and...
Yongjian Li, Jun Pang
CSFW
2009
IEEE
14 years 4 days ago
More Anonymous Onion Routing Through Trust
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...
Aaron Johnson, Paul F. Syverson
CCS
2011
ACM
12 years 5 months ago
Trust-based anonymous communication: adversary models and routing algorithms
We introduce a novel model of routing security that incorporates the ordinarily overlooked variations in trust that users have for different parts of the network. We focus on ano...
Aaron Johnson, Paul F. Syverson, Roger Dingledine,...
PEWASUN
2004
ACM
13 years 10 months ago
A novel solution for achieving anonymity in wireless ad hoc networks
A mobile ad hoc network consists of mobile nodes that can move freely in an open environment. Communicating nodes in a wireless and mobile ad hoc network usually seek the help of ...
Azzedine Boukerche, Khalil El-Khatib, Li Xu, Larry...