Write, autoreview, editor, reviewer
3,129
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 12:16, 20 November 2018
, 20 November 2018→Stage 1 Client’s Preparation
| Line 55: | Line 55: | ||
# Client chooses pad key for each message bit <math>a,b\in\{0,1\}^{\lambda}</math>. | # Client chooses pad key for each message bit <math>a,b\in\{0,1\}^{\lambda}</math>. | ||
# She then encrypts this pad key and sends it to the Server with the evaluation keys.</br>HE.Enc<math>_{pk_1}(a,b))</math>, | # She then encrypts this pad key and sends it to the Server with the evaluation keys.</br>HE.Enc<math>_{pk_1}(a,b))</math>, | ||
# She sends encrypted classical message <math>X^aZ^b|l\rangle</math> which can be represented as the classical string <math>a\oplus m</math>. In case of quantum output Client uses pad key to hide her quantum state using QOTP (<math>X^aZ^b|\psi\rangle/math>) and then sends this hidden state to the Server along with the encrypted pad key. | # She sends encrypted classical message <math>X^aZ^b|l\rangle</math> which can be represented as the classical string <math>a\oplus m</math>. In case of quantum output Client uses pad key to hide her quantum state using QOTP (<math>X^aZ^b|\psi\rangle</math>) and then sends this hidden state to the Server along with the encrypted pad key. | ||
=== '''Stage 2''' Server’s Computation === | === '''Stage 2''' Server’s Computation === | ||