NDLI: Privacy-preserving LOF outlier detection

Content Provider	Springer Nature Link
Author	Li, Lu Huang, Liusheng Yang, Wei Yao, Xiaohui Liu, An
Copyright Year	2013
Abstract	LOF is a well-known approach for density-based outlier detection and has received much attention recently. It is important to design a privacy-preserving LOF outlier detection algorithm as the data on which LOF runs is typically spilt among multiple participants and no one is willing to disclose his sensitive information due to legal or moral considerations. This is, however, a hard problem since participants need to find the maximum one of the distances between an object and its k-Nearest Neighbors (k-NN) without learning the information of these objects. In this paper, we propose an efficient protocol for privacy-preserving LOF outlier detection. We first employ a shuffle protocol to permute the distance vectors owned by different participants. Then, we design a secure selection method to obtain the garbled k-NN indexes and shares of k-distance for given objects. For each object, we make use of the k-distance of all objects to construct a vector, based on which the permute protocol is executed again to obtain new shares of k-distance. Finally, the shares corresponding to the garbled k-NN indexes are selected as the expected result. Our protocol ensures that all the intermediates are shared between multiple participants and thus avoid information leaking. In addition, our protocol is efficient as we prove that the computation and communication complexity of our protocol is bounded by $$O(n^2)$$ .
Starting Page	579
Ending Page	597
Page Count	19
File Format	PDF
ISSN	02191377
Journal	Knowledge and Information Systems
Volume Number	42
Issue Number	3
e-ISSN	02193116
Language	English
Publisher	Springer London
Publisher Date	2013-09-29
Publisher Place	London
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Privacy-preserving LOF Data mining k-NN query Information Systems and Communication Service IT in Business
Content Type	Text
Resource Type	Article
Subject	Artificial Intelligence Information Systems Human-Computer Interaction Hardware and Architecture Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Privacy-preserving kernel k-means clustering outsourcing with random transformation

Random-data perturbation techniques and privacy-preserving data mining

Geometric data perturbation for privacy preserving outsourced data mining

Large-scale k-means clustering with user-centric privacy-preservation

A hybrid multi-group approach for privacy-preserving data mining

A differentially private algorithm for location data release

Practical protocol for Yao’s millionaires problem enables secure multi-party computation of metrics and efficient privacy-preserving k-NN for large data sets

Secure support vector machines outsourcing with random linear transformation

Privacy-preserving topic model for tagging recommender systems

Privacy-preserving LOF outlier detection

Similar Documents

Privacy-preserving kernel k-means clustering outsourcing with random transformation

Random-data perturbation techniques and privacy-preserving data mining

Geometric data perturbation for privacy preserving outsourced data mining

Large-scale k-means clustering with user-centric privacy-preservation

A hybrid multi-group approach for privacy-preserving data mining

A differentially private algorithm for location data release

Practical protocol for Yao’s millionaires problem enables secure multi-party computation of metrics and efficient privacy-preserving k-NN for large data sets

Secure support vector machines outsourcing with random linear transformation

Privacy-preserving topic model for tagging recommender systems

Privacy-preserving LOF outlier detection