Sciweavers

55 search results - page 1 / 11
» Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Op...
Sort
View
IH
1998
Springer
13 years 9 months ago
Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System
Abstract. Currently knownbasic anonymitytechniques dependon identity veri cation. If veri cation of user identities is not possible due to the related management overhead or a gene...
Dogan Kesdogan, Jan Egner, Roland Büschkes
CSFW
2003
IEEE
13 years 11 months ago
Anonymity and Information Hiding in Multiagent Systems
We provide a framework for reasoning about information-hiding requirements in multiagent systems and for reasoning about anonymity in particular. Our framework employs the modal l...
Joseph Y. Halpern, Kevin R. O'Neill
CCS
2010
ACM
13 years 5 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov
CSFW
2002
IEEE
13 years 10 months ago
Probabilistic Analysis of Anonymity
We present a formal analysis technique for probabilistic security properties of peer-to-peer communication systems based on random message routing among members. The behavior of g...
Vitaly Shmatikov
ICIW
2007
IEEE
13 years 12 months ago
An Open Tracing System for P2P File Sharing Systems
— This paper describes the Open P2P tracing system which aims to improve the research community’s understanding of P2P file sharing systems by providing continuous and up-todat...
Danny Hughes, James Walkerdine, Kevin Lee