Privacy Preserving Identification Using Sparse Approximation With Ambiguization

Abstract

In this paper, we consider a privacy preserving encoding framework for identification applications covering biometrics, physical object security and the Internet of Things (IoT). The proposed framework is based on a sparsifying transform, which consists of a trained linear map, an element-wise nonlinearity, and privacy amplification. The sparsifying transform and privacy amplification are not symmetric for the data owner and data user. We demonstrate that the proposed approach is closely related to sparse ternary codes (STC), a recent information-theoretic concept proposed for fast approximate nearest neighbor (ANN) search in high dimensional feature spaces that being machine learning in nature also offers significant benefits in comparison to sparse approximation and binary embedding approaches. We demonstrate that the privacy of the database outsourced to a server as well as the privacy of the data user are preserved at a low computational cost, storage and communication burdens.

Stats

• citations19
• S2 citations—
• github stars0
• HF likes0
• heat score9.76
• arxiv keyrazeghi2017privacy

Related papers

• Privacy-preserving Near Neighbor Search Via Sparse Coding With Ambiguation (2021)3.58
• Sparse Ternary Codes For Similarity Search Have Higher Coding Gain Than Dense Binary Codes (2017)7.50
• From Measurement To Mitigation: Quantifying And Reducing Identity Leakage In Image Representation Encoders With Linear Subspace Removal (2026)0.00
• Cityguard: Graph-aware Private Descriptors For Bias-resilient Identity Search Across Urban Cameras (2026)0.00
• A Multi-layer Network Based On Sparse Ternary Codes For Universal Vector Compression (2017)0.00
• A Privacy-preserving Image Retrieval Scheme Using A Codebook Generated From Independent Plain-image Dataset (2021)0.00
• 2-bit Random Projections, Nonlinear Estimators, And Approximate Near Neighbor Search (2016)0.00
• Analysis Of Sparsehash: An Efficient Embedding Of Set-similarity Via Sparse Projections (2019)4.52