Prepare-and-Send Quantum Fully Homomorphic Encryption: Difference between revisions

Prepare-and-Send Quantum Fully Homomorphic Encryption (edit)

221 bytes added , 20 September 2018

Write, autoreview, editor, reviewer

3,129

edits

@@ Line 62: / Line 62: @@
 , where ηk is a negligible function . This means that if the protocol is followed it results the same output as when circuit is operated on the input states directly with overwhelming probability.
 *	''Compactness.'' If HE is compact then this protocol is compact. The complexity of applying QFHE.Dec on the results of QFHE.Eval is at most p(k), where p(k) is a polynomial dependent only on the security parameter k. This implies that decryption is independent of the size of quantum circuit for evaluation.
-*	''Circuit Privacy.'' This protocol does not guarantee that client cannot gain information about the circuit evaluated i.e. the circuit is not private to one party and unknown to another.
+*	''Circuit Privacy.'' This protocol is not circuit private as it does not guarantee that client cannot gain information about the circuit evaluated i.e. the circuit is not private to one party and unknown to another. It can make the circuit private to the evaluator (Server) and hidden from the Client apart from the necessary leakage the output states gives if one uses circuit private HE for the protocol.
 •	''Full Homomorphism.'' This scheme is fully homomorphic for circuits with polynomial sized T gates