282 search results - page 26 / 57 » Optimal randomization for privacy preserving data mining |
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, wi...
AISADM
2007
Springer
14 years 1 months ago
2007
Springer
Peer-to-Peer (P2P) networks are gaining increasing popularity in many distributed applications such as file-sharing, network storage, web caching, searching and indexing of releva...
PERCOM
2011
ACM
12 years 11 months ago
2011
ACM
—In this work we study the problem of query privacy in large scale sensor networks. Motivated by a novel trust model in which clients query networks owned by trusted entities but...
PAISI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
FSKD
2008
Springer
13 years 8 months ago
2008
Springer
Preservation of privacy in micro-data release is a challenging task in data mining. The k-anonymity method has attracted much attention of researchers. Quasiidentifier is a key co...