Privacy-preserving disjunctive normal form operations on distributed sets

Ji Young Chun; Dowon Hong; Ik Rae Jeong; Dong Hoon Lee

doi:10.1016/j.ins.2011.07.003

Privacy-preserving disjunctive normal form operations on distributed sets

Ji Young Chun
, Dowon Hong
, Ik Rae Jeong^*
, Dong Hoon Lee

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

21 Citations (Scopus)

Abstract

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 S_F satisfying ^SF=(S1_,1∩...∩S1,^t2)∪...∪(S ^t1,1∩...∩S^t1,^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 A_k is known only to a party P_k. 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.

Original language	English
Pages (from-to)	113-122
Number of pages	10
Journal	Information Sciences
Volume	231
DOIs	https://doi.org/10.1016/j.ins.2011.07.003
Publication status	Published - 2013 May 10

Bibliographical note

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 ).

Keywords

DNF
Set operation
Set union
Threshold set intersection

ASJC Scopus subject areas

Software
Control and Systems Engineering
Theoretical Computer Science
Computer Science Applications
Information Systems and Management
Artificial Intelligence

Access to Document

10.1016/j.ins.2011.07.003

Cite this

@article{ccbf1d741d64448ebc54dab0d0ad9fc5,

title = "Privacy-preserving disjunctive normal form operations on distributed sets",

abstract = "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.",

keywords = "DNF, Set operation, Set union, Threshold set intersection",

author = "Chun, \{Ji Young\} and Dowon Hong and Jeong, \{Ik Rae\} and Lee, \{Dong Hoon\}",

note = "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 ).",

year = "2013",

month = may,

day = "10",

doi = "10.1016/j.ins.2011.07.003",

language = "English",

volume = "231",

pages = "113--122",

journal = "Information Sciences",

issn = "0020-0255",

publisher = "Elsevier Inc.",

}

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 - https://www.scopus.com/pages/publications/84874118941

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 -

Privacy-preserving disjunctive normal form operations on distributed sets

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this