[Resource Topic] 2023/1218: Arke: Scalable and Byzantine Fault Tolerant Privacy-Preserving Contact Discovery

Welcome to the resource topic for 2023/1218

Arke: Scalable and Byzantine Fault Tolerant Privacy-Preserving Contact Discovery

Authors: Nicolas Mohnblatt, Alberto Sonnino, Kobi Gurkan, Philipp Jovanovic


Contact discovery is a crucial component of social applications, facilitating interactions between registered contacts. This work introduces Arke, a novel approach to contact discovery that addresses the limitations of existing solutions in terms of privacy, scalability, and reliance on trusted third parties. Arke ensures the unlinkability of user interactions, mitigates enumeration attacks, and operates without single points of failure or trust. Notably, Arke is the first contact discovery system whose performance is independent of the total number of users and the first that can operate in a Byzantine setting. It achieves its privacy goals through an unlinkable handshake mechanism built on top of an identity-based non-interactive key exchange. By leveraging a custom distributed architecture, Arke forgoes the expense of consensus to achieve scalability while maintaining consistency in a Byzantine fault tolerant environment. Performance evaluations demonstrate that Arke can support enough throughput to operate at a planetary scale while maintaining sub-second latencies in a large geo-distributed setting.

ePrint: https://eprint.iacr.org/2023/1218

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .