Efficient quantum multi-authority attribute-based encryption and generalizations

IF 2.2 3区 物理与天体物理 Q1 PHYSICS, MATHEMATICAL Quantum Information Processing Pub Date : 2024-09-26 DOI:10.1007/s11128-024-04538-z
Shion Samadder Chaudhury
{"title":"Efficient quantum multi-authority attribute-based encryption and generalizations","authors":"Shion Samadder Chaudhury","doi":"10.1007/s11128-024-04538-z","DOIUrl":null,"url":null,"abstract":"<div><p>The Internet of Things, smart grids, etc. contain processors, sensors, and communication hardware that exchange information with other devices in the network and act on the acquired information. These generate huge amounts of data which are stored in cloud/edge servers managed by third parties and are exposed to the internet. The data often include sensitive information, and the protection of such privacy-sensitive data is important. Attribute-based encryption is one of the most popular methods to address security and privacy challenges encountered in such cases. However, most of the existing classical attribute-based schemes are not secure against quantum attacks and can be broken using Shor’s algorithm. Given this, secure (single-authority) quantum attribute-based schemes have been recently studied. To the best of our knowledge, quantum multi-authority attribute-based schemes have not received much attention and are missing in the literature. Here, we propose a novel construction of a quantum multi-authority attribute-based encryption scheme. The privacy of the encryption scheme is derived using trap codes and quantum secret-sharing schemes. Our construction is based on discrete-time quantum walks and is shown to be portable and usable in several variants of multi-authority schemes. We also demonstrate quantum advantage in terms of computational cost.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":null,"pages":null},"PeriodicalIF":2.2000,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information Processing","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1007/s11128-024-04538-z","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
引用次数: 0

Abstract

The Internet of Things, smart grids, etc. contain processors, sensors, and communication hardware that exchange information with other devices in the network and act on the acquired information. These generate huge amounts of data which are stored in cloud/edge servers managed by third parties and are exposed to the internet. The data often include sensitive information, and the protection of such privacy-sensitive data is important. Attribute-based encryption is one of the most popular methods to address security and privacy challenges encountered in such cases. However, most of the existing classical attribute-based schemes are not secure against quantum attacks and can be broken using Shor’s algorithm. Given this, secure (single-authority) quantum attribute-based schemes have been recently studied. To the best of our knowledge, quantum multi-authority attribute-based schemes have not received much attention and are missing in the literature. Here, we propose a novel construction of a quantum multi-authority attribute-based encryption scheme. The privacy of the encryption scheme is derived using trap codes and quantum secret-sharing schemes. Our construction is based on discrete-time quantum walks and is shown to be portable and usable in several variants of multi-authority schemes. We also demonstrate quantum advantage in terms of computational cost.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于属性的高效量子多授权加密与推广
物联网、智能电网等包含处理器、传感器和通信硬件,可与网络中的其他设备交换信息,并根据获取的信息采取行动。这些设备会产生大量数据,这些数据存储在由第三方管理的云/边缘服务器中,并暴露在互联网上。这些数据通常包括敏感信息,因此保护这些隐私敏感数据非常重要。基于属性的加密是解决此类情况下遇到的安全和隐私挑战的最常用方法之一。然而,现有的大多数基于属性的经典方案都不能安全地抵御量子攻击,而且可以用肖尔算法破解。有鉴于此,人们最近开始研究安全的(单一授权)基于属性的量子方案。据我们所知,基于多授权属性的量子方案还没有得到广泛关注,在文献中也没有出现。在这里,我们提出了一种基于属性的量子多授权加密方案的新构造。加密方案的隐私性是通过陷阱代码和量子秘密共享方案得出的。我们的构造基于离散时间量子行走,并证明其可移植性,可用于多种变体的多授权方案。我们还证明了量子在计算成本方面的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Quantum Information Processing
Quantum Information Processing 物理-物理:数学物理
CiteScore
4.10
自引率
20.00%
发文量
337
审稿时长
4.5 months
期刊介绍: Quantum Information Processing is a high-impact, international journal publishing cutting-edge experimental and theoretical research in all areas of Quantum Information Science. Topics of interest include quantum cryptography and communications, entanglement and discord, quantum algorithms, quantum error correction and fault tolerance, quantum computer science, quantum imaging and sensing, and experimental platforms for quantum information. Quantum Information Processing supports and inspires research by providing a comprehensive peer review process, and broadcasting high quality results in a range of formats. These include original papers, letters, broadly focused perspectives, comprehensive review articles, book reviews, and special topical issues. The journal is particularly interested in papers detailing and demonstrating quantum information protocols for cryptography, communications, computation, and sensing.
期刊最新文献
Comment on “quantum identity authentication with single photon” QUBO formulation for aircraft load optimization Error correction using squeezed Fock states Simple exact quantum search Asymmetric bidirectional quantum 2\(\Leftrightarrow \)3 qubit teleportation via seven-qubit entangled state
×
引用
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