Privacy-preserving disjunctive normal form-operations on distributed sets
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chun, Ji Young | - |
dc.contributor.author | Hong, Dowon | - |
dc.contributor.author | Jeong, Ik Rae | - |
dc.contributor.author | Lee, Dong Hoon | - |
dc.date.accessioned | 2021-09-06T01:38:13Z | - |
dc.date.available | 2021-09-06T01:38:13Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2013-05-10 | - |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/103238 | - |
dc.description.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 S-F = (S-1,S-1 boolean AND ... boolean AND S-1,S-t2) boolean OR ... boolean OR (S-t1,S-1 boolean AND ... boolean AND S-t1,S-t2) without revealing any other information besides just the information which could be inferred from the DNF operations, where S-i,S-j is an element of {A(1), ..., An, (A(1)) over bar, ..., (A(n)) over bar} and set A(k) is known only to a party P-k. A complement set (A(k)) over bar is defined as (A(k)) over bar = (A(1) boolean OR ... boolean OR A(n)) - A(k). 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. (C) 2011 Elsevier Inc. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE INC | - |
dc.subject | EFFICIENT | - |
dc.subject | INTERSECTION | - |
dc.subject | PROTOCOLS | - |
dc.title | Privacy-preserving disjunctive normal form-operations on distributed sets | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Chun, Ji Young | - |
dc.contributor.affiliatedAuthor | Jeong, Ik Rae | - |
dc.contributor.affiliatedAuthor | Lee, Dong Hoon | - |
dc.identifier.doi | 10.1016/j.ins.2011.07.003 | - |
dc.identifier.scopusid | 2-s2.0-84874118941 | - |
dc.identifier.wosid | 000316836600009 | - |
dc.identifier.bibliographicCitation | INFORMATION SCIENCES, v.231, pp.113 - 122 | - |
dc.relation.isPartOf | INFORMATION SCIENCES | - |
dc.citation.title | INFORMATION SCIENCES | - |
dc.citation.volume | 231 | - |
dc.citation.startPage | 113 | - |
dc.citation.endPage | 122 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordPlus | EFFICIENT | - |
dc.subject.keywordPlus | INTERSECTION | - |
dc.subject.keywordPlus | PROTOCOLS | - |
dc.subject.keywordAuthor | Set operation | - |
dc.subject.keywordAuthor | DNF | - |
dc.subject.keywordAuthor | Set union | - |
dc.subject.keywordAuthor | Threshold set intersection | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.