Fast and secure similarity search in high dimensional space - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Fast and secure similarity search in high dimensional space

Teddy Furon
Hervé Jégou
  • Function : Author
  • PersonId : 833473
Laurent Amsaleg
Benjamin Mathon

Abstract

Similarity search in high dimensional space database is split into two worlds: i) fast, scalable, and approximate search algorithms which are not secure, and ii) search protocols based on secure computation which are not scalable. This paper presents a one-way privacy protocol that lies in between these two worlds. Approximate metrics for the cosine similarity allows speed. Elements of large random matrix theory provides security evidences if the size of the database is not too big with respect to the space dimension.
Fichier principal
Vignette du fichier
paper.pdf (157.2 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00857570 , version 1 (25-06-2014)

Identifiers

  • HAL Id : hal-00857570 , version 1

Cite

Teddy Furon, Hervé Jégou, Laurent Amsaleg, Benjamin Mathon. Fast and secure similarity search in high dimensional space. IEEE International Workshop on Information Forensics and Security, 2013, Guangzhou, China. ⟨hal-00857570⟩
374 View
243 Download

Share

Gmail Facebook X LinkedIn More