|
| | | | |
| | | |
| Stat |
Members: 3669
Articles: 2'599'751
Articles rated: 2609
22 March 2025 |
|
| | | | |
|
Article overview
| |
|
|
Private Link Exchange over Social Graphs | | Hiep H. Nguyen
; Abdessamad Imine
; Michael Rusinowitch
; | | Date: |
6 Sep 2016 | | Abstract: | Currently, most of the online social networks (OSN) keep their data secret
and in centralized manner. Researchers are allowed to crawl the underlying
social graphs (and data) but with limited rates, leading to only partial views
of the true social graphs. To overcome this constraint, we may start from user
perspective, the contributors of the OSNs. More precisely, if users cautiously
collaborate with one another, they can use the very infrastructure of the OSNs
to exchange noisy friend lists with their neighbors in several rounds. In the
end, they can build local subgraphs, also called local views of the true social
graph. In this paper, we propose such protocols for the problem of
extit{private link exchange} over social graphs.
The problem is unique in the sense that the disseminated data over the links
are the links themselves. However, there exist fundamental questions about the
feasibility of this model. The first question is how to define simple and
effective privacy concepts for the link exchange processes. The second question
comes from the high volume of link lists in exchange which may increase
exponentially round after round. While storage and computation complexity may
be affordable for desktop PCs, communication costs are non-trivial. We address
both questions by a simple $(alpha,eta)$-exchange using Bloom filters. | | Source: | arXiv, 1609.1616 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
|
| |
|
|
|
REGISTER