Is it Possible to Generate Irreversible PolyProtected Templates from Face Embeddings using System-Specific Keys?
Read the original on arXiv Computer Vision →The Flow has not summarised this story yet — read it at arXiv Computer Vision.
The Flow has not summarised this story yet — read it at arXiv Computer Vision.
This work aims to answer the question of whether it is possible to generate irreversible protected templates when the PolyProtect biometric template protection method is applied to face embeddings usi...
arXiv:2605.03857v2 Announce Type: replace Abstract: This work presents a deeper analysis of the "irreversibility" property of PolyProtect, a biometric template protection method initially proposed fo...
arXiv:2602.02914v4 Announce Type: replace Abstract: Privacy-preserving face recognition (PPFR) and face anonymization have different goals, but both must retain some identity-related information for...
arXiv:2607. 17504v1 Announce Type: cross Abstract: Split face recognition reduces client-side computation but exposes intermediate features to feature inversion attacks and unauthorized analysis by honest-but-curious (HBC) servers.
Split face recognition reduces client-side computation but exposes intermediate features to feature inversion attacks and unauthorized analysis by honest-but-curious (HBC) servers. Existing privacy-preserving face recognition methods mainly aim to resist unauthorized reconstruction, typically producing features whose inversion yields visibly degraded results, which may reveal the existence of protection and motivate adaptive attacks.
The paper proposes a defense against watermark forgery in generative models by randomizing the selection of watermark keys for each query and accepting content only if exactly one key detects a watermark. This approach provides a sample‑count‑independent upper bound on forgery success for blind attackers while preserving model utility. Experiments show a dramatic drop in forgery success rates—from 87% to 1% with four keys for text and from 100% to 2% for images—without significant computational overhead.