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 in:Quantum information processing 2018-11, Vol.17 (11), p.1-13, Article 310
Main Authors: Lu, Changbin, Miao, Fuyou, Hou, Junpeng, Meng, Keju
Format: Article
Language:English
Subjects:
Communications systems
Data Structures and Information Theory
Eavesdropping
Mathematical Physics
Physics
Physics and Astronomy
Quantum Computing
Quantum cryptography
Quantum Information Technology
Quantum Physics
Quantum theory
Spintronics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
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