arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2002.10362cs.CRcs.CV

Group Membership Verification with Privacy: Sparse or Dense?

Univ Rennes(雷恩大学);Inria(法国国家信息与自动化研究所);CNRS(法国国家科学研究中心);IRISA(雷恩计算机科学与应用研究所)

Marzieh Gheisari, Teddy Furon, Laurent Amsaleg

英文摘要:

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 queries 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 model 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑