Privacy-friendly Discovery of Common Friends in P2P Networks

Tommi Meskanen, Jarkko Kuusijarvi, Sara Ramezanian, Valtteri Niemi

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review


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.

Original languageEnglish
Title of host publication2022 31st Conference of Open Innovations Association (FRUCT)
EditorsSergey Balandin, Tatiana Shatalova
PublisherIEEE Institute of Electrical and Electronic Engineers
ISBN (Electronic)978-952-69244-7-2
Publication statusPublished - 2022
MoE publication typeA4 Article in a conference publication
Event31st Conference of Open Innovations Association FRUCT, FRUCT 2022 - Virtual, Online, Finland
Duration: 27 Apr 202229 Apr 2022


Conference31st Conference of Open Innovations Association FRUCT, FRUCT 2022
CityVirtual, Online


This work is supported by the HELIOS H2020 project. HELIOS has received funding from the European Unions Horizon 2020 research and innovation programme under grant agreement No 825585.


Dive into the research topics of 'Privacy-friendly Discovery of Common Friends in P2P Networks'. Together they form a unique fingerprint.

Cite this