Group Membership Verification with Privacy: Sparse or Dense?

Marzieh Gheisari 1 Teddy Furon 1 Laurent Amsaleg 1
1 LinkMedia - Creating and exploiting explicit links between multimedia fragments
Inria Rennes – Bretagne Atlantique , IRISA-D6 - MEDIA ET INTERACTIONS
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02307926
Contributor : Teddy Furon <>
Submitted on : Tuesday, October 8, 2019 - 10:11:09 AM
Last modification on : Tuesday, November 5, 2019 - 9:46:55 AM

File

wifs2019_template.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02307926, version 1

Citation

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-02307926⟩

Share

Metrics

Record views

19

Files downloads

28