Privacy-preserving two-party K-means clustering via secure approximation

Chunhua Su, Feng Bao, Jianying Zhou, Tsuyoshi Takagi, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

Abstract

K-means clustering is a powerful and frequently used technique in data mining. However, privacy breaching is a serious problem if the k-means clustering is used without any security treatment, while privacy is a real concern in many practical applications. Recently, four privacypreserving solutions based on cryptography have been proposed by different researchers. Unfortunately none of these four schemes can achieve both security and completeness with good efficiency. In this paper, we present a new scheme to overcome the problems occurred previously. Our scheme deals with data standardization in order to make the result more reasonable. We show that our scheme is secure and complete with good efficiency.

Original languageEnglish
Title of host publicationProceedings - 21st International Conference on Advanced Information Networking and ApplicationsWorkshops/Symposia, AINAW'07
Pages385-391
Number of pages7
DOIs
Publication statusPublished - Oct 18 2007
Event21st International Conference on Advanced Information Networking and ApplicationsWorkshops/Symposia, AINAW'07 - Niagara Falls, ON, Canada
Duration: May 21 2007May 23 2007

Publication series

NameProceedings - 21st International Conference on Advanced Information Networking and Applications Workshops/Symposia, AINAW'07
Volume2

Other

Other21st International Conference on Advanced Information Networking and ApplicationsWorkshops/Symposia, AINAW'07
CountryCanada
CityNiagara Falls, ON
Period5/21/075/23/07

Fingerprint

Privacy Preserving
K-means Clustering
Approximation
Standardization
Cryptography
Privacy
Data mining
Completeness
Data Mining

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Software
  • Mathematics(all)

Cite this

Su, C., Bao, F., Zhou, J., Takagi, T., & Sakurai, K. (2007). Privacy-preserving two-party K-means clustering via secure approximation. In Proceedings - 21st International Conference on Advanced Information Networking and ApplicationsWorkshops/Symposia, AINAW'07 (pp. 385-391). [4221090] (Proceedings - 21st International Conference on Advanced Information Networking and Applications Workshops/Symposia, AINAW'07; Vol. 2). https://doi.org/10.1109/AINAW.2007.295

Privacy-preserving two-party K-means clustering via secure approximation. / Su, Chunhua; Bao, Feng; Zhou, Jianying; Takagi, Tsuyoshi; Sakurai, Kouichi.

Proceedings - 21st International Conference on Advanced Information Networking and ApplicationsWorkshops/Symposia, AINAW'07. 2007. p. 385-391 4221090 (Proceedings - 21st International Conference on Advanced Information Networking and Applications Workshops/Symposia, AINAW'07; Vol. 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Su, C, Bao, F, Zhou, J, Takagi, T & Sakurai, K 2007, Privacy-preserving two-party K-means clustering via secure approximation. in Proceedings - 21st International Conference on Advanced Information Networking and ApplicationsWorkshops/Symposia, AINAW'07., 4221090, Proceedings - 21st International Conference on Advanced Information Networking and Applications Workshops/Symposia, AINAW'07, vol. 2, pp. 385-391, 21st International Conference on Advanced Information Networking and ApplicationsWorkshops/Symposia, AINAW'07, Niagara Falls, ON, Canada, 5/21/07. https://doi.org/10.1109/AINAW.2007.295
Su C, Bao F, Zhou J, Takagi T, Sakurai K. Privacy-preserving two-party K-means clustering via secure approximation. In Proceedings - 21st International Conference on Advanced Information Networking and ApplicationsWorkshops/Symposia, AINAW'07. 2007. p. 385-391. 4221090. (Proceedings - 21st International Conference on Advanced Information Networking and Applications Workshops/Symposia, AINAW'07). https://doi.org/10.1109/AINAW.2007.295
Su, Chunhua ; Bao, Feng ; Zhou, Jianying ; Takagi, Tsuyoshi ; Sakurai, Kouichi. / Privacy-preserving two-party K-means clustering via secure approximation. Proceedings - 21st International Conference on Advanced Information Networking and ApplicationsWorkshops/Symposia, AINAW'07. 2007. pp. 385-391 (Proceedings - 21st International Conference on Advanced Information Networking and Applications Workshops/Symposia, AINAW'07).
@inproceedings{0b0239c7830b43db92a212a1844ff9d1,
title = "Privacy-preserving two-party K-means clustering via secure approximation",
abstract = "K-means clustering is a powerful and frequently used technique in data mining. However, privacy breaching is a serious problem if the k-means clustering is used without any security treatment, while privacy is a real concern in many practical applications. Recently, four privacypreserving solutions based on cryptography have been proposed by different researchers. Unfortunately none of these four schemes can achieve both security and completeness with good efficiency. In this paper, we present a new scheme to overcome the problems occurred previously. Our scheme deals with data standardization in order to make the result more reasonable. We show that our scheme is secure and complete with good efficiency.",
author = "Chunhua Su and Feng Bao and Jianying Zhou and Tsuyoshi Takagi and Kouichi Sakurai",
year = "2007",
month = "10",
day = "18",
doi = "10.1109/AINAW.2007.295",
language = "English",
isbn = "0769528473",
series = "Proceedings - 21st International Conference on Advanced Information Networking and Applications Workshops/Symposia, AINAW'07",
pages = "385--391",
booktitle = "Proceedings - 21st International Conference on Advanced Information Networking and ApplicationsWorkshops/Symposia, AINAW'07",

}

TY - GEN

T1 - Privacy-preserving two-party K-means clustering via secure approximation

AU - Su, Chunhua

AU - Bao, Feng

AU - Zhou, Jianying

AU - Takagi, Tsuyoshi

AU - Sakurai, Kouichi

PY - 2007/10/18

Y1 - 2007/10/18

N2 - K-means clustering is a powerful and frequently used technique in data mining. However, privacy breaching is a serious problem if the k-means clustering is used without any security treatment, while privacy is a real concern in many practical applications. Recently, four privacypreserving solutions based on cryptography have been proposed by different researchers. Unfortunately none of these four schemes can achieve both security and completeness with good efficiency. In this paper, we present a new scheme to overcome the problems occurred previously. Our scheme deals with data standardization in order to make the result more reasonable. We show that our scheme is secure and complete with good efficiency.

AB - K-means clustering is a powerful and frequently used technique in data mining. However, privacy breaching is a serious problem if the k-means clustering is used without any security treatment, while privacy is a real concern in many practical applications. Recently, four privacypreserving solutions based on cryptography have been proposed by different researchers. Unfortunately none of these four schemes can achieve both security and completeness with good efficiency. In this paper, we present a new scheme to overcome the problems occurred previously. Our scheme deals with data standardization in order to make the result more reasonable. We show that our scheme is secure and complete with good efficiency.

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

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

U2 - 10.1109/AINAW.2007.295

DO - 10.1109/AINAW.2007.295

M3 - Conference contribution

AN - SCOPUS:35248856453

SN - 0769528473

SN - 9780769528472

T3 - Proceedings - 21st International Conference on Advanced Information Networking and Applications Workshops/Symposia, AINAW'07

SP - 385

EP - 391

BT - Proceedings - 21st International Conference on Advanced Information Networking and ApplicationsWorkshops/Symposia, AINAW'07

ER -