Privacy-preserving Near Neighbor Search Via Sparse Coding With Ambiguation

Abstract

In this paper, we propose a framework for privacy-preserving approximate near neighbor search via stochastic sparsifying encoding. The core of the framework relies on sparse coding with ambiguation (SCA) mechanism that introduces the notion of inherent shared secrecy based on the support intersection of sparse codes. This approach is `fairness-aware', in the sense that any point in the neighborhood has an equiprobable chance to be chosen. Our approach can be applied to raw data, latent representation of autoencoders, and aggregated local descriptors. The proposed method is tested on both synthetic i.i.d data and real large-scale image databases.

Stats

• citations2
• S2 citations—
• github stars0
• HF likes0
• heat score3.58
• arxiv keyrazeghi2021privacy

Related papers

• Privacy Preserving Identification Using Sparse Approximation With Ambiguization (2017)9.76
• Nearest Neighbor Search With Compact Codes: A Decoder Perspective (2021)3.58
• Sparse Ternary Codes For Similarity Search Have Higher Coding Gain Than Dense Binary Codes (2017)7.50
• Sparse-inductive Generative Adversarial Hashing For Nearest Neighbor Search (2023)0.00
• 2-bit Random Projections, Nonlinear Estimators, And Approximate Near Neighbor Search (2016)0.00
• Subspace Collision: An Efficient And Accurate Framework For High-dimensional Approximate Nearest Neighbor Search (2024)7.16
• Sub-linear Privacy-preserving Near-neighbor Search (2016)0.00
• Polysemous Codes (2016)11.49