Write, autoreview, editor, reviewer
3,125
edits
Classical Fully Homomorphic Encryption for Quantum Circuits: Difference between revisions
Jump to navigation
Jump to search
m
Classical Fully Homomorphic Encryption for Quantum Circuits (edit)
Revision as of 02:05, 26 November 2018
, 26 November 2018→Stage 3 Client’s Output Correction
| Line 96: | Line 96: | ||
=== '''Stage 3''' Client’s Output Correction === | === '''Stage 3''' Client’s Output Correction === | ||
*Input: Classical output state | *Input: Classical output state (<math>l\in\{0,1\}^{\lambda}</math>), encrypted Pauli corrections (<math>\tilde{z},\tilde{x}</math>) | ||
*Output: Decrypted classical message <math> | *Output: Decrypted classical message (<math>l\oplus x</math>) | ||
**'''Decryption (FHE.Dec<math>_{sk}</math>)''' | **'''Decryption (FHE.Dec<math>_{sk}</math>)''' | ||
# Client decrypts <math>\tilde{z},\tilde{x}</math> using <math>sk_{L+1}</math> to obtain <math>z,x</math>. | # Client decrypts <math>\tilde{z},\tilde{x}</math> using <math>sk_{L+1}</math> to obtain <math>z,x</math>. | ||
# She then uses the decrypted Pauli corrections to get the correct output <math> | # She then uses the decrypted Pauli corrections to get the correct output <math>l\oplus x</math>.</br> | ||
==Discussion== | ==Discussion== | ||
This protocol is first and only protocol currently, to use a classical functionality to solve a quantum task. It provides computationally security. A verifiable variant of this protocol is still an open question. | This protocol is first and only protocol currently, to use a classical functionality to solve a quantum task. It provides computationally security. A verifiable variant of this protocol is still an open question. | ||