{"title":"具有 (m, n) 门限的量子秘密共享:QFT 和身份验证","authors":"Priyanka Mawlia, Vikash Siwach, Pankaj Bijaranian, Deepak Singh","doi":"10.1007/s11128-024-04532-5","DOIUrl":null,"url":null,"abstract":"<div><p>In the field of quantum cryptography, quantum secret sharing (QSS) holds substantial importance, with identity authentication emerging as a key strategy for safeguarding information. It efficiently certifies the identification of both persons involved in the conversation, which contributes to increased security measures. Our proposed, <span>\\((m, n)\\)</span> threshold quantum secret sharing (QSS) scheme introduces a unique approach to mutual identity authentication, utilizing mutually unbiased bases. Alice employs a symmetric bivariate polynomial to distribute the secret share among all participants in this algorithm. For secret reconstruction, a trusted participant, <span>\\({Bob}_{1}\\)</span>, shares a GHZ state with a qualified group of <span>\\(m\\)</span> participants, including himself. Each participant applies QFT and a unitary transformation (related to their part of the shared secret) on their particle. During the secret recovery phase, the scheme ensures that secrets exclusively held by participants remain undisclosed and are not transmitted, reinforcing the security of the communication process. As a result, external eavesdroppers are left empty-handed in their attempt to access information about secrets during this phase. Our protocol surpasses in terms of security, effectiveness, and practicality, proving its resilience against intercept–resend attacks, collision attacks, collective attacks, entangle-measure attacks, and forgery attacks according to a comprehensive security analysis.</p></div>","PeriodicalId":746,"journal":{"name":"Quantum Information Processing","volume":"23 10","pages":""},"PeriodicalIF":2.2000,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quantum secret sharing with (m, n) threshold: QFT and identity authentication\",\"authors\":\"Priyanka Mawlia, Vikash Siwach, Pankaj Bijaranian, Deepak Singh\",\"doi\":\"10.1007/s11128-024-04532-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In the field of quantum cryptography, quantum secret sharing (QSS) holds substantial importance, with identity authentication emerging as a key strategy for safeguarding information. It efficiently certifies the identification of both persons involved in the conversation, which contributes to increased security measures. Our proposed, <span>\\\\((m, n)\\\\)</span> threshold quantum secret sharing (QSS) scheme introduces a unique approach to mutual identity authentication, utilizing mutually unbiased bases. Alice employs a symmetric bivariate polynomial to distribute the secret share among all participants in this algorithm. For secret reconstruction, a trusted participant, <span>\\\\({Bob}_{1}\\\\)</span>, shares a GHZ state with a qualified group of <span>\\\\(m\\\\)</span> participants, including himself. Each participant applies QFT and a unitary transformation (related to their part of the shared secret) on their particle. During the secret recovery phase, the scheme ensures that secrets exclusively held by participants remain undisclosed and are not transmitted, reinforcing the security of the communication process. As a result, external eavesdroppers are left empty-handed in their attempt to access information about secrets during this phase. Our protocol surpasses in terms of security, effectiveness, and practicality, proving its resilience against intercept–resend attacks, collision attacks, collective attacks, entangle-measure attacks, and forgery attacks according to a comprehensive security analysis.</p></div>\",\"PeriodicalId\":746,\"journal\":{\"name\":\"Quantum Information Processing\",\"volume\":\"23 10\",\"pages\":\"\"},\"PeriodicalIF\":2.2000,\"publicationDate\":\"2024-10-16\",\"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-04532-5\",\"RegionNum\":3,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"PHYSICS, MATHEMATICAL\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information Processing","FirstCategoryId":"101","ListUrlMain":"https://link.springer.com/article/10.1007/s11128-024-04532-5","RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"PHYSICS, MATHEMATICAL","Score":null,"Total":0}
Quantum secret sharing with (m, n) threshold: QFT and identity authentication
In the field of quantum cryptography, quantum secret sharing (QSS) holds substantial importance, with identity authentication emerging as a key strategy for safeguarding information. It efficiently certifies the identification of both persons involved in the conversation, which contributes to increased security measures. Our proposed, \((m, n)\) threshold quantum secret sharing (QSS) scheme introduces a unique approach to mutual identity authentication, utilizing mutually unbiased bases. Alice employs a symmetric bivariate polynomial to distribute the secret share among all participants in this algorithm. For secret reconstruction, a trusted participant, \({Bob}_{1}\), shares a GHZ state with a qualified group of \(m\) participants, including himself. Each participant applies QFT and a unitary transformation (related to their part of the shared secret) on their particle. During the secret recovery phase, the scheme ensures that secrets exclusively held by participants remain undisclosed and are not transmitted, reinforcing the security of the communication process. As a result, external eavesdroppers are left empty-handed in their attempt to access information about secrets during this phase. Our protocol surpasses in terms of security, effectiveness, and practicality, proving its resilience against intercept–resend attacks, collision attacks, collective attacks, entangle-measure attacks, and forgery attacks according to a comprehensive security analysis.
期刊介绍:
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.