物联网网络中的隐私保护和有效范围计数

Ruiyang Qin, Bowen Deng, Lele Zheng, Xutong Mu
{"title":"物联网网络中的隐私保护和有效范围计数","authors":"Ruiyang Qin, Bowen Deng, Lele Zheng, Xutong Mu","doi":"10.1109/NaNA53684.2021.00091","DOIUrl":null,"url":null,"abstract":"In recent years, Internet of Things (IoT) networks have been received much attention due to their intelligence and automation. Numerous devices are deployed in the networks, and many applications are willing to obtain the distribution of IoT devices in one range for data analysis. However, some distributions of IoT devices include sensitive information which may disclose the privacy of their owners. And most IoT devices cannot afford heavy computation because of their low computing power and limited storage capacity. In this paper, we propose a privacy-preserving and efficient scheme that satisfies local differential privacy and supports O(1) -time-complexity range counting query which can find the number of IoT devices in a range. It also allows IoT devices to join or exit dynamically. Finally, theoretical analysis proves that our scheme satisfies local differential privacy, and our experiments show that our range counting query scheme can get the microsecond level.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Privacy-Preserving and Efficient Range Counting in IoT Networks\",\"authors\":\"Ruiyang Qin, Bowen Deng, Lele Zheng, Xutong Mu\",\"doi\":\"10.1109/NaNA53684.2021.00091\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, Internet of Things (IoT) networks have been received much attention due to their intelligence and automation. Numerous devices are deployed in the networks, and many applications are willing to obtain the distribution of IoT devices in one range for data analysis. However, some distributions of IoT devices include sensitive information which may disclose the privacy of their owners. And most IoT devices cannot afford heavy computation because of their low computing power and limited storage capacity. In this paper, we propose a privacy-preserving and efficient scheme that satisfies local differential privacy and supports O(1) -time-complexity range counting query which can find the number of IoT devices in a range. It also allows IoT devices to join or exit dynamically. Finally, theoretical analysis proves that our scheme satisfies local differential privacy, and our experiments show that our range counting query scheme can get the microsecond level.\",\"PeriodicalId\":414672,\"journal\":{\"name\":\"2021 International Conference on Networking and Network Applications (NaNA)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Networking and Network Applications (NaNA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NaNA53684.2021.00091\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Networking and Network Applications (NaNA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaNA53684.2021.00091","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

近年来,物联网(IoT)网络因其智能化和自动化而备受关注。网络中部署了大量的设备,许多应用都愿意获得物联网设备在一个范围内的分布,以便进行数据分析。然而,物联网设备的某些分布包含敏感信息,可能会泄露其所有者的隐私。大多数物联网设备由于其低计算能力和有限的存储容量而无法承受繁重的计算。在本文中,我们提出了一种满足局部差分隐私且支持O(1) -时间复杂度范围计数查询的高效隐私保护方案,该方案可以找到一个范围内物联网设备的数量。它还允许物联网设备动态加入或退出。最后,理论分析证明了我们的方案满足局部差分隐私,实验表明我们的距离计数查询方案可以达到微秒级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Privacy-Preserving and Efficient Range Counting in IoT Networks
In recent years, Internet of Things (IoT) networks have been received much attention due to their intelligence and automation. Numerous devices are deployed in the networks, and many applications are willing to obtain the distribution of IoT devices in one range for data analysis. However, some distributions of IoT devices include sensitive information which may disclose the privacy of their owners. And most IoT devices cannot afford heavy computation because of their low computing power and limited storage capacity. In this paper, we propose a privacy-preserving and efficient scheme that satisfies local differential privacy and supports O(1) -time-complexity range counting query which can find the number of IoT devices in a range. It also allows IoT devices to join or exit dynamically. Finally, theoretical analysis proves that our scheme satisfies local differential privacy, and our experiments show that our range counting query scheme can get the microsecond level.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Covert Communication in D2D Underlaying Cellular Network Online Scheduling of Machine Learning Jobs in Edge-Cloud Networks Dual attention mechanism object tracking algorithm based on Fully-convolutional Siamese network Fatigue Detection Technology for Online Learning The Nearest Neighbor Algorithm for Balanced and Connected k-Center Problem under Modular Distance
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1