|
|
| Line 26: |
Line 26: |
|
| |
|
| '''Tags:''' [[Two Party Protocols|Two Party]], [[Universal Task|Universal Task]], [[Quantum Functionality|Quantum Functionality]], [[Multiparty Delegated Quantum Computation|Multiparty Delegated Quantum Computation]], [[Quantum Enhanced Classical Delegated Computation|Quantum Enhanced Classical Delegated Computing]] | | '''Tags:''' [[Two Party Protocols|Two Party]], [[Universal Task|Universal Task]], [[Quantum Functionality|Quantum Functionality]], [[Multiparty Delegated Quantum Computation|Multiparty Delegated Quantum Computation]], [[Quantum Enhanced Classical Delegated Computation|Quantum Enhanced Classical Delegated Computing]] |
|
| |
| == Properties ==
| |
| * ''Blindness'' asserts the Client’s input/output/computation are blind (unknown) to the Server.
| |
| * ''Universality'' asserts the protocol can compute universal set of quantum gates.
| |
| * ''Correctness'' asserts that if the protocol is followed it results the same output as when circuit is operated on the input states directly.
| |
| * ''Compactness'' asserts the decryption of the encrypted messages does not depend on the size of the computation circuit.
| |
| * ''Circuit Privacy'' asserts circuit is private from the party who did not create it.
| |
| * ''Indistinguishability under Chosen Plaintext Attacks by adversary with quantum computational powers(q-IND-CPA)'' means that an adversary cannot distinguish between encrypted text from a message and encrypted text from an arbitrary state.
| |
| * ''Full Homomorphism'' A fully homomorphic scheme is capable of performing any quantum computation on encrypted text and give the correct outcome after decryption. If a scheme cannot perform all quantum gates, it is called Quantum Homomorphic Encryption (QHE) instead of QFHE.
| |
| * ''Quantum Capable'' A classical HE scheme is quantum capable if it can be used to evaluate quantum circuits
| |
| * ''Circular Security'' An encryption scheme that encrypts (hides) its own keys
| |