Secure and Efficient Approximate Nearest Neighbors Search

Benjamin Mathon 1 Teddy Furon 1 Laurent Amsaleg 1 Julien Bringer 2
1 TEXMEX - Multimedia content-based indexing
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
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.
Liste complète des métadonnées

Cited literature [9 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00817336
Contributor : Benjamin Mathon <>
Submitted on : Thursday, June 27, 2013 - 12:54:09 PM
Last modification on : Friday, November 16, 2018 - 1:28:15 AM
Document(s) archivé(s) le : Wednesday, April 5, 2017 - 4:15:17 AM

File

paper.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

541

Files downloads

301