Privacy-friendly Discovery of Common Friends in P2P Networks

In this paper we study the problem of comparing a set of data between two parties in a peer-to-peer network to determine the number of common friends. Several protocols for private set intersection are presented in the literature. When the sets are large these tend to be too slow for many purposes....

Full description

Saved in:
Bibliographic Details
Published in2022 31st Conference of Open Innovations Association (FRUCT) Vol. 31; no. 1; pp. 181 - 188
Main Authors Meskanen, Tommi, Kuusijarvi, Jarkko, Ramezanian, Sara, Niemi, Valtteri
Format Conference Proceeding Journal Article
LanguageEnglish
Published FRUCT Oy 2022
FRUCT
Subjects
multiparty computation
Peer-to-peer computing
peer-to-peer networks
Privacy
private set intersection
Protocols
social media
Technological innovation
Online AccessGet full text

Cover

More Information
Summary:In this paper we study the problem of comparing a set of data between two parties in a peer-to-peer network to determine the number of common friends. Several protocols for private set intersection are presented in the literature. When the sets are large these tend to be too slow for many purposes. We consider the problem of two parties finding out how many common friends they have in a privacy preserving way. This problem has arisen in designing a peer-to-peer platform called HELIOS. We present our solution for the problem that is more efficient than older protocols but still sufficiently privacy-friendly for our purposes. The solution is based on iteratively revealing information about the hash values of friends' identities in small increments.
ISSN:2305-7254
2343-0737
DOI:10.23919/FRUCT54823.2022.9770904