Privacy-friendly Discovery of Common Friends in P2P Networks

Tommi Meskanen; Jarkko Kuusijarvi; Sara Ramezanian; Valtteri Niemi

doi:10.23919/FRUCT54823.2022.9770904

Privacy-friendly Discovery of Common Friends in P2P Networks

Tommi Meskanen
, Jarkko Kuusijarvi
, Sara Ramezanian
, Valtteri Niemi

BA6403 Advanced cybersecurity and cryptography

Helsinki Institute for Information Technology (HIIT)
University of Helsinki

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

Abstract

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 language	English
Title of host publication	2022 31st Conference of Open Innovations Association (FRUCT)
Editors	Sergey Balandin, Tatiana Shatalova
Publisher	IEEE Institute of Electrical and Electronic Engineers
Pages	181-188
ISBN (Electronic)	978-952-69244-7-2
DOIs	https://doi.org/10.23919/FRUCT54823.2022.9770904
Publication status	Published - 2022
MoE publication type	A4 Article in a conference publication
Event	31st Conference of Open Innovations Association FRUCT, FRUCT 2022 - Virtual, Online, Finland Duration: 27 Apr 2022 → 29 Apr 2022

Conference

Conference	31st Conference of Open Innovations Association FRUCT, FRUCT 2022
Country/Territory	Finland
City	Virtual, Online
Period	27/04/22 → 29/04/22

Funding

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.

Access to Document

10.23919/FRUCT54823.2022.9770904

Cite this

@inproceedings{9534cef521c84a629bf172ba0db49d05,

title = "Privacy-friendly Discovery of Common Friends in P2P Networks",

abstract = "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. ",

author = "Tommi Meskanen and Jarkko Kuusijarvi and Sara Ramezanian and Valtteri Niemi",

note = "Funding Information: 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. ; 31st Conference of Open Innovations Association FRUCT, FRUCT 2022 ; Conference date: 27-04-2022 Through 29-04-2022",

year = "2022",

doi = "10.23919/FRUCT54823.2022.9770904",

language = "English",

pages = "181--188",

editor = "Sergey Balandin and Tatiana Shatalova",

booktitle = "2022 31st Conference of Open Innovations Association (FRUCT)",

publisher = "IEEE Institute of Electrical and Electronic Engineers",

address = "United States",

}

Meskanen, T, Kuusijarvi, J, Ramezanian, S & Niemi, V 2022, Privacy-friendly Discovery of Common Friends in P2P Networks. in S Balandin & T Shatalova (eds), 2022 31st Conference of Open Innovations Association (FRUCT). IEEE Institute of Electrical and Electronic Engineers, pp. 181-188, 31st Conference of Open Innovations Association FRUCT, FRUCT 2022, Virtual, Online, Finland, 27/04/22. https://doi.org/10.23919/FRUCT54823.2022.9770904

Privacy-friendly Discovery of Common Friends in P2P Networks. / Meskanen, Tommi; Kuusijarvi, Jarkko; Ramezanian, Sara et al.
2022 31st Conference of Open Innovations Association (FRUCT). ed. / Sergey Balandin; Tatiana Shatalova. IEEE Institute of Electrical and Electronic Engineers, 2022. p. 181-188.

Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review

TY - GEN

T1 - Privacy-friendly Discovery of Common Friends in P2P Networks

AU - Meskanen, Tommi

AU - Kuusijarvi, Jarkko

AU - Ramezanian, Sara

AU - Niemi, Valtteri

N1 - Funding Information: 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.

PY - 2022

Y1 - 2022

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85130388165

U2 - 10.23919/FRUCT54823.2022.9770904

DO - 10.23919/FRUCT54823.2022.9770904

M3 - Conference article in proceedings

AN - SCOPUS:85130388165

SP - 181

EP - 188

BT - 2022 31st Conference of Open Innovations Association (FRUCT)

A2 - Balandin, Sergey

A2 - Shatalova, Tatiana

PB - IEEE Institute of Electrical and Electronic Engineers

T2 - 31st Conference of Open Innovations Association FRUCT, FRUCT 2022

Y2 - 27 April 2022 through 29 April 2022

ER -

Privacy-friendly Discovery of Common Friends in P2P Networks

Abstract

Conference

Funding

Access to Document

Other files and links

Fingerprint

Cite this