Scalable Privacy-Preserving t-Repetition Protocol with Distributed Medical Data
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chun, Ji Young | - |
dc.contributor.author | Hong, Dowon | - |
dc.contributor.author | Lee, Dong Hoon | - |
dc.contributor.author | Jeong, Ik Rae | - |
dc.date.accessioned | 2021-09-06T12:36:04Z | - |
dc.date.available | 2021-09-06T12:36:04Z | - |
dc.date.created | 2021-06-14 | - |
dc.date.issued | 2012-12 | - |
dc.identifier.issn | 0916-8508 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/106813 | - |
dc.description.abstract | Finding rare cases with medical data is important when hospitals or research institutes want to identify rare diseases. To extract meaningful information from a large amount of sensitive medical data, privacy-preserving data mining techniques can be used. A privacy-preserving t-repetition protocol can be used to find rare cases with distributed medical data. A privacy-preserving t-repetition protocol is to find elements which exactly t parties out of n parties have in common in their datasets without revealing their private datasets. A privacy-preserving t-repetition protocol can be used to find not only common cases with a high t but also rare cases with a low t. In 2011, Chun et al. suggested the generic set operation protocol which can be used to find t-repeated elements. In the paper, we first show that the Chun et al's protocol becomes infeasible for calculating t-repeated elements if the number of users is getting bigger. That is, the computational and communicational complexities of the Chun et al.'s protocol in calculating t-repeated elements grow exponentially as the number of users grows. Then, we suggest a polynomial-time protocol with respect to the number of users, which calculates t-repeated elements between users. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG | - |
dc.subject | SET | - |
dc.subject | INTERSECTION | - |
dc.title | Scalable Privacy-Preserving t-Repetition Protocol with Distributed Medical Data | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Chun, Ji Young | - |
dc.contributor.affiliatedAuthor | Jeong, Ik Rae | - |
dc.identifier.doi | 10.1587/transfun.E95.A.2451 | - |
dc.identifier.scopusid | 2-s2.0-84870498764 | - |
dc.identifier.wosid | 000313146100043 | - |
dc.identifier.bibliographicCitation | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, v.E95A, no.12, pp.2451 - 2460 | - |
dc.relation.isPartOf | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | - |
dc.citation.title | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | - |
dc.citation.volume | E95A | - |
dc.citation.number | 12 | - |
dc.citation.startPage | 2451 | - |
dc.citation.endPage | 2460 | - |
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.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.subject.keywordPlus | SET | - |
dc.subject.keywordPlus | INTERSECTION | - |
dc.subject.keywordAuthor | t-repetition | - |
dc.subject.keywordAuthor | rare cases | - |
dc.subject.keywordAuthor | set operation | - |
dc.subject.keywordAuthor | data mining | - |
dc.subject.keywordAuthor | privacy | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
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.