Sciweavers

98 search results - page 2 / 20
» Achieving anonymity via clustering
Sort
View
ICDM
2006
IEEE
124views Data Mining» more  ICDM 2006»
13 years 11 months ago
Finding "Who Is Talking to Whom" in VoIP Networks via Progressive Stream Clustering
Technologies that use the Internet network to deliver voice communications have the potential to reduce costs and improve access to communications services around the world. Howev...
Olivier Verscheure, Michail Vlachos, Aris Anagnost...
ICDE
2007
IEEE
115views Database» more  ICDE 2007»
14 years 6 months ago
MultiRelational k-Anonymity
k-Anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous dataset, any identifying information occurs in at least k tuples. Much...
Mehmet Ercan Nergiz, Chris Clifton, A. Erhan Nergi...
APPROX
2008
Springer
101views Algorithms» more  APPROX 2008»
13 years 7 months ago
Streaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
Richard Matthew McCutchen, Samir Khuller
PET
2005
Springer
13 years 10 months ago
Message Splitting Against the Partial Adversary
We review threat models used in the evaluation of anonymity systems’ vulnerability to traffic analysis. We then suggest that, under the partial adversary model, if multiple packe...
Andrei Serjantov, Steven J. Murdoch
TDSC
2011
13 years 5 days ago
CASTLE: Continuously Anonymizing Data Streams
— Most of existing privacy preserving techniques, such as k-anonymity methods, are designed for static data sets. As such, they cannot be applied to streaming data which are cont...
Jianneng Cao, Barbara Carminati, Elena Ferrari, Ki...