A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
[chapter]

2015
*
Lecture Notes in Computer Science
*

Fully homomorphic encryption is an encryption method with the property that any computation on the plaintext can be performed by a party having access to the ciphertext only. Here, we formally define and give schemes for quantum homomorphic encryption, which is the encryption of quantum information such that quantum computations can be performed given the ciphertext only. Our schemes allows for arbitrary Clifford group gates, but become inefficient for circuits with large complexity, measured

doi:10.1007/978-3-662-48000-7_30
fatcat:wsf2x4neurelndt52xvfgrhtcy