arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.01616cs.SIcs.CR
收藏

社交图上的私人链接交换

Private Link Exchange over Social Graphs

Hiep H. Nguyen, Abdessamad Imine, Michael Rusinowitch

摘要:

目前,大多数在线社交网络(OSN)以集中的方式保密其数据。研究人员被允许抓取底层的社交图谱(和数据),但速度有限,导致只能看到真实社交图谱的部分视图。为了克服这个限制,我们可以从用户的角度出发,OSN的贡献者。更准确地说,如果用户谨慎地彼此合作,他们可以使用OSN的基础设施与邻居进行多轮的嘈杂朋友列表交换。最后,他们可以构建本地子图,也称为真实社交图的本地视图。在本文中,我们提出了这样的协议的问题,\textit{private link exchange}在社会图。这个问题是独特的,因为通过链接传播的数据就是链接本身。然而,这一模式的可行性存在根本性问题。第一个问题是如何为链接交换过程定义简单有效的隐私概念。第二个问题来自于交换中的大量链接列表,这些列表可能会一轮又一轮地呈指数级增长。虽然存储和计算复杂性对于台式PC来说可能是负担得起的,但通信成本却不小。我们通过一个简单的$(α,β)$交换使用布隆过滤器来解决这两个问题。

英文摘要:

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 \textit{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 $(α,β)$-exchange using Bloom filters.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑