2015/08/31 by Yingkai Ouyang, Si-Hui Tan, Joseph Fitzsimons · 1 citation
Physics and Astronomy · #quant-ph
paper · pdf · doi:10.1103/physreva.98.042334
published as Phys. Rev. A 98, 042334 (2018) · 8 pages, double column, 3 figures, strengthened security proof
arxiv created 2018/10/26 · arxiv updated 2018/10/31
The recent discovery of fully-homomorphic classical encryption schemes has had a dramatic effect on the direction of modern cryptography. Such schemes, however, implicitly rely on the assumptions that solving certain computation problems are intractable. Here we present a quantum encryption scheme which is homomorphic for arbitrary classical and quantum circuits which have at most some constant number of non-Clifford gates. Unlike classical schemes, the security of the scheme we present is information theoretic and hence independent of the computational power of an adversary.