Show simple item record

dc.contributor.authorAmirbekyan, Artak
dc.contributor.authorEstivill-Castro, Vladimir
dc.date.accessioned2017-05-03T14:16:00Z
dc.date.available2017-05-03T14:16:00Z
dc.date.issued2009
dc.date.modified2010-08-05T07:15:38Z
dc.identifier.issn0219-1377
dc.identifier.doi10.1007/s10115-009-0233-z
dc.identifier.urihttp://hdl.handle.net/10072/30120
dc.description.abstractFinding the nearest k objects to a query object is a fundamental operation for many data mining algorithms. With the recent interest in privacy, it is not surprising that there is strong interest in k-NN queries to enable clustering, classification and outlier-detection tasks. However, previous approaches to privacy-preserving k-NN have been costly and can only be realistically applied to small data sets. In this paper, we provide efficient solutions for k-NN queries for vertically partitioned data. We provide the first solution for the L(inf) (or Chessboard) metric as well as detailed privacy-preserving computation of all other Minkowski metrics. We enable privacy-preserving L(inf) by providing a practical approach to the Yao's millionaire problem with more than two parties. This is based on a pragmatic and implementable solution to Yao's millionaire problem with shares. We also provide privacy-preserving algorithms for combinations of local metrics into a global metric that handles the large dimensionality and diversity of attributes common in vertically partitioned data. To manage very large data sets, we provide a privacy-preserving SASH (a very successful data structure for associative queries in high dimensions). Besides providing a theoretical analysis, we illustrate the efficiency of our approach with an empirical evaluation.
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.languageEnglish
dc.language.isoeng
dc.publisherSpringer
dc.publisher.placeUnited Kingdom
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofpagefrom327
dc.relation.ispartofpageto363
dc.relation.ispartofissue3
dc.relation.ispartofjournalKnowledge and Information Systems
dc.relation.ispartofvolume21
dc.rights.retentionY
dc.subject.fieldofresearchDistributed computing and systems software not elsewhere classified
dc.subject.fieldofresearchInformation systems
dc.subject.fieldofresearchcode460699
dc.subject.fieldofresearchcode4609
dc.titlePractical protocol for Yao’s millionaires problem enables secure multi-party computation of metrics and efficient privacy-preserving k-NN for large data sets
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.facultyGriffith Sciences, School of Information and Communication Technology
gro.date.issued2009
gro.hasfulltextNo Full Text
gro.griffith.authorEstivill-Castro, Vladimir
gro.griffith.authorAmirbekyan, Artak


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record