Classical Homomorphic Encryption for Quantum Circuits

被引:77
作者
Mahadev, Urmila [1 ]
机构
[1] Univ Calif Berkeley, Dept Comp Sci, Berkeley, CA 94720 USA
来源
2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS) | 2018年
关键词
D O I
10.1109/FOCS.2018.00039
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present the first leveled fully homomorphic encryption scheme for quantum circuits with classical keys. The scheme allows a classical client to blindly delegate a quantum computation to a quantum server: an honest server is able to run the computation while a malicious server is unable to learn any information about the computation. We show that it is possible to construct such a scheme directly from a quantum secure classical homomorphic encryption scheme with certain properties. Finally, we show that a classical homomorphic encryption scheme with the required properties can be constructed from the learning with errors problem.
引用
收藏
页码:332 / 338
页数:7
相关论文
共 19 条
[1]   Private quantum channels [J].
Ambainis, A ;
Mosca, M ;
Tapp, A ;
de Wolf, R .
41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, :547-553
[2]  
[Anonymous], 2007432 CRYPTOLOGY E
[3]  
[Anonymous], 2013, 2013340 IACR CRYPT E
[4]  
[Anonymous], 2018, Classical verification and blind delegation of quantum computations
[5]  
[Anonymous], 2008, ARXIV08105375
[6]  
[Anonymous], 2015551 CRYPT EPRINT
[7]  
[Anonymous], STAT SECURE QUANTUM
[8]  
[Anonymous], ARXIV08074154
[9]  
[Anonymous], 2016, Quantum Homomorphic Encryption for Polynomial-Sized Circuits
[10]  
[Anonymous], ARXIV170802130