|
Special Issue:
SPECIAL TOPIC — Quantum computation and quantum simulation
|
| SPECIAL TOPIC—Quantum computation and quantum simulation |
Prev
Next
|
|
|
Universal quantum circuit evaluation on encrypted data using probabilistic quantum homomorphic encryption scheme |
| Jing-Wen Zhang(张静文)1, Xiu-Bo Chen(陈秀波)1, Gang Xu(徐刚)2,†, and Yi-Xian Yang(杨义先)1 |
1 Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China;
2 School of Information Science and Technology, North China University of Technology, Beijing 100144, China |
|
|
|
|
Abstract Homomorphic encryption has giant advantages in the protection of privacy information. In this paper, we present a new kind of probabilistic quantum homomorphic encryption scheme for the universal quantum circuit evaluation. Firstly, the pre-shared non-maximally entangled states are utilized as auxiliary resources, which lower the requirements of the quantum channel, to correct the errors in non-Clifford gate evaluation. By using the set synthesized by Clifford gates and T gates, it is feasible to perform the arbitrary quantum computation on the encrypted data. Secondly, our scheme is different from the previous scheme described by the quantum homomorphic encryption algorithm. From the perspective of application, a two-party probabilistic quantum homomorphic encryption scheme is proposed. It is clear what the computation and operation that the client and the server need to perform respectively, as well as the permission to access the data. Finally, the security of probabilistic quantum homomorphic encryption scheme is analyzed in detail. It demonstrates that the scheme has favorable security in three aspects, including privacy data, evaluated data and encryption and decryption keys.
|
Received: 25 March 2021
Revised: 30 April 2021
Accepted manuscript online: 12 May 2021
|
|
PACS:
|
05.30.-d
|
(Quantum statistical mechanics)
|
| |
03.67.Dd
|
(Quantum cryptography and communication security)
|
| |
03.65.-w
|
(Quantum mechanics)
|
|
| Fund: Project supported by the Fundamental Research Funds for the Central Universities (Grant No. 2019XDA02) and the Scientific Research Foundation of North China University of Technology. |
Corresponding Authors:
Gang Xu
E-mail: gangxu_bupt@163.com
|
Cite this article:
Jing-Wen Zhang(张静文), Xiu-Bo Chen(陈秀波), Gang Xu(徐刚), and Yi-Xian Yang(杨义先) Universal quantum circuit evaluation on encrypted data using probabilistic quantum homomorphic encryption scheme 2021 Chin. Phys. B 30 070309
|
[1] Rivest R L, Adleman L and Dertouzos M L 1978 Found. Secure Comput. 4 169
[2] Gentry C 2009 A fully homomorphic encryption scheme, Ph.D. thesis (Stanford University)
[3] Van Dijk M, Gentry C, Halevi S and Vaikuntanathan V 2010 Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 30-June 3, 2010, Springer, Berlin, p. 24
[4] Brakerski Z and Vaikuntanathan V 2014 SIAM J. Comput. 43 831
[5] Stehlé D and Steinfeld R 2010 International Conference on the Theory and Application of Cryptology and Information Security, December 5-9, 2010, Springer, Berlin, p. 377
[6] Brakerski Z and Vaikuntanathan V 2011 Annual cryptology conference, August 14-18, 2011, Springer, Berlin, p. 505
[7] Vaikuntanathan V 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, October 22-25, 2011, Palm Springs, CA, p. 5
[8] Xu G, Xiao K, Li Z P, Niu X X and Ryan M 2019 Comput. Mater. Continua 58 809
[9] Broadbent A, Fitzsimons J and Kashefi E 2009 50th Annual IEEE Symposium on Foundations of Computer Science, October 25–27, 2009, Los Alamitos, CA, p. 517
[10] Fitzsimons J F 2017 npj Quantum Inf. 3 23
[11] Goldwasser S, Kalai Y T and Rothblum G N 2015 J. Am. Comput. Mach. 62 27
[12] Boneh D, Sahai A and Waters B 2011 Theory of Cryptography Conference, March 28-30, 2011, Springer, Berlin, p. 253
[13] Okamoto T and Takashima K 2010 Annual cryptology conference, August 15-19, 2010, Springer, Berlin, p. 191
[14] Garg S, Gentry C, Halevi S, Raykova M, Sahai A and Waters B 2016 SIAM J. Comput. 45 882
[15] Rohde P P, Fitzsimons J F and Gilchrist A 2012 Phys. Rev. Lett. 109 150501
[16] Liang M 2013 Quantum Inf. Process. 12 3675
[17] Liang M 2013 arXiv: 1311.6304 [quant-ph]
[18] Liang M 2015 Quantum Inf. Process. 14 2749
[19] Yu L, Pérez-Delgado C A and Fitzsimons J F 2014 Phys. Rev. A 90 050303
[20] Fisher K A G, Broadbent A, Shalm L K, Yan Z, Lavoie J, Prevedel R, Jennewein T and Resch K J 2014 Nat. Commun. 5 3074
[21] Broadbent A and Jeffery S Annual Cryptology Conference, August 16-20, 2015, Springer, Berlin, p. 609
[22] Dulek Y, Schaffner C and Speelman F 2016 Annual International Cryptology Conference, August 14-18, 2016, Springer, Berlin, p. 3
[23] Alagic G, Dulek Y, Schaffner C and Speelman F 2017 International Conference on the Theory and Application of Cryptology and Information Security, December 3-7, 2017, Springer, Cham, p. 438
[24] Tan S H, Kettlewell J A, Ouyang Y, Chen L and Fitzsimons J F 2016 Sci. Rep. 6 33467
[25] Ouyang Y, Tan S H and Fitzsimons J F 2018 Phys. Rev. A 98 042334
[26] Mahadev U 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018, IEEE, New York, p. 332
[27] Tan S H, Ouyang Y and Rohde P P 2018 Phys. Rev. A 97 042308
[28] Marshall K, Jacobsen C S, Schäfermeier C, Gehring T, Weedbrook C and Andersen U L 2016 Nat. Commun. 7 13795
[29] Zeuner J, Pitsios I, Tan S H, Sharma A N, Fitzsimons J F, Osellame R and Walther P 2021 npj Quantum Inf. 7 1
[30] Tham W K, Ferretti H, Bonsma-Fisher K, Brodutch A, Sanders B C, Steinberg A M and Jeffery S 2020 Phys. Rev. X 97 011038
[31] Chen X B, Sun Y R, Xu G and Yang Y X 2019 Inf. Sci. 501 172
[32] Xu G, Shan R T, Chen X B, Dong M X and Chen Y L 2021 Comput. Mater. Continua 69 339
[33] Pal R and Bandyopadhyay S 2018 Phys. Rev. A 97 032322
[34] Horodecki R, Horodecki P, Horodecki M and Horodecki K 2009 Rev. Mod. Phys. 81 865
[35] Nielsen M A and Chuang I 2002 Am. J. Phys. 70 558
[36] Boykin P O and Roychowdhury V 2003 Phys. Rev. A 67 042317
[37] Roa L and Groiseau C 2015 Phys. Rev. A 91 012344 |
| 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
|
|
|
