A verifiable (t, n) threshold quantum state sharing scheme on IBM quantum cloud platform

被引:2
作者
Song, Xiuli [1 ]
Liu, Yanbing [1 ]
Xiao, Min [1 ]
Deng, Hongyao [2 ]
Yang, Shuai [1 ]
机构
[1] Chongqing Univ Posts & Telecommun, Chongqing Key Lab Network Informat Secur Technol, Chongqing 400065, Peoples R China
[2] Yangtze Normal Univ, Coll Comp Informat & Engn, Chongqing 408100, Peoples R China
基金
中国国家自然科学基金;
关键词
(t; n) threshold; Verifiable quantum state sharing; Rotation unitary operator; Lagrange unitary operator; Quantum cloud platform; MULTIPARTY;
D O I
10.1007/s11128-020-02846-8
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
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.
引用
收藏
页数:21
相关论文
共 50 条
[31]   Polynomial differential-based strong (n, t, n)-verifiable secret sharing [J].
Al Mahmoud, Qassim .
IET INFORMATION SECURITY, 2013, 7 (04) :312-317
[32]   A flexible framework for (n,n) quantum secret sharing [J].
Tseng, Kuo-Chun ;
Lee, Wei-Lin ;
Chen, Chi-Yuan ;
Tsai, Chia-Wei .
MODERN PHYSICS LETTERS A, 2025,
[33]   Verifiable Quantum Secret Sharing Protocols Based on Four-Qubit Entangled States [J].
Cao, Wei-Feng ;
Yang, Yu-Guang .
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2019, 58 (04) :1202-1214
[34]   Verifiable Multi-party Quantum Key Agreement with Cluster State [J].
Lu D.-J. ;
Li Z.-H. ;
Yan C.-H. ;
Liu L. .
Ruan Jian Xue Bao/Journal of Software, 2022, 33 (12) :4804-4815
[35]   Multi-dimensional quantum state sharing based on quantum Fourier transform [J].
Qin, Huawang ;
Tso, Raylin ;
Dai, Yuewei .
QUANTUM INFORMATION PROCESSING, 2018, 17 (03)
[36]   Towards Attack and Defense Views to (t, n)-threshold Secret Sharing Scheme Using Information Theory [J].
Yang, Ze ;
Tian, Youliang .
2021 INTERNATIONAL CONFERENCE ON NETWORKING AND NETWORK APPLICATIONS, NANA, 2021, :52-58
[37]   Design and Simulation of d Dimensional (t, n) Threshold Quantum Homomorphic Encryption Algorithm [J].
Song X.-L. ;
Zhou D.-Y. ;
Wen A.-J. .
Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2020, 48 (05) :846-853
[38]   Quantum state sharing against the controller's cheating [J].
Shi, Run-hua ;
Zhong, Hong ;
Huang, Liu-sheng .
QUANTUM INFORMATION PROCESSING, 2013, 12 (08) :2889-2899
[39]   Secret image hiding and sharing based on the (t, n)-threshold [J].
Chang, Chin-Chen ;
Lin, Chih-Yang ;
Tseng, Chun-Sen .
FUNDAMENTA INFORMATICAE, 2007, 76 (04) :399-411
[40]   Quantum (t, n) threshold signature based on logistic chaotic sequences and mutually unbiased bases [J].
Zhang, Yaodong ;
Fang, Hailan ;
Liu, Feng .
QUANTUM INFORMATION PROCESSING, 2024, 23 (04)