Sciweavers

1351 search results - page 60 / 271
» Trust in Anonymity Networks
Sort
View
PODC
1999
ACM
14 years 1 months ago
Computing Anonymously with Arbitrary Knowledge
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...
Paolo Boldi, Sebastiano Vigna
IJNSEC
2008
96views more  IJNSEC 2008»
13 years 8 months ago
On the Effectiveness of Continuous-Time Mixes under Flow-Correlation Based Anonymity Attacks
In flow-based mix networks, flow correlation attacks have been proposed earlier and have been shown empirically to seriously degrade mix-based anonymous communication systems. In ...
Ye Zhu, Xinwen Fu, Riccardo Bettati
IPL
2011
91views more  IPL 2011»
13 years 7 days ago
Fast leader election in anonymous rings with bounded expected delay
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
Rena Bakhshi, Jörg Endrullis, Wan Fokkink, Ju...
CCS
2005
ACM
14 years 2 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...
SIGCOMM
2003
ACM
14 years 2 months ago
A high-level programming environment for packet trace anonymization and transformation
Packet traces of operational Internet traffic are invaluable to network research, but public sharing of such traces is severely limited by the need to first remove all sensitive...
Ruoming Pang, Vern Paxson