Sciweavers

38 search results - page 2 / 8
» A Formalization of Anonymity and Onion Routing
Sort
View
CCS
2005
ACM
13 years 10 months ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...
CSFW
2012
IEEE
11 years 7 months ago
Provably Secure and Practical Onion Routing
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
Michael Backes, Ian Goldberg, Aniket Kate, Esfandi...
FC
2010
Springer
191views Cryptology» more  FC 2010»
13 years 8 months ago
Using Sphinx to Improve Onion Routing Circuit Construction
This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. We significantly compress the circuit constru...
Aniket Kate, Ian Goldberg
PET
2007
Springer
13 years 11 months ago
Pairing-Based Onion Routing
Abstract. This paper presents a novel use of pairing-based cryptography to improve circuit construction in onion routing anonymity networks. Instead of iteratively and interactivel...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg
ARESEC
2011
104views more  ARESEC 2011»
12 years 4 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