传输资源的轨迹隐私保护方法

Xing Zhang, Jiaruo Li, Yiran Cao, Zhaoming Su, Shitao Jiang
{"title":"传输资源的轨迹隐私保护方法","authors":"Xing Zhang, Jiaruo Li, Yiran Cao, Zhaoming Su, Shitao Jiang","doi":"10.1117/12.3031947","DOIUrl":null,"url":null,"abstract":"To protect the location privacy of key nodes in transmission routing, we have studied a trajectory privacy preserving method for transmission resources. By anonymizing the gis information of the whole route, that is, anonymizing all the location information including the first and last stations of the route. Firstly, the internal point of the whole optical cable is protected by grid protection method, and then a method based on Bayesian reasoning is proposed to protect the location privacy of the endpoints including starting point and destination. Through Bayesian inference process, it is proved that the starting point of optical cable routing can be protected by shear the point closest to the starting point and the destination, and the destination location protection algorithm can be obtained in the same way. In order to further improve the endpoints protection performance, we divide the day into different time spans according to the scene of optical cable inspection, and then integrate the anonymization process into this time span. By comparing the two endpoints prediction algorithms with Syn_sub and PBT, it is proved that the proposed endpoints protection algorithm is more effective than the classical algorithm.","PeriodicalId":198425,"journal":{"name":"Other Conferences","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Trajectory privacy preserving method for transmission resources\",\"authors\":\"Xing Zhang, Jiaruo Li, Yiran Cao, Zhaoming Su, Shitao Jiang\",\"doi\":\"10.1117/12.3031947\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To protect the location privacy of key nodes in transmission routing, we have studied a trajectory privacy preserving method for transmission resources. By anonymizing the gis information of the whole route, that is, anonymizing all the location information including the first and last stations of the route. Firstly, the internal point of the whole optical cable is protected by grid protection method, and then a method based on Bayesian reasoning is proposed to protect the location privacy of the endpoints including starting point and destination. Through Bayesian inference process, it is proved that the starting point of optical cable routing can be protected by shear the point closest to the starting point and the destination, and the destination location protection algorithm can be obtained in the same way. In order to further improve the endpoints protection performance, we divide the day into different time spans according to the scene of optical cable inspection, and then integrate the anonymization process into this time span. By comparing the two endpoints prediction algorithms with Syn_sub and PBT, it is proved that the proposed endpoints protection algorithm is more effective than the classical algorithm.\",\"PeriodicalId\":198425,\"journal\":{\"name\":\"Other Conferences\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-06-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Other Conferences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.3031947\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Other Conferences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.3031947","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了保护传输路由中关键节点的位置隐私,我们研究了一种传输资源的轨迹隐私保护方法。通过对整个路由的 gis 信息进行匿名化处理,即对包括路由首末站在内的所有位置信息进行匿名化处理。首先通过网格保护方法对整条光缆的内部点进行保护,然后提出一种基于贝叶斯推理的方法来保护包括起点和终点在内的端点位置隐私。通过贝叶斯推理过程,证明光缆路由的起点可以通过剪切最靠近起点和终点的点来保护,终点位置保护算法也可以用同样的方法得到。为了进一步提高端点保护性能,我们根据光缆巡检的场景将一天划分为不同的时间跨度,然后将匿名化过程整合到这个时间跨度中。通过比较 Syn_sub 和 PBT 两种端点预测算法,证明所提出的端点保护算法比经典算法更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Trajectory privacy preserving method for transmission resources
To protect the location privacy of key nodes in transmission routing, we have studied a trajectory privacy preserving method for transmission resources. By anonymizing the gis information of the whole route, that is, anonymizing all the location information including the first and last stations of the route. Firstly, the internal point of the whole optical cable is protected by grid protection method, and then a method based on Bayesian reasoning is proposed to protect the location privacy of the endpoints including starting point and destination. Through Bayesian inference process, it is proved that the starting point of optical cable routing can be protected by shear the point closest to the starting point and the destination, and the destination location protection algorithm can be obtained in the same way. In order to further improve the endpoints protection performance, we divide the day into different time spans according to the scene of optical cable inspection, and then integrate the anonymization process into this time span. By comparing the two endpoints prediction algorithms with Syn_sub and PBT, it is proved that the proposed endpoints protection algorithm is more effective than the classical algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信