Sciweavers

661 search results - page 22 / 133
» Robustness Guarantees for Anonymity
Sort
View
OPODIS
2003
13 years 8 months ago
Multiple Agents RendezVous in a Ring in Spite of a Black Hole
The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study thi...
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe,...
SP
2008
IEEE
14 years 1 months ago
Robust De-anonymization of Large Sparse Datasets
We present a new class of statistical deanonymization attacks against high-dimensional micro-data, such as individual preferences, recommendations, transaction records and so on. ...
Arvind Narayanan, Vitaly Shmatikov
EDBT
2009
ACM
195views Database» more  EDBT 2009»
14 years 2 months ago
Anonymizing moving objects: how to hide a MOB in a crowd?
Moving object databases (MOD) have gained much interest in recent years due to the advances in mobile communications and positioning technologies. Study of MOD can reveal useful i...
Roman Yarovoy, Francesco Bonchi, Laks V. S. Lakshm...
ICC
2007
IEEE
14 years 1 months ago
Using Client Puzzles to Mitigate Distributed Denial of Service Attacks in the Tor Anonymous Routing Environment
— A novel client puzzle protocol, the Memoryless Puzzle Protocol (MPP), is proposed and investigated. The goal is to show that MPP is a viable solution for mitigating distributed...
Nicholas A. Fraser, Douglas J. Kelly, Richard A. R...
VLDB
2005
ACM
136views Database» more  VLDB 2005»
14 years 27 days ago
On k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
Charu C. Aggarwal