PRIVACY-PRESERVING CLUSTERING USING REPRESENTATIVES OVER ARBITRARILY PARTITIONED DATA

Abstract

The challenge in privacy-preserving data mining is avoiding the invasion of personal data privacy. Secure computa- tion provides a solution to this problem. With the development of this technique, fully homomorphic encryption has been realized after decades of research; this encryption enables the computing and obtaining results via encrypted data without accessing any plaintext or private key information. In this paper, we propose a privacy-preserving clustering using representatives (CURE) algorithm over arbitrarily partitioned data using fully homomor- phic encryption. Our privacy-preserving CURE algorithm allows cooperative computation without revealing users’ individual data. The method used in our algorithm enables the data to be arbitrarily distributed among different parties and to receive accurate clustering result simultaneously.

Authors and Affiliations

Yu Li, Sheng Zhong

Keywords

Related Articles

Design of Socket Based on Intelligent Control and Energy Management

Smart home is one of the main applications of internet of things, and it will realize the intellectualization of household. Smart socket is part of the smart home, which can be controlled remotely by power supplied, moni...

Static Filtered Sky Color Constancy

In Computer Vision, the sky color is used for lighting correction, image color enhancement, horizon alignment, image indexing, and outdoor image classification and in many other applications. In this article, for robust...

Implementation of Binary Search Trees Via Smart Pointers

Study of binary trees has prominent place in the training course of DSA (Data Structures and Algorithms). Their implementation in C++ however is traditionally difficult for students. To a large extent these difficulties...

A Novel Approach for Ontology-Driven Information Retrieving Chatbot for Fashion Brands

Chatbots or conversational agents are the most projecting and widely employed artificial assistants on online social media. These bots converse with the humans in audio, visual, or textual formats. It is quite intelligib...

Experimental Evaluation of Security Requirements Engineering Benefits

Security Requirements Engineering (SRE) approaches are designed to improve information system security by thinking about security requirements at the beginning of the software development lifecycle. This paper is a quant...

Download PDF file
  • EP ID EP162029
  • DOI 10.14569/IJACSA.2013.040932
  • Views 72
  • Downloads 0

How To Cite

Yu Li, Sheng Zhong (2013). PRIVACY-PRESERVING CLUSTERING USING REPRESENTATIVES OVER ARBITRARILY PARTITIONED DATA. International Journal of Advanced Computer Science & Applications, 4(9), 207-212. https://europub.co.uk/articles/-A-162029