Group Membership Verification with Privacy: Sparse or Dense? - Archive ouverte HAL Access content directly
Conference Papers Year :

Group Membership Verification with Privacy: Sparse or Dense?


Group membership verification checks if a biometric trait corresponds to one member of a group without revealing the identity of that member. Recent contributions provide privacy for group membership protocols through the joint use of two mechanisms: quantizing templates into discrete embeddings, and aggregating several templates into one group representation. However, this scheme has one drawback: the data structure representing the group has a limited size and cannot recognize noisy query when many templates are aggregated. Moreover, the sparsity of the embeddings seemingly plays a crucial role on the performance verification. This paper proposes a mathematical model for group membership verification allowing to reveal the impact of sparsity on both security, compactness, and verification performances. This models bridges the gap towards a Bloom filter robust to noisy queries. It shows that a dense solution is more competitive unless the queries are almost noiseless.
Fichier principal
Vignette du fichier
wifs2019_template.pdf (287.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02489991 , version 2 (08-10-2019)
hal-02489991 , version 1 (24-02-2020)




  • HAL Id : hal-02489991 , version 2


Marzieh Gheisari, Teddy Furon, Laurent Amsaleg. Group Membership Verification with Privacy: Sparse or Dense?. WIFS 2019 - IEEE International Workshop on Information Forensics and Security, Dec 2019, Delft, Netherlands. pp.1-6. ⟨hal-02489991v2⟩
111 View
77 Download


Gmail Facebook Twitter LinkedIn More