Privacy-friendly Discovery of Common Friends in P2P Networks
| Autor: | Tommi Meskanen, Jarkko Kuusijarvi, Sara Ramezanian, Valtteri Niemi |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2022 |
| Předmět: | |
| Zdroj: | Proceedings of the XXth Conference of Open Innovations Association FRUCT, Vol 31, Iss 1, Pp 181-188 (2022) |
| Druh dokumentu: | article |
| ISSN: | 2305-7254 2343-0737 |
| DOI: | 10.23919/FRUCT54823.2022.9770904 |
| Popis: | 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. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|