|
|
|
Quantum circuit-based proxy blind signatures: A novel approach and experimental evaluation on the IBM quantum cloud platform |
| Xiaoping Lou(娄小平), Huiru Zan(昝慧茹), and Xuejiao Xu(徐雪娇)† |
| College of Information Science and Engineering, Hunan Normal University, Changsha 410081, China |
|
|
|
|
Abstract This paper presents a novel approach to proxy blind signatures in the realm of quantum circuits, aiming to enhance security while safeguarding sensitive information. The main objective of this research is to introduce a quantum proxy blind signature (QPBS) protocol that utilizes quantum logical gates and quantum measurement techniques. The QPBS protocol is constructed by the initial phase, proximal blinding message phase, remote authorization and signature phase, remote validation, and de-blinding phase. This innovative design ensures a secure mechanism for signing documents without revealing the content to the proxy signer, providing practical security authentication in a quantum environment under the assumption that the CNOT gates are securely implemented. Unlike existing approaches, our proposed QPBS protocol eliminates the need for quantum entanglement preparation, thus simplifying the implementation process. To assess the effectiveness and robustness of the QPBS protocol, we conduct comprehensive simulation studies in both ideal and noisy quantum environments on the IBM quantum cloud platform. The results demonstrate the superior performance of the QPBS algorithm, highlighting its resilience against repudiation and forgeability, which are key security concerns in the realm of proxy blind signatures. Furthermore, we have established authentic security thresholds (82.102%) in the presence of real noise, thereby emphasizing the practicality of our proposed solution.
|
Received: 08 October 2023
Revised: 16 January 2024
Accepted manuscript online: 26 January 2024
|
|
PACS:
|
03.67.Dd
|
(Quantum cryptography and communication security)
|
| |
03.67.-a
|
(Quantum information)
|
|
| Fund: Project supported by the General Project of Natural Science Foundation of Hunan Province (Grant Nos. 2024JJ5273 and 2023JJ50328) and the Scientific Research Project of Education Department of Hunan Province (Grant Nos. 22A0049 and 22B0699). |
Corresponding Authors:
Xuejiao Xu
E-mail: xuxuejiao@hunnu.edu.cn
|
Cite this article:
Xiaoping Lou(娄小平), Huiru Zan(昝慧茹), and Xuejiao Xu(徐雪娇) Quantum circuit-based proxy blind signatures: A novel approach and experimental evaluation on the IBM quantum cloud platform 2024 Chin. Phys. B 33 050307
|
[1] Rivest R L, Shamir A and Adleman L 1983 Communications of the ACM 26 96
[2] Grover L K 1996 Proc. 28th Annu. ACM Symp. on Theory of Computing, May 22-24, 1996, New York, US, p. 212
[3] Shor P W 1999 SIAM Review 41 303
[4] Bennett C H and Wiesner S J 1992 Phys. Rev. Lett. 69 2881
[5] Gong L H, Song H C, He C S, Liu Y and Zhou N R 2014 Physica Scripta 89 035101
[6] Wang J, Li L, Peng H and Yang Y 2017 Phys. Rev. A 95 022320
[7] Ouyang Y, Tan S H, Zhao L and Fitzsimons J F 2017 Phys. Rev. A 96 052333
[8] Long G L and Liu X S 2002 Phys. Rev. A 65 032302
[9] Cao Z W, Feng X Y, Peng, J Y, Zeng G H and Qi X F 2015 Int. J. Theor. Phys. 54 1871
[10] Zeng G and Keitel C H 2002 Phys. Rev. A 65 042312
[11] Mambo M, Usuda K and Okamoto E 1996 IEICE Trans. Fund. Electr. 79 1338
[12] Chaum D, Rivest R L and Sherman A T 1983 Advances in Cryptology: Proceedings of CRYPTO ’82 August 23-25, 1982, Boston, US, p. 199
[13] Chen Y Z, Liu Y and Wen X J 2011 Chin. J. Quant. Elect. 28 341
[14] Wang H, Shi R H, Zhong H, Cui J, Zhang S and Wang K T 2016 Chin. J. Quant. Elect. 33 35
[15] Zeng C, Zhang J Z and Xie S C 2017 Chin. J. Compu. Syste. 38 1485
[16] Zhang J L, Zhang J Z and Xie S C 2018 Int. J. Theor. Phys. 57 1612
[17] Niu X F, Zhang J Z and Xie S C 2018 Commun. Theor. Phys. 70 043
[18] Zhou B M, Lin L D, Wang W and Liu Y 2020 Int. J. Theor. Phys. 59 465
[19] Luo Q, Zhang T, Huang X and Jing N 2022 Entropy 24 1421
[20] Nielsen M A and Chuang I L 2010 Quantum computation and quantum information (New York: Cambridge university press) pp. 15-45 |
| 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
|
|
|
