Write, autoreview, editor, reviewer
3,125
edits
Classical Fully Homomorphic Encryption for Quantum Circuits: Difference between revisions
Classical Fully Homomorphic Encryption for Quantum Circuits (edit)
Revision as of 23:51, 10 July 2019
, 10 July 2019→Assumptions
No edit summary |
|||
| Line 5: | Line 5: | ||
* 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 one layer of circuit, <math>L_c</math> (See Notations below). | * 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 [ | * A [BQP https://complexityzoo.uwaterloo.ca/Complexity_Zoo:B#bqp] Server (a quantum computer) 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 https://en.wikipedia.org/wiki/Learning_with_errors] assumption. | ||
== Outline== | == Outline== | ||