Privacy-friendly Discovery of Common Friends in P2P Networks

Proceedings of the XXth Conference of Open Innovations Association FRUCT

Tommi Meskanen¹  Jarkko Kuusijarvi²  Sara Ramezanian²  Valtteri Niemi² 

[1] University of Helsinki, Finland;VTT Technical Research Centre of Finland Ltd, Finland;

关键词: multiparty computation;    private set intersection;    social media;    peer-to-peer networks;    privacy;   

DOI  :  10.23919/FRUCT54823.2022.9770904

来源: DOAJ

【 摘 要 】

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 hash values of friends identities in small increments.

【 授权许可】

Unknown