Verifiable threshold quantum secret sharing with sequential communication

A ( t , n ) threshold quantum secret sharing (QSS) is proposed based on a single d -level quantum system. It enables the ( t , n ) threshold structure based on Shamir’s secret sharing and simply requires sequential communication in d -level quantum system to recover secret. Besides, the scheme provi...

Full description

Saved in:
Bibliographic Details
Published inQuantum information processing Vol. 17; no. 11; pp. 1 - 13
Main Authors Lu, Changbin, Miao, Fuyou, Hou, Junpeng, Meng, Keju
Format Journal Article
LanguageEnglish
Published New York Springer US 01.11.2018
Springer Nature B.V
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:A ( t , n ) threshold quantum secret sharing (QSS) is proposed based on a single d -level quantum system. It enables the ( t , n ) threshold structure based on Shamir’s secret sharing and simply requires sequential communication in d -level quantum system to recover secret. Besides, the scheme provides a verification mechanism which employs an additional qudit to detect cheats and eavesdropping during secret reconstruction and allows a participant to use the share repeatedly. Analyses show that the proposed scheme is resistant to typical attacks. Moreover, the scheme is scalable in participant number and easier to realize compared to related schemes. More generally, our scheme also presents a generic method to construct new ( t , n ) threshold QSS schemes based on d -level quantum system from other classical threshold secret sharing.
ISSN:1570-0755
1573-1332
DOI:10.1007/s11128-018-2059-7