TY - JOUR
T1 - Privacy-preserving disjunctive normal form operations on distributed sets
AU - Chun, Ji Young
AU - Hong, Dowon
AU - Jeong, Ik Rae
AU - Lee, Dong Hoon
N1 - Funding Information:
This work was partly supported by the IT R& D program of MKE/KEIT [KI002113, Development of Security Technology for Car-Healthcare], the IT R& D program of MKE, Korea [Development of Privacy Enhancing Cryptography on Ubiquitous Computing Environment], and Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology ( 2010-0024219 ).
PY - 2013/5/10
Y1 - 2013/5/10
N2 - Privacy-preserving set operations such as set union and set intersection on distributed sets are widely used in data mining in which the preservation of privacy is of the utmost concern. In this paper, we extended privacy-preserving set operations and considered privacy-preserving disjunctive normal form (DNF) operations on distributed sets. A privacy-preserving DNF operation on distributed sets can be used to find a set SF satisfying SF=(S1,1∩...∩S1,t2)∪...∪(S t1,1∩...∩St1,t2) without revealing any other information besides just the information which could be inferred from the DNF operations, where Si,j∈{A1,..., An,A1-,...,An-} and set Ak is known only to a party Pk. A complement set Ak- is defined as Ak-=(A1∪...∪An)-Ak. Using privacy-preserving DNF operations on distributed sets, it is possible to find set union, (threshold) set intersection, and a set of k-repeated elements.
AB - Privacy-preserving set operations such as set union and set intersection on distributed sets are widely used in data mining in which the preservation of privacy is of the utmost concern. In this paper, we extended privacy-preserving set operations and considered privacy-preserving disjunctive normal form (DNF) operations on distributed sets. A privacy-preserving DNF operation on distributed sets can be used to find a set SF satisfying SF=(S1,1∩...∩S1,t2)∪...∪(S t1,1∩...∩St1,t2) without revealing any other information besides just the information which could be inferred from the DNF operations, where Si,j∈{A1,..., An,A1-,...,An-} and set Ak is known only to a party Pk. A complement set Ak- is defined as Ak-=(A1∪...∪An)-Ak. Using privacy-preserving DNF operations on distributed sets, it is possible to find set union, (threshold) set intersection, and a set of k-repeated elements.
KW - DNF
KW - Set operation
KW - Set union
KW - Threshold set intersection
UR - http://www.scopus.com/inward/record.url?scp=84874118941&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2011.07.003
DO - 10.1016/j.ins.2011.07.003
M3 - Article
AN - SCOPUS:84874118941
SN - 0020-0255
VL - 231
SP - 113
EP - 122
JO - Information Sciences
JF - Information Sciences
ER -