Write, autoreview, editor, reviewer
3,129
edits
Prepare-and-Send Universal Blind Quantum Computation: Difference between revisions
Jump to navigation
Jump to search
Prepare-and-Send Universal Blind Quantum Computation (edit)
Revision as of 14:42, 27 September 2018
, 27 September 2018→Security Claim/ Theorems
| Line 58: | Line 58: | ||
* ''Correctness'' If Client and Server follow protocols 1a-1c as described above, the outcome will be correct. | * ''Correctness'' If Client and Server follow protocols 1a-1c as described above, the outcome will be correct. | ||
* ''Blindness'' Protocols 1a-1c are blind while leaking at most (m,n) to the Server | * ''Blindness'' Protocols 1a-1c are blind while leaking at most (m,n) to the Server | ||
*The protocol is unconditionally secure i.e. no matter what Server does he cannot learn Client's inputs/outputs/computation. | |||
* At every step of Protocol 1a, Server’s quantum state is one-time padded as sX and sZ are hidden by the random key r for each qubit | * At every step of Protocol 1a, Server’s quantum state is one-time padded as sX and sZ are hidden by the random key r for each qubit | ||