Scalable privacy-preserving t-repetition protocol with distributed medical data

Ji Young Chun, Dowon Hong, Dong Hoon Lee, ik rae Jeong

Research output: Contribution to journalArticle

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 privacypreserving 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 trepetition 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.

Original languageEnglish
Pages (from-to)2451-2460
Number of pages10
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE95-A
Issue number12
DOIs
Publication statusPublished - 2012 Dec 1

Fingerprint

Privacy Preserving
Data privacy
Data mining
Polynomials
Privacy Preserving Data Mining
Repetition
Polynomial time
Calculate

Keywords

  • Data mining
  • Privacy
  • Rare cases
  • Set operation
  • T-repetition

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics
  • Signal Processing

Cite this

Scalable privacy-preserving t-repetition protocol with distributed medical data. / Chun, Ji Young; Hong, Dowon; Lee, Dong Hoon; Jeong, ik rae.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E95-A, No. 12, 01.12.2012, p. 2451-2460.

Research output: Contribution to journalArticle

@article{5bfbe7ad85a541739b4d211cb0090518,
title = "Scalable privacy-preserving t-repetition protocol with distributed medical data",
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 privacypreserving 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 trepetition 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.",
keywords = "Data mining, Privacy, Rare cases, Set operation, T-repetition",
author = "Chun, {Ji Young} and Dowon Hong and Lee, {Dong Hoon} and Jeong, {ik rae}",
year = "2012",
month = "12",
day = "1",
doi = "10.1587/transfun.E95.A.2451",
language = "English",
volume = "E95-A",
pages = "2451--2460",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "12",

}

TY - JOUR

T1 - Scalable privacy-preserving t-repetition protocol with distributed medical data

AU - Chun, Ji Young

AU - Hong, Dowon

AU - Lee, Dong Hoon

AU - Jeong, ik rae

PY - 2012/12/1

Y1 - 2012/12/1

N2 - 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 privacypreserving 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 trepetition 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.

AB - 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 privacypreserving 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 trepetition 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.

KW - Data mining

KW - Privacy

KW - Rare cases

KW - Set operation

KW - T-repetition

UR - http://www.scopus.com/inward/record.url?scp=84870498764&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84870498764&partnerID=8YFLogxK

U2 - 10.1587/transfun.E95.A.2451

DO - 10.1587/transfun.E95.A.2451

M3 - Article

AN - SCOPUS:84870498764

VL - E95-A

SP - 2451

EP - 2460

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 12

ER -