Secure and Efficient Approximate Nearest Neighbors Search - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Secure and Efficient Approximate Nearest Neighbors Search

Benjamin Mathon
Teddy Furon
Laurent Amsaleg
Julien Bringer
  • Function : Author
  • PersonId : 940641

Abstract

This paper presents a moderately secure but very efficient approximate nearest neighbors search. After detailing the threats pertaining to the "honest but curious" model, our approach starts from a state-of-the-art algorithm in the domain of approximate nearest neighbors search. We gradually develop mechanisms partially blocking the attacks threatening the original algorithm. The loss of performances compared to the original algorithm is mainly an overhead of a constant computation time and communication payload which are independent of the size of the database.
Fichier principal
Vignette du fichier
paper.pdf (379.56 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00817336 , version 1 (24-04-2013)
hal-00817336 , version 2 (27-06-2013)

Identifiers

Cite

Benjamin Mathon, Teddy Furon, Laurent Amsaleg, Julien Bringer. Secure and Efficient Approximate Nearest Neighbors Search. 1st ACM Workshop on Information Hiding and Multimedia Security, Jun 2013, Montpellier, France. pp.175--180, ⟨10.1145/2482513.2482539⟩. ⟨hal-00817336v2⟩
382 View
500 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More