|
|
|
Efficient semi-quantum secret sharing protocol using single particles |
| Ding Xing(邢丁)1, Yifei Wang(王艺霏)1, Zhao Dou(窦钊)1,†, Jian Li(李剑)2, Xiubo Chen(陈秀波)1, and Lixiang Li(李丽香)1 |
1 Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China;
2 Information Security Center, School of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing 100876, China |
|
|
|
|
Abstract Semi-quantum secret sharing (SQSS) is a branch of quantum cryptography which only requires the dealer to have quantum capabilities, reducing the difficulty of protocol implementation. However, the efficiency of the SQSS protocol still needs to be further studied. In this paper, we propose a semi-quantum secret sharing protocol, whose efficiency can approach 100% as the length of message increases. The protocol is based on single particles to reduce the difficulty of resource preparation. Particle reordering, a simple but effective operation, is used in the protocol to improve efficiency and ensure security. Furthermore, our protocol can share specific secrets while most SQSS protocols could not. We also prove that the protocol is secure against common attacks.
|
Received: 02 April 2023
Revised: 21 June 2023
Accepted manuscript online: 25 June 2023
|
|
PACS:
|
03.67.Dd
|
(Quantum cryptography and communication security)
|
| |
03.67.Ac
|
(Quantum algorithms, protocols, and simulations)
|
| |
03.67.Hk
|
(Quantum communication)
|
|
| Fund: Project supported by the National Key Research and Development Program of China (Grant No. 2020YFB1805405), the 111 Project (Grant No. B21049), the National Natural Science Foundation of China (Grant No. 62272051), the Foundation of Guizhou Provincial Key Laboratory of Public Big Data (Grant No. 2019BDKFJJ014), and the Fundamental Research Funds for the Central Universities of China (Grant Nos. 2019XD-A02 and 2020RC38). |
Corresponding Authors:
Zhao Dou
E-mail: dou@bupt.edu.cn
|
Cite this article:
Ding Xing(邢丁), Yifei Wang(王艺霏), Zhao Dou(窦钊), Jian Li(李剑),Xiubo Chen(陈秀波), and Lixiang Li(李丽香) Efficient semi-quantum secret sharing protocol using single particles 2023 Chin. Phys. B 32 070308
|
[1] Shamir A 1979 Commun. ACM 22 612
[2] Blakley G R 1979 1979 International Workshop on Managing Requirements Knowledge, June 4-7, 1979, New York, USA, p. 313
[3] Brickell E F 1990 Workshop on the Theory and Application of Cryptographic Techniques, April 10–13, 1989, Houthalen, Belgium, p. 468
[4] Brickell E F and Davenport D M 1991 J. Cryptol. 4 123
[5] Chuang I L and Yamamoto Y 1995 Phys. Rev. A 52 3489
[6] Plenio M B and Knight P L 1996 Phys. Rev. A 53 2986
[7] Hillery M, Bužek V and Berthiaume A 1999 Phys. Rev. A 59 1829
[8] Gottesman D 2000 Phys. Rev. A 61 042311
[9] Guo G P and Guo G C 2003 Phys. Lett. A 310 247
[10] Xiao L, Long G L, Deng F G and Pan J W 2004 Phys. Rev. A 69 052307
[11] Hsieh C R and Tzonelih H 2010 Commun. Theor. Phys. 54 1019
[12] Liu Z H, Chen H W, Xu J, Liu W J and Li Z Q 2012 Quantum Inf. Process. 11 1785
[13] Wang M M, Wang W, Chen J G and Farouk A 2015 Quantum Inf. Process. 14 4211
[14] Qin H, Zhu X and Dai Y 2015 Quantum Inf. Process. 14 2997
[15] Grice W P and Qi B 2019 Phys. Rev. A 100 022339
[16] Boyer M, Kenigsberg D and Mor T 2007 2007 First International Conference on Quantum, Nano, and Micro Technologies, January 2-6, 2007, Guadeloupe, French Caribbean, p. 10
[17] Boyer M, Gelles R, Kenigsberg D and Mor T 2009 Phys. Rev. A 79 032341
[18] Zou X, Qiu D, Li L, Wu L and Li L 2009 Phys. Rev. A 79 052312
[19] Wang M M, Gong L M and Shao L H 2019 Quantum Inf. Process. 18 260
[20] Shukla C, Thapliyal K and Pathak A 2017 Quantum Inf. Process. 16 295
[21] Zou X F and Qiu D W 2014 Sci. China Phys. Mech. 57 1696
[22] Yang C W and Tsai C W 2020 Quantum Inf. Process. 19 126
[23] Lin P H, Hwang T and Tsai C W 2019 Quantum Inf. Process. 18 207
[24] Jiang L Z 2020 Quantum Inf. Process. 19 180
[25] Ye C Q, Li J, Chen X B and Tian Y 2021 Quantum Inf. Process. 20 262
[26] Li Q, Chan W H and Long D Y 2010 Phys. Rev. A 82 022303
[27] Wang J, Zhang S, Zhang Q and Tang C J 2012 Int. J. Quantum Inf. 10 1250050
[28] Li L, Qiu D and Mateus P 2013 J. Phys. A Math. Theor. 46 045304
[29] Xie C, Li L and Qiu D 2015 Int. J. Theor. Phys. 54 3819
[30] Li Z, Li Q, Liu C, Peng Y, Chan W H and Li L 2018 Quantum Inf. Process. 17 285
[31] Ye C Q and Ye T Y 2018 Commun. Theor. Phys. 70 661
[32] Tian Y, Li J, Chen X B, Ye C Q and Li H J 2021 Quantum Inf. Process. 20 217
[33] Gisin N, Fasel S, Kraus B, Zbinden H and Ribordy G 2006 Phys. Rev. A 73 022320
[34] Deng F G, Li X H, Zhou H Y and Zhang Z J 2005 Phys. Rev. A 72 044302 |
| No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|
