一种高效的分散式社交网络轮询协议
Efficient Polling Protocol for Decentralized Social Networks
摘要：
我们解决了社交网络中的投票问题，在这些网络中，个人合作选择一些选项中最喜欢的选择，而不泄露他们的投票，并公开暴露他们潜在的恶意行为。鉴于这种社会互动模型，Guerraoui等人最近提出了不依赖于任何中央机构或密码系统的投票协议，使用简单的秘密共享方案以及验证程序来准确计算投票的最终结果。然而，这些协议可以被安全和有效地部署，只要社交图结构应该被转换为基于环结构的覆盖，并且参与用户的数量是完美的平方。因此，设计\emph{secure}和\emph{efficient}轮询协议而不考虑这些约束仍然是一个具有挑战性的问题。在本文中，我们提出了EPol，一个简单的分散式轮询协议，依赖于社会图的当前状态。更明确地说，我们定义了一个家庭的社会图，满足我们所谓的$m$ -广播属性（其中$m$小于或等于最小节点度），并显示其结构，使低通信成本，并构成必要和充分条件，以确保投票隐私和限制不诚实的用户对投票输出的准确性的影响。我们的协议是有效的，更精确地计算最终的结果。此外，尽管使用了更丰富的社交图结构，但EPol的通信和空间复杂性接近线性。
英文摘要：
We address the polling problem in social networks where individuals collaborate to choose the most favorite choice amongst some options, without divulging their vote and publicly exposing their potentially malicious actions. Given this social interaction model, Guerraoui et al. recently proposed polling protocols that do not rely on any central authority or cryptography system, using a simple secret sharing scheme along with verification procedures to accurately compute the poll's final result. However, these protocols can be deployed safely and efficiently provided that, inter alia, the social graph structure should be transformed into a ring structure-based overlay and the number of participating users is perfect square. Consequently, designing \emph{secure} and \emph{efficient} polling protocols regardless these constraints remains a challenging issue. In this paper, we present EPol, a simple decentralized polling protocol that relies on the current state of social graphs. More explicitly, we define one family of social graphs that satisfy what we call the $m$-broadcasting property (where $m$ is less than or equal to the minimum node degree) and show their structures enable low communication cost and constitute necessary and sufficient condition to ensure vote privacy and limit the impact of dishonest users on the accuracy of the polling output. Our protocol is effective to compute more precisely the final result. Furthermore, despite the use of richer social graph structures, the communication and spatial complexities of EPol are close to be linear.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
