Quantum multiparty cryptosystems based on a homomorphic random basis encryption
- PDF / 612,787 Bytes
- 14 Pages / 439.37 x 666.142 pts Page_size
- 43 Downloads / 197 Views
Quantum multiparty cryptosystems based on a homomorphic random basis encryption Changbin Lu1 · Fuyou Miao1 · Junpeng Hou2 · Zhaofeng Su1 · Yan Xiong1 Received: 13 April 2020 / Accepted: 27 July 2020 © Springer Science+Business Media, LLC, part of Springer Nature 2020
Abstract Quantum information processing protocols have great advantages over their classical counterparts, especially on cryptography. Homomorphic encryption (HE) schemes enable processing encrypted data without decrypting them. In this paper, we study a quantum version of the HE scheme (iacr-ePrint/2019/1023) and improve it with flexible parties. Furthermore, we propose a threshold quantum secret scheme since multiparty cryptosystem is more practical due to its flexibility. These two schemes only require sequential decryption of quantum states. As a result, both schemes are information theoretically secure, perfectly correct and support homomorphism in a fully compact and non-interactive way. Finally, they are tested and verified on the IBM Q Experience platform. Keywords Quantum cryptography · Homomorphic encryption · Multiparty cryptograph · Quantum secret sharing
B
Fuyou Miao [email protected] Changbin Lu [email protected] Junpeng Hou [email protected] Zhaofeng Su [email protected] Yan Xiong [email protected]
1
School of Computer Science and Technology, University of Science and Technology of China, Hefei, China
2
Department of Physics, The University of Texas at Dallas, Richardson, 75080-3021 TX, USA 0123456789().: V,-vol
123
293
Page 2 of 14
C. Lu et al
1 Introduction It is well known that a fully quantum theory of information and information processing offers, among other benefits, a brand of cryptography with security based on fundamental physics, and a reasonable hope of implementing quantum computers that could speed up the solution of certain mathematical problems [1]. These benefits come from distinctive quantum properties such as superposition, entanglement, and nonlocality [2,3] which do not exist in classical mechanics. In the last four decades, many important quantum information processing protocols have been proposed, including quantum key distribution (QKD) [4], quantum teleportation [5], quantum factoring algorithm [6] and Grover search algorithm [7]. Quantum cryptography is one of the most successful applications in quantum information processing since physical laws ensure its inherent security. Contrarily, classical cryptography usually relies on the assumptions of computational complexity. The first quantum cryptosystem is quantum key distribution which is used to generate random secret keys that are only shared by two parties [4]. Later, quantum cryptography has been extensively studied and many protocols are proposed [8–15]. The homomorphic encryption (HE) scheme enables processing of encrypted data without decrypting them in advance. This useful feature was known for over 30 years. In 2009, Craig Gentry [16] introduced the first plausible and achievable fully homomorphic encryption (FHE) scheme , which supp
Data Loading...
