Secure and efficient approximate nearest neighbors search

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.

[1]  Ahmad-Reza Sadeghi,et al.  Efficient Privacy-Preserving Face Recognition , 2009, ICISC.

[2]  Petros Boufounos,et al.  Secure binary embeddings for privacy preserving nearest neighbors , 2011, 2011 IEEE International Workshop on Information Forensics and Security.

[3]  Vincenzo Piuri,et al.  Privacy-preserving fingercode authentication , 2010, MM&Sec '10.

[4]  Petros Boufounos,et al.  Universal Rate-Efficient Scalar Quantization , 2010, IEEE Transactions on Information Theory.

[5]  Mauro Barni,et al.  Encrypted signal processing for privacy protection: Conveying the utility of homomorphic encryption and multiparty computation , 2013, IEEE Signal Processing Magazine.

[6]  Shantanu Rane,et al.  An attribute-based framework for privacy preserving image querying , 2012, 2012 19th IEEE International Conference on Image Processing.

[7]  Kannan Ramchandran,et al.  One-Way Private Media Search on Public Databases: The Role of Signal Processing , 2013, IEEE Signal Processing Magazine.

[8]  Cordelia Schmid,et al.  Product Quantization for Nearest Neighbor Search , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[9]  Julien Bringer,et al.  Faster secure computation for biometric identification using filtering , 2012, 2012 5th IAPR International Conference on Biometrics (ICB).