Classical Fully Homomorphic Encryption for Quantum Circuits: Difference between revisions

Classical Fully Homomorphic Encryption for Quantum Circuits (edit)

No change in size , 10 July 2019

Write, autoreview, editor, reviewer

3,129

edits

@@ Line 4: / Line 4: @@
 ==Assumptions==
 *	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 [[Glossary#Quantum Capable Homomorphic Encryption|quantum capable]] for given depth of one layer of circuit, <math>L_c</math> (See Notations below).
-*	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.
+*	A [https://complexityzoo.uwaterloo.ca/Complexity_Zoo:B#bqp 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 [https://en.wikipedia.org/wiki/Learning_with_errors learning with errors] assumption.
 == Outline==