arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1607.01438cs.CCcs.DMcs.SI
收藏

主动攻击下大型网络三种隐私措施的计算复杂性研究

On the Computational Complexities of Three Privacy Measures for Large Networks Under Active Attack

Tanima Chatterjee, Bhaskar DasGupta, Nasim Mobasheri, Venkatkumar Srinivasan, Ismael G. Yero

摘要:

随着现代互联网时代的到来,各种类型的大型公共网络已经存在,以造福于整个社会,特别是社会学,经济学和地理学等研究领域。然而,这些网络的社会和研究益处也引起了潜在的重大隐私问题,在这个意义上,恶意实体可能通过分析网络并故意将这种隐私侵犯用于有害目的来侵犯这种网络的用户的隐私。这样的考虑已经引起了一个新的活跃的研究领域,涉及在大型网络中的用户的隐私的量化和相应的调查计算这种量化的隐私措施的计算复杂性问题。在本文中,我们正式提出了三个这样的隐私措施,大型网络,并提供非平凡的理论计算这些措施的计算复杂性结果。我们的研究结果表明,前两个措施可以有效地计算,而第三个措施是证明难以计算的对数近似因子。此外,我们还提供了计算复杂性的情况下,网络的隐私要求受到严格限制,包括一个有效的对数近似的结果。

英文摘要:

With the arrival of modern internet era, large public networks of various types have come to existence to benefit the society as a whole and several research areas such as sociology, economics and geography in particular. However, the societal and research benefits of these networks have also given rise to potentially significant privacy issues in the sense that malicious entities may violate the privacy of the users of such a network by analyzing the network and deliberately using such privacy violations for deleterious purposes. Such considerations have given rise to a new active research area that deals with the quantification of privacy of users in large networks and the corresponding investigation of computational complexity issues of computing such quantified privacy measures. In this paper, we formalize three such privacy measures for large networks and provide non-trivial theoretical computational complexity results for computing these measures. Our results show the first two measures can be computed efficiently, whereas the third measure is provably hard to compute within a logarithmic approximation factor. Furthermore, we also provide computational complexity results for the case when the privacy requirement of the network is severely restricted, including an efficient logarithmic approximation.

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

↑