A New Location Privacy Protection Scheme for Multi-users

被引:0
|
作者
Wang J. [1 ,2 ]
Han Y. [1 ,2 ]
Chen J. [3 ]
Yang X. [1 ,2 ]
机构
[1] College of Cryptography Eng., Eng. Univ. of PAP, Xi'an
[2] Key Lab. of Network & Info. Security of PAP, Xi'an
[3] Office of Academic Affairs, Eng. Univ. of PAP, Xi'an
关键词
Flexible location privacy protection; Multi-secret sharing; Multiple users location sharing;
D O I
10.15961/j.jsuese.201900895
中图分类号
学科分类号
摘要
Many applications in location-based services require multiple users to share location. However, the traditional rigid policy of privacy protection forces users to share and expose their precise locations. In order to meet the user's personalized needs for privacy protection, a new multi-user location sharing privacy protection scheme was proposed in this paper. Two kinds of location conversion models were used in our solution to ensure that users can flexibly customize their shared locations with different precision levels. Then all the location data with different precisions is packaged and converted through a multi-secret sharing mechanism based on the Chinese Remaining Theorem. In this mechanism, only one time shares-distribution was needed to realize different shared objects recover location information with corresponding different accuracies. In the security analysis, it is proved that the flexible location privacy protection of multi-user location sharing was realized in an untrusted net environment by our solution. It is highly secure since it does not depend on the trustability of the location provider and can resist single location server attack, collusion attacks of multiple location servers and multiple users. Furthermore, compared with the peer solutions, the simulation experiments showed that ours is more efficient and stable in performance. When the number of location servers participating in the share storage increases or the higher-precision location information is required to be reconstructed, the overheads of computation and communication will not increase dramatically. Thus, it is also applicable in the resource-constrained network environment. Copyright ©2020 Advanced Engineering Sciences. All rights reserved.
引用
收藏
页码:178 / 185
页数:7
相关论文
共 21 条
  • [1] Wang Yuhang, Zhang Hongli, Yu Xiangzhan, Research on location privacy in mobile Internet, Journal on Communications, 36, 9, pp. 230-243, (2015)
  • [2] Lee B, Oh J, Yu H, Et al., Protecting location privacy using location semantics, Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'11), pp. 1289-1297, (2011)
  • [3] Kalnis P, Ghinita G, Mouratidis K, Et al., Preventing location-based identity inference in anonymous spatial queries[J], IEEE Transactions on Knowledge and Data Engineering, 19, 12, pp. 1719-1733, (2007)
  • [4] Enserink M, Chin G., The end of privacy[J], Science, 347, 6221, pp. 490-491, (2015)
  • [5] Xiong Xingxing, Liu Shubo, Li Dan, Et al., Private electric vehicle charging location aggregation based on local differential privacy, Advanced Engineering Sciences, 51, 2, pp. 137-143, (2019)
  • [6] Li J, Yan Hongyang, Liu Zheli, Et al., Location-sharing systems with enhanced privacy in mobile online social networks[J], IEEE Systems Journal, 11, 2, pp. 439-448, (2017)
  • [7] Marias G F, Delakouridis C, Kazatzopoulos L, Et al., Location privacy through secret sharing techniques[C], Proceedings of the Sixth IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks, pp. 614-620, (2005)
  • [8] Durr F, Skvortsov P, Rothermel K., Position sharing for location privacy in non-trusted systems[C], Proceedings of the 2011 IEEE International Conference on Pervasive Computing and Communications (PerCom), pp. 189-196, (2011)
  • [9] Skvortsov P, Durr F, Rothermel K., Map-aware position sharing for location privacy in non-trusted systems[M], Pervasive Computing, pp. 388-405, (2012)
  • [10] Wernke M, Durr F, Rothermel K., PShare:Position sharing for location privacy based on multi-secret sharing[C], Proceedings of the 2012 IEEE International Conference on Pervasive Computing and Communications, pp. 153-161, (2012)