Pith. sign in

REVIEW 1 cited by

Towards Privacy-Preserving, Real-Time and Lossless Feature Matching

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2208.00214 v1 pith:PGM4W4PW submitted 2022-07-30 cs.CV

classification cs.CV
keywords matchingcurrentfeatureprivacysecurevectorfeatureslevelslossless
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Most visual retrieval applications store feature vectors for downstream matching tasks. These vectors, from where user information can be spied out, will cause privacy leakage if not carefully protected. To mitigate privacy risks, current works primarily utilize non-invertible transformations or fully cryptographic algorithms. However, transformation-based methods usually fail to achieve satisfying matching performances while cryptosystems suffer from heavy computational overheads. In addition, secure levels of current methods should be improved to confront potential adversary attacks. To address these issues, this paper proposes a plug-in module called SecureVector that protects features by random permutations, 4L-DEC converting and existing homomorphic encryption techniques. For the first time, SecureVector achieves real-time and lossless feature matching among sanitized features, along with much higher security levels than current state-of-the-arts. Extensive experiments on face recognition, person re-identification, image retrieval, and privacy analyses demonstrate the effectiveness of our method. Given limited public projects in this field, codes of our method and implemented baselines are made open-source in https://github.com/IrvingMeng/SecureVector.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. IDFace: Face Template Protection for Efficient and Secure Identification

    cs.CR 2025-07 conditional novelty 6.0 of 10

    IDFace identifies faces among one million encrypted templates in 126ms with less than 1% accuracy loss and roughly 2x plaintext speed overhead.

Pith tools