Prepare-and-Send Verifiable Quantum Fully Homomorphic Encryption

From Quantum Protocol Zoo
Jump to: navigation, search

In this example protocol, Prepare-and-Send Quantum Fully Homomorphic Encryption protocol is implemented with the additional property of verification, where it is checked if the final ciphertext produces by the server matches the results of a particular computation. QFHE is a protocol where any arbitrary computations can be carried out by the server on the client's encrypted data while hiding all inputs and outputs of the client. In the classical version of this protocol, verification was carried by creating copies at every stage, which is not possible in the quantum version due to the no-cloning theorem(link). Hence in this protocol, verification is carried out by a technique where the server generates classical computational logs through which the underlying encryptions becomes authenticated. These computational logs are used to certify to the client that a particular homomorphic quantum computation was performed on a classical computer.

Tags: Two Party,Universal Task, Secure Delegated Quantum Computation, Quantum Offline Communication, Classical Offline Communication, Quantum Gadgets, Prepare and Send Quantum Fully Homomorphic Encryption, Classical Fully Homomorphic Encryption for Quantum Circuits.


  • The classical fully homomorphic public-key encryption scheme HE is fixed has decryption in LOGSPACE.
  • A message authentication code MAC is fixed which is existentially unforgeable under adaptive chosen message attacks from a quantum adversary.


This protocol consists mainly of four stages: Key Generation, Encryption, Homomorphic evaluation, and Verified decryption. To introduce verification, the major changes from the standard Prepare and Send Quantum Fully Homomorphic Encryption protocol take place in stage 2 (Evaluation) where a computational log is provided as an extra output and in stage 4 (Verified decryption) which accepts computational log and performs the verification. The verification performed in this protocol is mainly classical in nature.

  • Key Generation and encryption: This procedure requires the generation of single-qubit and two-qubit states from a small fixed set, performing Bell measurements and Pauli gates, and executing the encoding procedure of a quantum error-correcting code on which the trap code is based.

Key gen:

    • The classical fully homomorphic encryption scheme is used here to generate the public key, the secret keys and the evaluation function key for the encryption.
    • A message authenticating system (MAC) is used to authenticate this process. Using MAC, a key is also generated.
    • A random global permutation is selected from letters. A tuple is generated now using the global permutation and all the keys generated in the above steps. These are the non-evaluation keys which used to encrypt the auxiliary states.

Encryption: We encrypt each qubit of the plaintext using the trap code, and encrypt the trap code keys using the FHE scheme. This again requires the ability to perform Paulis, execute an error-correcting encoding, and the generation of basic single-qubit states.

    • Majority of the single-qubit and two-qubit quantum states are encrypted using the global permutation. A CSS concatenated Steane code is selected with specific requirements. The quantum state is first encoded using this CSS code which results in a state with qubits. Then, computational and Hadamard traps ( and states) are added to that state and the resulting state is permutated using the global permutation. Next, if is the number of qubits that will be encrypted, two bits strings are picked of length to encrypt the state with Quantum one time pad. After this, we obtain our magic state for that particular quantum state. Here it is important to note that the keys for Quantum one time pad are selected during Encryption rather than Key Generation.
    • For the gate, error correcting gadgets are prepared from garden-hose gadgets.
    • Then the evaluation key is formed by MAC which uses the auxiliary states, including the magic states.

  • Evaluation: Evaluation of a circuit is done gate by gate. Throughout this procedure, apart from the outputs, a complete computational log is made of all randomness used, all computation steps, all intermediate results, and all the classical FHE computations. To measure a qubit, we measure all ciphertext qubits and place the outcomes in the log.
    • Measurements: In computational basis measurement, logical measurement is performed by measurement of all physical qubits of the ciphertext and also checks the traps. This is followed by using the encryption function of classical homomorphic encryption on the result. In Hadamard basis measurement, because of the Hadamard gate property of and , all computational traps are swapped with the Hadamard traps. . A transversal application of to all relevant physical qubits precedes the evaluation procedure for the computational basis measurement.
    • Pauli gates: Applying a logical Pauli is done by applying the same Pauli to all physical qubits. The application of Pauli gates ( and/or ) to a state encrypted with a quantum one-time pad can be achieved without touching the actual state, by updating the keys to QOTP in the appropriate way. The logical Pauli-X is performed by (homomorphically) flipping the X-key bits of the QOTP and Pauli-Y works in the same manner for Z-key bits. Hence, this is a classical task.
    • CNOT gate: The effect of applying CNOT to the encrypted qubits, without the quantum one-time padding is that logical CNOT is applied to the physical data qubits in the permutation and the remaining traps are unchanged due to its action. Hence in the quantum one-time pad, the secret key bits are homomorphically updated during evaluation while applying CNOT.
    • Phase gates: Performing this gate requires homomorphic evaluation of all the above gates: (classically controlled) Paulis, CNOTs, and measurements. Here the corresponding encrypted magic state is also used.
    • Hadamard gate: The Hadamard gate can be applied using the same method used in the Phase gate.
    • T gate: Applying T requires a magic state and an encrypted garden-hose gadget (because the T-gate magic state circuit applies a P-gate conditioned on a measurement outcome). The evaluation of that circuit is complicated and hence that specific error correcting gadget is used.

  • Verified decryption
    • Here the correctness and consistency of the classical FHE transcript, the measurement outcomes, and the claimed circuit are checked. The result of this computation is a set of keys for the trap code, which are correct provided that Eval was performed honestly. In this step, decryption takes place using these keys and the output is either plaintext or reject. In terms of quantum capabilities, decryption requires executing the decoding procedure of the error-correcting code, computational-basis and Hadamard-basis measurements, and Paulis.
    • This procedure consists of two parts. Several classical checks are performed at first, where MAC-verification of all classically authenticated messages takes places. It also includes checking if the gates listing in the computational log match the circuit description. The portion of the log which specifies the purely classical, FHE steps taking during classical homomorphic encryption are also checked.
    • Next, all the unmeasured traps are checked and the remaining qubits are decoded. If the logs don't match or if any of the traps are triggered, then the entire process is rejected.

Hardware Requirements[edit]

  • Classical HE scheme is required here. The communication can be performed over a classical network with only one quantum node (in case of classical input and output).

Knowledge Graph[edit]


  • 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 , 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


  • : Security parameter.
  • : Upper bound on T gate.
  • : Upper bound on P gate.
  • : Upper bound on H gate.
  • : All keys
  • : Global permutation which are used to encrypt the states, this is a random permutation of 3m bits
  • : Permutation group.
  • MAC: Message authentication code, MAC = (Tag, Ver)
  • HE: Classical fully homomorphic public-key encryption scheme
  • TC: Trap Code scheme which is a building block for FHE scheme.
  • : homomorphic key set generated from HE.KeyGen(). Public key for encryption, secret key for decryption, evaluation function key, respectively for given k, the security parameter.
  • : ciphertext
  • : Randomly picked bit strings to encrypt with Quantum one time pad.
  • : Classical encryptions of the x, z
  • : evaluation key
  • : Output of the measurement,

Protocol Description[edit]

Stage 1: Key generation and encryption
Main function: TrapTP.KeyGen

Function 1: TrapTP.KeyGen()

  • MAC.KeyGen
  • for
    • HE.KeyGen
  • for
    • TrapTP.ENC
  • for
    • TrapTP.ENC
  • for
    • TrapTP.ENC
  • for
    • TrapTP.GadgetGen
    • MAC.Sign(HE.ENC TrapTP.ENC TrapTP.Enc
  • MAC.Sign HE.Enc
  • return

Function 2: TrapTP.GadgetGen()

  • generate states depending on
  • return ()

Function 3: TrapTP.Enc((), )

  • (TC.Enc MAC.Sign
  • return

Stage 2: Evalutation

Function 4: TrapTP.EvalMeasure()

  • measure qubits of in the computational basis
  • HE.Enc
  • HE.Eval
  • return ()

Function 5: TrapTP.EvalX()

  • HE.Eval
  • HE.Eval HE.Enc
  • HE.Eval
  • return ()

Function 6: TrapTP.EvalCondX()

  • HE.Eval
  • HE.Eval
  • HE.Eval
  • HE.Eval
  • return ()

Function 7: TrapTP.EvalCNOT()

  • apply on all physical qubit pairs of
  • HE.Eval
  • return

Function 8: TrapTP.EvalT()

  • Trap.TP.EvalCNOT()
  • TrapTP.EvalMeasure(
  • recrypt all classically encrypted information (except ) from key set into key set .
  • TrapTP.EvalCondP
  • return

Function 9: TrapTP.EvalCondP()

  • evaluate Bell measurement between and
  • evaluate Bell measurement in as dictated by the ciphertext and the garden-hose protocol for HE.Dec
  • HE.Eval
  • return

Stage 3: Verification Decryption

Function 10: TrapTP.VerDec()

  • Verify classically authenticated messages (in ) using (contained in ). If one of these verifications rejects, reject.
  • Check whether all claimed gates in log match the structure of c. If not, return ().
  • ← TrapTP.CheckLog() If flag = rej, return ().
  • Check whether the claimed final QOTP keys in the log match and . If not, return ().
  • for all gates G of c do
    • if G is a measurement then
      • encrypted QOTP keys right before measurement (listed in )
      • encrypted measurement outcomes (listed in )
      • HE.Dec
      • Execute TC.VerDecMeasurement where basis is the appropriate basis for the measurement, and store the (classical) outcome.
      • if a trap is triggered then
        • return ()
  • for all unmeasured qubits in do
    • HE.Dec
    • TC.VerDec If TC.VerDec rejects, return
  • the list of decrypted qubits (and measurement outcomes) that are part of the output of c
  • return ()

Further Information[edit]


*contributed by Rhea Parekh