Write, autoreview, editor, reviewer
3,129
edits
Classical Fully Homomorphic Encryption for Quantum Circuits: Difference between revisions
Classical Fully Homomorphic Encryption for Quantum Circuits (edit)
Revision as of 16:31, 19 November 2018
, 19 November 2018→Assumptions
m (→Outline) |
m (→Assumptions) |
||
| Line 4: | Line 4: | ||
==Assumptions== | ==Assumptions== | ||
* This protocol is secure against honest but curious adversary setting. | * This protocol is secure against honest but curious adversary setting. | ||
* HE is a classical leveled fully homomorphic encryption scheme which is [[Supplementary Information#Quantum Cryptography Techniques#Quantum Capable Homomorphic Encryption|quantum capable]] for given depth of | * HE is a classical leveled fully homomorphic encryption scheme which is [[Supplementary Information#Quantum Cryptography Techniques#Quantum Capable Homomorphic Encryption|quantum capable]] for given depth of one layer of circuit, <math>L_c</math> (See Notations below). | ||
* A [[Supplementary Information#Complexity|BQP]] Server can generate a superposition of inputs for the encryption function over some distribution given the public key used for encryption. The protocol takes learning with errors assumption. | * A [[Supplementary Information#Complexity|BQP]] Server can generate a superposition of inputs for the encryption function over some distribution given the public key used for encryption. The protocol takes learning with errors assumption. | ||