基于边缘的物联网中保护隐私的范围 MAX/MIN 查询量子方案

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Network and Service Management Pub Date : 2024-08-13 DOI:10.1109/TNSM.2024.3442826
Run-Hua Shi;Xia-Qin Fang
{"title":"基于边缘的物联网中保护隐私的范围 MAX/MIN 查询量子方案","authors":"Run-Hua Shi;Xia-Qin Fang","doi":"10.1109/TNSM.2024.3442826","DOIUrl":null,"url":null,"abstract":"Range query in cloud-based outsourcing applications is an important data search service, but it can suffer from privacy disclosure. In this paper, to enhance the security and privacy of sensitive data, we introduce quantum cryptographic technologies and present a feasible quantum approach to address an important range query, i.e., privacy-preserving range MAX/MIN query. First, we define a primitive protocol of secure multiparty computations, called Oblivious Set Inclusion Decision (OSID), in which two parties jointly decide whether a private set includes another private set in an oblivious way, and present an efficient OSID quantum protocol. Especially, in order to efficiently implement OSID quantum protocol, we design a single-photon-based quantum protocol for computing XOR of two private bits, which can achieve the information-theoretical security with the help of a non-colluding quantum cloud. Finally, we propose a novel quantum scheme for privacy-preserving range MAX/MIN query in edge-based Internet of Things by using OSID quantum protocols. Compared with the classical related schemes, our proposed quantum scheme has higher security (i.e., quantum security), because the security of our proposed protocols is based on the basic physical principles of quantum mechanics, instead of unproven computational difficulty assumptions.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"21 6","pages":"6827-6838"},"PeriodicalIF":4.7000,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quantum Scheme for Privacy-Preserving Range MAX/MIN Query in Edge-Based Internet of Things\",\"authors\":\"Run-Hua Shi;Xia-Qin Fang\",\"doi\":\"10.1109/TNSM.2024.3442826\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Range query in cloud-based outsourcing applications is an important data search service, but it can suffer from privacy disclosure. In this paper, to enhance the security and privacy of sensitive data, we introduce quantum cryptographic technologies and present a feasible quantum approach to address an important range query, i.e., privacy-preserving range MAX/MIN query. First, we define a primitive protocol of secure multiparty computations, called Oblivious Set Inclusion Decision (OSID), in which two parties jointly decide whether a private set includes another private set in an oblivious way, and present an efficient OSID quantum protocol. Especially, in order to efficiently implement OSID quantum protocol, we design a single-photon-based quantum protocol for computing XOR of two private bits, which can achieve the information-theoretical security with the help of a non-colluding quantum cloud. Finally, we propose a novel quantum scheme for privacy-preserving range MAX/MIN query in edge-based Internet of Things by using OSID quantum protocols. Compared with the classical related schemes, our proposed quantum scheme has higher security (i.e., quantum security), because the security of our proposed protocols is based on the basic physical principles of quantum mechanics, instead of unproven computational difficulty assumptions.\",\"PeriodicalId\":13423,\"journal\":{\"name\":\"IEEE Transactions on Network and Service Management\",\"volume\":\"21 6\",\"pages\":\"6827-6838\"},\"PeriodicalIF\":4.7000,\"publicationDate\":\"2024-08-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network and Service Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10634978/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10634978/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

范围查询在云外包应用中是一项重要的数据搜索服务,但存在隐私泄露的问题。为了提高敏感数据的安全性和保密性,本文引入量子密码技术,提出了一种可行的量子方法来解决一个重要的范围查询,即保护隐私的范围MAX/MIN查询。首先,我们定义了一个安全多方计算的原始协议,称为遗忘集包含决策(OSID),其中双方以遗忘的方式共同决定一个私有集是否包含另一个私有集,并提出了一个高效的OSID量子协议。特别是为了有效地实现OSID量子协议,我们设计了一种基于单光子的量子协议,用于计算两个私有比特的异或,该协议可以在非串通量子云的帮助下实现信息理论安全性。最后,我们提出了一种基于OSID量子协议的基于边缘的物联网中隐私保护范围MAX/MIN查询的新量子方案。与经典的相关方案相比,我们提出的量子方案具有更高的安全性(即量子安全性),因为我们提出的协议的安全性是基于量子力学的基本物理原理,而不是未经证明的计算难度假设。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Quantum Scheme for Privacy-Preserving Range MAX/MIN Query in Edge-Based Internet of Things
Range query in cloud-based outsourcing applications is an important data search service, but it can suffer from privacy disclosure. In this paper, to enhance the security and privacy of sensitive data, we introduce quantum cryptographic technologies and present a feasible quantum approach to address an important range query, i.e., privacy-preserving range MAX/MIN query. First, we define a primitive protocol of secure multiparty computations, called Oblivious Set Inclusion Decision (OSID), in which two parties jointly decide whether a private set includes another private set in an oblivious way, and present an efficient OSID quantum protocol. Especially, in order to efficiently implement OSID quantum protocol, we design a single-photon-based quantum protocol for computing XOR of two private bits, which can achieve the information-theoretical security with the help of a non-colluding quantum cloud. Finally, we propose a novel quantum scheme for privacy-preserving range MAX/MIN query in edge-based Internet of Things by using OSID quantum protocols. Compared with the classical related schemes, our proposed quantum scheme has higher security (i.e., quantum security), because the security of our proposed protocols is based on the basic physical principles of quantum mechanics, instead of unproven computational difficulty assumptions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.
期刊最新文献
Table of Contents Table of Contents Guest Editors’ Introduction: Special Issue on Robust and Resilient Future Communication Networks A Novel Adaptive Device-Free Passive Indoor Fingerprinting Localization Under Dynamic Environment HSS: A Memory-Efficient, Accurate, and Fast Network Measurement Framework in Sliding Windows
×
引用
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