Implementation and tests of clustering over vertically distributed data without sharing their values

Marcin Gorawski; Łukasz Słabiński

Implementation and tests of clustering over vertically distributed data without sharing their values

Marcin Gorawski
, Łukasz Słabiński

Department of Applied Informatics (RAU/RAU7)

Silesian University of Technology

Research output: Contribution to conference › Paper › peer-review

Abstract

This paper describes an experimental implementation of a secure distributed k-Clustering algorithm which applies the homomorphic encryption scheme for preserving privacy of data. We show in details technical aspects of the homomorphic encryption implementation and using it in a distributed application. The implementation enables us to evaluate experimentally the efficiency of the clustering algorithm, indicate its limitations and potential bottlenecks. Finally, we provide some conclusions and propose further work in this area.

Original language	English
Pages	41-50
Number of pages	10
Publication status	Published - 2006
Event	1st International Multiconference on Computer Science and Information Technology, IMCSIT 2006. Part of 22nd Autumn Meeting of Polish Information Processing Society, PIPS - Wisla, Poland Duration: 6 Nov 2006 → 10 Nov 2006

Conference

Conference	1st International Multiconference on Computer Science and Information Technology, IMCSIT 2006. Part of 22nd Autumn Meeting of Polish Information Processing Society, PIPS
Country/Territory	Poland
City	Wisla
Period	6/11/06 → 10/11/06

ASJC Scopus subject areas

Computer Science (miscellaneous)
Information Systems

Cite this

@conference{793f44f338a64a03a8f6a281b73b8f4f,

title = "Implementation and tests of clustering over vertically distributed data without sharing their values",

abstract = "This paper describes an experimental implementation of a secure distributed k-Clustering algorithm which applies the homomorphic encryption scheme for preserving privacy of data. We show in details technical aspects of the homomorphic encryption implementation and using it in a distributed application. The implementation enables us to evaluate experimentally the efficiency of the clustering algorithm, indicate its limitations and potential bottlenecks. Finally, we provide some conclusions and propose further work in this area.",

author = "Marcin Gorawski and {\L}ukasz S{\l}abi{\'n}ski",

year = "2006",

language = "English",

pages = "41--50",

note = "1st International Multiconference on Computer Science and Information Technology, IMCSIT 2006. Part of 22nd Autumn Meeting of Polish Information Processing Society, PIPS ; Conference date: 06-11-2006 Through 10-11-2006",

}

Gorawski, M & Słabiński, Ł 2006, 'Implementation and tests of clustering over vertically distributed data without sharing their values', Paper presented at 1st International Multiconference on Computer Science and Information Technology, IMCSIT 2006. Part of 22nd Autumn Meeting of Polish Information Processing Society, PIPS, Wisla, Poland, 6/11/06 - 10/11/06 pp. 41-50.

Implementation and tests of clustering over vertically distributed data without sharing their values. / Gorawski, Marcin; Słabiński, Łukasz.
2006. 41-50 Paper presented at 1st International Multiconference on Computer Science and Information Technology, IMCSIT 2006. Part of 22nd Autumn Meeting of Polish Information Processing Society, PIPS, Wisla, Poland.

Research output: Contribution to conference › Paper › peer-review

TY - CONF

T1 - Implementation and tests of clustering over vertically distributed data without sharing their values

AU - Gorawski, Marcin

AU - Słabiński, Łukasz

PY - 2006

Y1 - 2006

N2 - This paper describes an experimental implementation of a secure distributed k-Clustering algorithm which applies the homomorphic encryption scheme for preserving privacy of data. We show in details technical aspects of the homomorphic encryption implementation and using it in a distributed application. The implementation enables us to evaluate experimentally the efficiency of the clustering algorithm, indicate its limitations and potential bottlenecks. Finally, we provide some conclusions and propose further work in this area.

AB - This paper describes an experimental implementation of a secure distributed k-Clustering algorithm which applies the homomorphic encryption scheme for preserving privacy of data. We show in details technical aspects of the homomorphic encryption implementation and using it in a distributed application. The implementation enables us to evaluate experimentally the efficiency of the clustering algorithm, indicate its limitations and potential bottlenecks. Finally, we provide some conclusions and propose further work in this area.

UR - https://www.scopus.com/pages/publications/83755162747

M3 - Paper

AN - SCOPUS:83755162747

SP - 41

EP - 50

T2 - 1st International Multiconference on Computer Science and Information Technology, IMCSIT 2006. Part of 22nd Autumn Meeting of Polish Information Processing Society, PIPS

Y2 - 6 November 2006 through 10 November 2006

ER -

Implementation and tests of clustering over vertically distributed data without sharing their values

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this