A secure distributed framework for achieving k-anonymity

被引:89
作者
Jiang, Wei [1 ]
Clifton, Chris [1 ]
机构
[1] Purdue Univ, W Lafayette, IN 47907 USA
关键词
k-anonymity; privacy; security;
D O I
10.1007/s00778-006-0008-z
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
k-anonymity provides a measure of privacy protection by preventing re-identification of data to fewer than a group of k data items. While algorithms exist for producing k-anonymous data, the model has been that of a single source wanting to publish data. Due to privacy issues, it is common that data from different sites cannot be shared directly. Therefore, this paper presents a two-party framework along with an application that generates k-anonymous data from two vertically partitioned sources without disclosing data from one site to the other. The framework is privacy preserving in the sense that it satisfies the secure definition commonly defined in the literature of Secure Multiparty Computation.
引用
收藏
页码:316 / 333
页数:18
相关论文
共 36 条
[1]  
AGRAWAL R, 2003, P ACM SIGMOD INT C M, DOI DOI 10.1145/872757.872771
[2]  
[Anonymous], 2000, Privacy-preserving data mining, DOI DOI 10.1145/342009.335438
[3]  
[Anonymous], 1996, 3 INT SEM STAT CONF
[4]  
[Anonymous], ACM C COMPUTER COMMU, DOI [DOI 10.1145/288090.288106, DOI 10.1145/2046707.2046742]
[5]  
BAYARDO RJ, 2005, P IEEE INT C DAT ENG
[6]  
BENALOH JC, 1987, LECT NOTES COMPUT SC, V263, P251
[7]  
Blake C.L., 1998, UCI repository of machine learning databases
[8]   A fair and efficient solution to the socialist millionaires' problem [J].
Boudot, F ;
Schoenmakers, B ;
Traoré, J .
DISCRETE APPLIED MATHEMATICS, 2001, 111 (1-2) :23-36
[9]  
Dobkin D., 1979, ACM Transactions on Database Systems, V4, P97, DOI 10.1145/320064.320068
[10]  
Fischlin M, 2001, LECT NOTES COMPUT SC, V2020, P457