Editing Prepare-and-Send Verifiable Quantum Fully Homomorphic Encryption (section)

==Properties==
* Compactness: This protocol is compact if verified decryption is divisible into a classical verification procedure Verification (outputting only an accept/reject flag), followed by a quantum decryption procedure Decryption. The running time of Verification is allowed to depend on the circuit size, but the running time of Decryption is not when it is compact.
* Semantic Security: A QPT adversary with access to the ciphertext can be simulated by a simulator that only has access to an ideal functionality that simply applies the claimed circuit. (Explain when this protocol is semantically secure)
* Indistinguishability: For a defined security game, if the success probability for an QPT adversary is at-most <math>\frac{1}{2} + negl(\kappa)</math>, then this protocol is indistinguishable. The security game is based on the QPT adversary determining the outcome of a hidden coin flip.
* Fully Homomorphic: This protocol is fully homomorphic i.e. Server can operate any quantum circuit using this protocol.
* Privacy: this scheme is private if its ciphertexts are indistinguishable under chosen plaintext attack.
* Computational logs are generally classical in nature.
* The chosen message authentication code MAC = (Tag, Ver) is existentially unforgeable under adaptive chosen message attack from a quantum adversary