We propose a verifiable (k, l)-threshold quantum secret sharing (QSS) scheme using symmetric multivariate polynomials and mutually unbiased bases. The scheme enables secure quantum state distribution with identity authentication and dishonest participant detection. Classical and quantum shares are combined to ensure integrity and verifiability. It resists standard quantum attacks including intercept-resend, collusion, entangle measure attack and participant attack. The design is efficient, scalable, and suitable for practical quantum networks.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Verifiable (k, l)-Threshold Quantum Secret Sharing Using Multivariate Polynomials

  • Darshana Yadav

摘要

We propose a verifiable (k, l)-threshold quantum secret sharing (QSS) scheme using symmetric multivariate polynomials and mutually unbiased bases. The scheme enables secure quantum state distribution with identity authentication and dishonest participant detection. Classical and quantum shares are combined to ensure integrity and verifiability. It resists standard quantum attacks including intercept-resend, collusion, entangle measure attack and participant attack. The design is efficient, scalable, and suitable for practical quantum networks.