Browse reports by year:
[ ALL 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 ]
Browse report authors:
[ ALL A B C D E F G H I J K L M N O P Q R S T U V W X Y Z ]
Browse reports by title:
[ ALL A B C D E F G H I J K L M N O P Q R S T U V W X Y Z ]

University of Minnesota - Computer Science and Engineering Technical Report Abstract

Privacy Preserving Nearest Neighbor Search

Report Number: 06-014
Date of Submission: 4/11/2006

Authors:
   
   
   

View Report:
   PDF format

Abstract:

Data mining is frequently obstructed by privacy concerns. In many cases, data is distributed and bringing the data together in one place for analysis is not possible due to privacy laws (e.g. HIPAA) or policies. Privacy preserving data mining techniques have been developed to address this issue by providing mechanisms to mine the data while giving certain privacy guarantees. In this paper we address the issue of privacy preserving nearest neighbor search, which forms the kernel of many data mining applications. To this end, we present a novel algorithm based on secure multiparty computation primitives to compute the nearest neighbors of records in horizontally distributed data. We show how this algorithm can be used in three important data mining algorithms, namely LOF outlier detection, SNN clustering, and kNN classification. We prove the security of these algorithms under the semi-honest adversarial model, and describe methods that can be used to optimize their performance.