A d-dimensional Efficient and Verifiable Quantum Multi-secret Sharing Scheme

Abstract

Quantum secret sharing plays a crucial role in quantum cryptography. In this paper, we propose an efficient and verifiable quantum multi-secret sharing scheme based on the general access structure in d-dimensional Hilbert space. By utilizing special entangled state and linear multi-secret sharing, our scheme not only shares multiple secrets simultaneously, but also significantly reduces the cost of preparing and storing quantum states. These characteristics means that our scheme has high communication efficiency and practicality. Then, in the reconstruction phase, participants only need to perform basic measurement operations to successfully recover the secrets without involving complex unitary operations, which greatly reduces the computational cost. Security analysis shows that this scheme can effectively resist a series of typical attacks. In summary, compared with existing schemes, our scheme is more efficient while maintains secure.