中国邮电高校学报(英文) ›› 2018, Vol. 25 ›› Issue (5): 12-19.doi: 10.19682/j.cnki.1005-8885.2018.0021

• security • 上一篇    下一篇

Research on k-anonymity privacy protection scheme based on bilinear pairings  
 

宋成1,张亚东2,王磊2,刘志中1   

  1. 1. 河南理工大学
    2. 河南理工大学计算机科学与技术学院
  • 收稿日期:2018-03-28 修回日期:2018-05-18 出版日期:2018-10-18 发布日期:2018-10-18
  • 通讯作者: 张亚东 E-mail:18339161026@163.com
  • 基金资助:
    国家自然科学基金青年基金项目;国家自然科学基金面上项目;河南省科技攻关计划项目

Research on k-anonymity privacy protection scheme based on bilinear pairings

  • Received:2018-03-28 Revised:2018-05-18 Online:2018-10-18 Published:2018-10-18
  • Contact: Ya-Dong ZHANG E-mail:18339161026@163.com

摘要: Aimed at enhancing privacy protection of location-based services (LBS) in mobile Internet environment,an improved privacy scheme of high service quality on the basis of bilinear pairings theory and k-anonymity is proposed. In circular region of Euclidian distance, mobile terminal evenly generates some false locations, from which half optimal false locations are screened out according to position entropy, location and mapping background information. The anonymity obtains the effective guarantee, so as to realize privacy protection. Through security analyses, the scheme is proved not only to be able to realize such security features as privacy, anonymity and non-forgeability, but also able to resist query tracing attack. And the result of simulation shows that this scheme not only has better evenness in selecting false locations, but also improves efficiency in generating and selecting false nodes.

关键词:

LBS, bilinear pairings, k-anonymity, privacy protection

Abstract: Aimed at enhancing privacy protection of location-based services (LBS) in mobile Internet environment,an improved privacy scheme of high service quality on the basis of bilinear pairings theory and k-anonymity is proposed. In circular region of Euclidian distance, mobile terminal evenly generates some false locations, from which half optimal false locations are screened out according to position entropy, location and mapping background information. The anonymity obtains the effective guarantee, so as to realize privacy protection. Through security analyses, the scheme is proved not only to be able to realize such security features as privacy, anonymity and non-forgeability, but also able to resist query tracing attack. And the result of simulation shows that this scheme not only has better evenness in selecting false locations, but also improves efficiency in generating and selecting false nodes.

Key words:

LBS, bilinear pairings, k-anonymity, privacy protection