Secure and efficient approximate nearest neighbors search

Benjamin Mathon, Teddy Furon, Laurent Amsaleg, Julien Bringer
2013 Proceedings of the first ACM workshop on Information hiding and multimedia security - IH&MMSec '13  
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
more » ... unication payload which are independent of the size of the database.
doi:10.1145/2482513.2482539 dblp:conf/ih/MathonFAB13 fatcat:zvqtg2yokrc6rjm3g4msawa2py