On Preserving Secrecy in Mobile Social Networks

On Preserving Secrecy in Mobile Social Networks
复制标题

DOI:
10.5445/ir/1000096955
复制
发表时间:
2020-05
影响因子:
2.3
通讯作者:
Gabriela Suntaxi;A. A. E. Ghazi-A.;Klemens Böhm
Gabriela Suntaxi;A. A. E. Ghazi-A.;Klemens Böhm
中科院分区:
--
文献类型:
--
作者:
Gabriela Suntaxi;A. A. E. Ghazi-A.;Klemens Böhm

文献摘要

相似文献

基于位置的服务是由移动的社交网络提供的最重要的服务之一。提供这种服务需要访问用户的物理位置以及访问授权,即,谁有权访问哪些信息。然而,这些物理位置和授权是敏感信息,必须对包括服务提供商在内的任何对手保密。据我们所知,在具有共谋假设下的撤销特征的移动的社交网络中提供基于位置的服务的问题,即,对手与服务提供商勾结,还没有被研究。在本文中,我们展示了如何解决这个问题的范围查询的例子。具体来说,我们保证任何对手,包括服务提供商,都无法了解(1)用户的物理位置,(2)他的位置与用户的位置之间的距离,以及(3)是否允许两个用户了解他们之间的距离。我们提出了两种方法,即两层对称加密和两层基于属性的加密。第一种方法和第二种方法之间的主要区别在于,它们分别使用对称加密和基于属性的加密。接下来,我们证明了这两种方法的保密性保证,分析其复杂性,并提供实验来评估其在实践中的性能。
Location-based services are one of the most important services offered by mobile social networks. Offering this kind of services requires accessing the physical position of users together with the access authorizations, i.e., who is authorized to access what information. However, these physical positions and authorizations are sensitive information which have to be kept secret from any adversary, including the service providers. As far as we know, the problem of offering location-based services in mobile social networks with a revocation feature under collusion assumption, i.e., an adversary colludes with the service provider, has not been studied. In this paper, we show how to solve this problem in the example of range queries. Specifically, we guarantee any adversary, including the service provider, is not able to learn (1) the physical position of the users, (2) the distance between his position and that of the users, and (3) whether two users are allowed to learn the distance between them. We propose two approaches namely two-layer symmetric encryption and two-layer attribute-based encryption. The main difference between the first and the second approach is that they use, among other encryption schemes, symmetric and attribute-based encryption, respectively. Next, we prove the secrecy guarantees of both approaches, analyze their complexity and provide experiments to evaluate their performance in practice.