A verifiable ( t , n ) threshold quantum state sharing scheme on IBM quantum cloud platform
- PDF / 491,655 Bytes
- 21 Pages / 439.37 x 666.142 pts Page_size
- 76 Downloads / 192 Views
A verifiable (t, n) threshold quantum state sharing scheme on IBM quantum cloud platform Xiuli Song1
· Yanbing Liu1 · Min Xiao1 · Hongyao Deng2 · Shuai Yang1
Received: 5 August 2019 / Accepted: 25 August 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract In current verifiable quantum state sharing schemes, the dishonest behaviors of certain participants can be verified. However, these schemes have either high resource consumption, low verification efficiency or lack simulation implementations. To compensate for the shortcomings of current schemes, a new verifiable (t, n) threshold quantum state sharing scheme on the IBM quantum cloud platform is proposed. To reduce resource consumption, the proposed scheme prepares only one secret particle and then performs the Lagrange unitary operator on it, and the transformed secret particle is shared in the authorized subset of participants. To improve verification efficiency, the scheme performs the composite rotation unitary operator on the received message particle, such that it not only verifies the validity of the message particle but also reconstructs the original secret particle. The correctness of the proposed scheme is verified by not only mathematic proof but also experimental simulation on the IBM quantum cloud platform. Compared with the two other schemes based on the rotation unitary operator, the proposed scheme provides stronger verification security by using the private shadow key and rotation key. Compared with the two other schemes based on the verification mechanism, the proposed scheme has lower resource consumption and higher verification efficiency. Keywords (t, n) threshold · Verifiable quantum state sharing · Rotation unitary operator · Lagrange unitary operator · Quantum cloud platform
B
Xiuli Song [email protected]
1
Chongqing Key Laboratory of Network Information Security Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China
2
College of Computer Information and Engineering, Yangtze Normal University, Chongqing 408100, China 0123456789().: V,-vol
123
337
Page 2 of 21
X. Song et al.
1 Introduction As an important aspect of quantum cryptography, quantum secret sharing (QSS) splits a secret message into shares with a share generation algorithm and recovers the secret message with a secret reconstruction algorithm. If some participants are absent or dishonest or their shares are under attack, then the remaining participants work together to reconstruct the original secret. The security of quantum secret sharing is based on physical theories, such as the Heisenberg uncertainty principle and the quantum nocloning theorem, which detect eavesdropping attacks in quantum channels. By using the Greenberger–Horne–Zeilinger (GHZ) state, Hillery et al. [1] proposed the QSS scheme first in 1999. Since then, many QSS schemes have been proposed, and QSS has become a research hotspot in quantum cryptography. Certain QSS schemes are of the (n, n) threshold type and require all particip
Data Loading...
