Sciweavers

112 search results - page 6 / 23
» A Combinatorial Approach to Measuring Anonymity
Sort
View
PVLDB
2008
146views more  PVLDB 2008»
13 years 6 months ago
Resisting structural re-identification in anonymized social networks
We identify privacy risks associated with releasing network data sets and provide an algorithm that mitigates those risks. A network consists of entities connected by links repres...
Michael Hay, Gerome Miklau, David Jensen, Donald F...
GIS
2009
ACM
13 years 5 months ago
Distortion-based anonymity for continuous queries in location-based mobile services
Privacy preservation has recently received considerable attention for location-based mobile services. Various location cloaking approaches have been proposed to protect the locati...
Xiao Pan, Xiaofeng Meng, Jianliang Xu
GECCO
2005
Springer
124views Optimization» more  GECCO 2005»
14 years 26 days ago
Generalized benchmark generation for dynamic combinatorial problems
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
Abdulnasser Younes, Paul H. Calamai, Otman A. Basi...
PET
2009
Springer
14 years 1 months ago
Scalable Link-Based Relay Selection for Anonymous Routing
The performance of an anonymous path can be described using many network metrics – e.g., bandwidth, latency, jitter, loss, etc. However, existing relay selection algorithms have ...
Micah Sherr, Matt Blaze, Boon Thau Loo
PAKDD
2009
ACM
134views Data Mining» more  PAKDD 2009»
14 years 4 months ago
On Link Privacy in Randomizing Social Networks.
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple ...
Xiaowei Ying, Xintao Wu