Sciweavers

80 search results - page 15 / 16
» Constant-Round Private Database Queries
Sort
View
ICDE
2006
IEEE
165views Database» more  ICDE 2006»
14 years 9 days ago
Privacy Preserving Clustering on Horizontally Partitioned Data
Data mining has been a popular research area for more than a decade due to its vast spectrum of applications. The power of data mining tools to extract hidden information that can...
Ali Inan, Yücel Saygin, Erkay Savas, Ay&ccedi...
VLDB
2007
ACM
115views Database» more  VLDB 2007»
14 years 11 days ago
The Boundary Between Privacy and Utility in Data Publishing
We consider the privacy problem in data publishing: given a database instance containing sensitive information “anonymize” it to obtain a view such that, on one hand attackers...
Vibhor Rastogi, Sungho Hong, Dan Suciu
ICFP
2010
ACM
13 years 7 months ago
Distance makes the types grow stronger: a calculus for differential privacy
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
Jason Reed, Benjamin C. Pierce
ADC
2007
Springer
145views Database» more  ADC 2007»
14 years 14 days ago
The Privacy of k-NN Retrieval for Horizontal Partitioned Data -- New Methods and Applications
Recently, privacy issues have become important in clustering analysis, especially when data is horizontally partitioned over several parties. Associative queries are the core retr...
Artak Amirbekyan, Vladimir Estivill-Castro
ICMCS
2010
IEEE
146views Multimedia» more  ICMCS 2010»
13 years 7 months ago
Privacy-preserving approximation of L1 distance for multimedia applications
Alice and Bob possess sequences x and y respectively and would like to compute the 1 distance, namely x - y 1 under privacy and communication constraints. The privacy constraint r...
Shantanu Rane, Wei Sun, Anthony Vetro