A threshold changeable dynamic quantum secret sharing scheme with cheating identification

IF 2.2 3区 物理与天体物理 Q1 PHYSICS, MATHEMATICAL Quantum Information Processing Pub Date : 2024-10-21 DOI:10.1007/s11128-024-04572-x
Fulin Li, Qingao Wu, Changlu Lin, Shixin Zhu
{"title":"A threshold changeable dynamic quantum secret sharing scheme with cheating identification","authors":"Fulin Li,&nbsp;Qingao Wu,&nbsp;Changlu Lin,&nbsp;Shixin Zhu","doi":"10.1007/s11128-024-04572-x","DOIUrl":null,"url":null,"abstract":"<div><p>Quantum secret sharing holds an important place in quantum cryptography. In this paper, a threshold changeable dynamic quantum secret sharing scheme with cheating identification is firstly proposed based on the Chinese Remainder Theorem. On the premise of not altering the shared secret and the private shares of the original participants, our scheme realizes the dynamic updating of participants and for the first time achieves the changeable threshold in the quantum environment, which greatly improves the flexibility and practicality of the scheme. In addition, we generalize the entanglement swapping equations of Bell states in 2-dimension to <i>d</i>-dimension. During the reconstruction phase, our scheme can timely detect and identify the cheating behaviors based on the randomized components and the entanglement swapping equations of <i>d</i>-dimensional Bell states. Meanwhile, the randomized components ensure privacy protection for shares and avoid the interference of invalid shares when recovering the secret. Security analysis shows that our scheme is resistant to not only a series of typical external attacks but also forgery, collusion, and dishonest revoked participant attacks. Compared with the existing schemes, our scheme is not only more secure and efficient but also has lower computational consumption.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2024-10-21","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-04572-x","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
引用次数: 0

Abstract

Quantum secret sharing holds an important place in quantum cryptography. In this paper, a threshold changeable dynamic quantum secret sharing scheme with cheating identification is firstly proposed based on the Chinese Remainder Theorem. On the premise of not altering the shared secret and the private shares of the original participants, our scheme realizes the dynamic updating of participants and for the first time achieves the changeable threshold in the quantum environment, which greatly improves the flexibility and practicality of the scheme. In addition, we generalize the entanglement swapping equations of Bell states in 2-dimension to d-dimension. During the reconstruction phase, our scheme can timely detect and identify the cheating behaviors based on the randomized components and the entanglement swapping equations of d-dimensional Bell states. Meanwhile, the randomized components ensure privacy protection for shares and avoid the interference of invalid shares when recovering the secret. Security analysis shows that our scheme is resistant to not only a series of typical external attacks but also forgery, collusion, and dishonest revoked participant attacks. Compared with the existing schemes, our scheme is not only more secure and efficient but also has lower computational consumption.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有作弊识别功能的阈值可变动态量子秘密共享方案
量子秘密共享在量子密码学中占有重要地位。本文基于中文余数定理,首次提出了一种具有作弊识别功能的阈值可变动态量子秘密共享方案。在不改变共享秘密和原参与者私有份额的前提下,我们的方案实现了参与者的动态更新,并首次在量子环境下实现了阈值可变,大大提高了方案的灵活性和实用性。此外,我们还将二维贝尔态的纠缠交换方程推广到了 d 维。在重构阶段,我们的方案可以根据随机分量和 d 维贝尔态的纠缠交换方程及时发现和识别作弊行为。同时,随机化组件确保了份额的隐私保护,并避免了在恢复秘密时无效份额的干扰。安全性分析表明,我们的方案不仅能抵御一系列典型的外部攻击,还能抵御伪造、串通和不诚实的撤销参与者攻击。与现有方案相比,我们的方案不仅更安全、更高效,而且计算消耗更低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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.
期刊最新文献
Some constructions of quantum subsystem codes m-Photon-added squeezed vacuum states of the para-Bose oscillator algebra A review on quantum Fourier transform On the construction of quantum circuits for S-boxes with different criteria based on the SAT solver Fidelity of the sum of independent quantum computing errors
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1