A (t, n) threshold quantum secret sharing with authentication based on single photons

IF 2.2 3区 物理与天体物理 Q1 PHYSICS, MATHEMATICAL Quantum Information Processing Pub Date : 2025-02-18 DOI:10.1007/s11128-025-04672-2
Jie Zhang, Jie Zhang, Sujuan Qin, Zhengping Jin
{"title":"A (t, n) threshold quantum secret sharing with authentication based on single photons","authors":"Jie Zhang,&nbsp;Jie Zhang,&nbsp;Sujuan Qin,&nbsp;Zhengping Jin","doi":"10.1007/s11128-025-04672-2","DOIUrl":null,"url":null,"abstract":"<div><p>Secret sharing has become a important cryptographic primitive and been widely used. And quantum secret sharing is a quantum approach to achieve secret sharing. The (<i>t</i>, <i>n</i>) threshold quantum secret sharing requires only t participants out of n to cooperate to recover the secret, which is more flexible than the (<i>n</i>, <i>n</i>) scheme. However, most (<i>t</i>, <i>n</i>) threshold schemes basically involve quantum entanglement, and the preparation of entangled states as well as entanglement swapping are relatively complex. In this paper, we propose a (<i>t</i>, <i>n</i>) threshold quantum secret sharing scheme with authentication by using the Lagrange interpolation polynomial based on single photons. Unlike other (<i>t</i>, <i>n</i>) threshold schemes, it does not involve entangled states or entanglement swapping. And the distributor authenticate the participants without revealing the full identity key. In addition, secret sharing is based on Lagrange interpolation polynomial implementation, allowing any t participants to recover the secret. Analysis shows that the scheme can resist external eavesdroppers and dishonest participants. Compared with other schemes, this scheme has the following advantages: (1) it is easy to implement; (2) the (<i>t</i>, <i>n</i>) threshold scheme increases the flexibility of the scheme; (3) the identity key can be reused. \n</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"24 2","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2025-02-18","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-025-04672-2","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
引用次数: 0

Abstract

Secret sharing has become a important cryptographic primitive and been widely used. And quantum secret sharing is a quantum approach to achieve secret sharing. The (tn) threshold quantum secret sharing requires only t participants out of n to cooperate to recover the secret, which is more flexible than the (nn) scheme. However, most (tn) threshold schemes basically involve quantum entanglement, and the preparation of entangled states as well as entanglement swapping are relatively complex. In this paper, we propose a (tn) threshold quantum secret sharing scheme with authentication by using the Lagrange interpolation polynomial based on single photons. Unlike other (tn) threshold schemes, it does not involve entangled states or entanglement swapping. And the distributor authenticate the participants without revealing the full identity key. In addition, secret sharing is based on Lagrange interpolation polynomial implementation, allowing any t participants to recover the secret. Analysis shows that the scheme can resist external eavesdroppers and dishonest participants. Compared with other schemes, this scheme has the following advantages: (1) it is easy to implement; (2) the (tn) threshold scheme increases the flexibility of the scheme; (3) the identity key can be reused.

查看原文
分享 分享
微信好友 朋友圈 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.
期刊最新文献
Counterfactual controlled quantum dialogue protocol Underwater continuous-variable quantum key distribution with faster-than-Nyquist scheme Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms A (t, n) threshold quantum secret sharing with authentication based on single photons Twin-field quantum key distribution based on particle swarm optimization algorithm
×
引用
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