Revision History for: Secure Client-Server Delegated Computation
- 2026-06-07 at 19:18 by Mina Doosti
Functionality Description
Delegated Computation is the task of assigning computation on hidden data to a powerful untrusted party (a device) by a weak (in terms of computational powers) party while maintaining privacy of hidden data from the powerful party. Protocols under this functionality are commonly called Client-Server protocols. Delegated Quantum Computation (DQC) protocols involve partially or fully classical Client delegating a quantum computation to fully powerful single/multiple quantum Server/Servers. All DQC protocols involve three main stages, Preparation Stage, Computation Stage and Output Correction Stage. The roles of Client and Server in the different stages may differ according to the type of communication used see Protocols list.
Protocols
The protocols that implement this functionality are:
Classical Analogues
No content has been added to this section, yet!
Real-world Use Cases
- Quantum Task.
- No classical analog for Blind Quantum Computing where input, output and computation can be hidden. Classical analogue for Homomorphic encryption techniques exist, hiding only the input and the output of the client and not the computation.
- Quantum machine learning. acheck
Properties
- Universality A protocol for delegated quantum computation is universal if it client can use the server to compute any quantum circuit.
- Correctness A protocol is correct if the output of client’s input after Server’s processing is correct, given that both parties follow the protocol honestly.
- Blindness The protocol is blind to the server (who, in this case is the adversary/dishonest party) means that client’s computation is hidden from the server during the entire protocol.
- Compactness Decryption of datat the end of the protocol should be independent of the size of the quantum circuit used for computation.
- Full Homomorphism A homomorphic encryption which can perform any quantum computation.
Further Information
Secure Delegated Computation was an open problem in classical computation until Gentry’s work in 1994 on Homomorphic Encryption using Lattice Based Cryptography [1]. An analogue was required in case of delegating quantum data. Childs proposed the first work in the field in 2005 [2]. Unlike the classical scheme, this protocol could not only hide the input and output of the client from the sever but also client’s computation. This was a breakthrough as there exists no such scheme in classical cryptography which could provide this additional functionality, called ‘blindness’. Arrighi and Salvail later showed [3] that hiding of computation was possible only for a few functions. They also coined the notion of verifiability. In 2009, Broadbent, Fitzsimons and Kashefi developed prepare and send universal blind quantum computation, which was the first scheme to solve this problem for any quantum circuit. This property, also known as universality, opened the gates for further research in this field. New protocols came into picture, some using the measurement based quantum computation framework like blind quantum computation and some devising homomorphic encryption for quantum data. Out of which, prepare-and-send universal blind quantum computation has been proven to be universally composable i.e. it is secure in any and every scenerio possible. The only other protocol which is proven to be universally composable is Quantum Key Distribution. All the above protocols required quantum communication until the latest work by Urmila Mahadev in 2018, classical fully homomorphic encryption for quantum circuits. It requires no quantum operation on the client’s side. pseudo-secret random qubit generator is a functionality different from delegation of quantum computation. It comes with multiple uses, one of which being universal blind quantum computation. This protocol also requires no quantum computation on client’s side in order to instruct server to prepare her secret random qubits, of which she has complete knowledge but not the server.
Review Papers:
- Fitzsimons (2017) gives an overview of delegated quantum computation
- Dunjko et al (2013) gives the abstract cryptography framework for delegated computing and uses it prove universal composability of UBQC.
References
* The original version of this page on the old QPZoo was created by Shraddha Singh
- Gentry, C., 2009. A fully homomorphic encryption scheme. Stanford university.
- Childs, Andrew M. “Secure assisted quantum computation.” arXiv preprint quant-ph/0111046 (2001).
- Arrighi, P. and Salvail, L., 2006. Blind quantum computation. International Journal of Quantum Information, 4(05), pp.883-898.
- 2025-06-24 at 21:28 by JuliaM
Functionality Description
Delegated Computation is the task of assigning computation on hidden data to a powerful untrusted party (a device) by a weak (in terms of computational powers) party while maintaining privacy of hidden data from the powerful party. Protocols under this functionality are commonly called Client-Server protocols. Delegated Quantum Computation (DQC) protocols involve partially or fully classical Client delegating a quantum computation to fully powerful single/multiple quantum Server/Servers. All DQC protocols involve three main stages, Preparation Stage, Computation Stage and Output Correction Stage. The roles of Client and Server in the different stages may differ according to the type of communication used see Protocols list.
Protocols
No protocols implement this functionality yet.
Classical Analogues
No content has been added to this section, yet!
Real-world Use Cases
- Quantum Task.
- No classical analog for Blind Quantum Computing where input, output and computation can be hidden. Classical analogue for Homomorphic encryption techniques exist, hiding only the input and the output of the client and not the computation.
- Quantum machine learning. acheck
Properties
- Universality A protocol for delegated quantum computation is universal if it client can use the server to compute any quantum circuit.
- Correctness A protocol is correct if the output of client’s input after Server’s processing is correct, given that both parties follow the protocol honestly.
- Blindness The protocol is blind to the server (who, in this case is the adversary/dishonest party) means that client’s computation is hidden from the server during the entire protocol.
- Compactness Decryption of datat the end of the protocol should be independent of the size of the quantum circuit used for computation.
- Full Homomorphism A homomorphic encryption which can perform any quantum computation.
Further Information
Secure Delegated Computation was an open problem in classical computation until Gentry’s work in 1994 on Homomorphic Encryption using Lattice Based Cryptography [1]. An analogue was required in case of delegating quantum data. Childs proposed the first work in the field in 2005 [2]. Unlike the classical scheme, this protocol could not only hide the input and output of the client from the sever but also client’s computation. This was a breakthrough as there exists no such scheme in classical cryptography which could provide this additional functionality, called ‘blindness’. Arrighi and Salvail later showed [3] that hiding of computation was possible only for a few functions. They also coined the notion of verifiability. In 2009, Broadbent, Fitzsimons and Kashefi developed prepare and send universal blind quantum computation, which was the first scheme to solve this problem for any quantum circuit. This property, also known as universality, opened the gates for further research in this field. New protocols came into picture, some using the measurement based quantum computation framework like blind quantum computation and some devising homomorphic encryption for quantum data. Out of which, prepare-and-send universal blind quantum computation has been proven to be universally composable i.e. it is secure in any and every scenerio possible. The only other protocol which is proven to be universally composable is Quantum Key Distribution. All the above protocols required quantum communication until the latest work by Urmila Mahadev in 2018, classical fully homomorphic encryption for quantum circuits. It requires no quantum operation on the client’s side. pseudo-secret random qubit generator is a functionality different from delegation of quantum computation. It comes with multiple uses, one of which being universal blind quantum computation. This protocol also requires no quantum computation on client’s side in order to instruct server to prepare her secret random qubits, of which she has complete knowledge but not the server.
Review Papers:
- Fitzsimons (2017) gives an overview of delegated quantum computation
- Dunjko et al (2013) gives the abstract cryptography framework for delegated computing and uses it prove universal composability of UBQC.
References
- Gentry, C., 2009. A fully homomorphic encryption scheme. Stanford university.
- Childs, Andrew M. “Secure assisted quantum computation.” arXiv preprint quant-ph/0111046 (2001).
- Arrighi, P. and Salvail, L., 2006. Blind quantum computation. International Journal of Quantum Information, 4(05), pp.883-898.
- 2025-05-15 at 14:07 by JuliaM
Functionality Description
Delegated Computation is the task of assigning computation on hidden data to a powerful untrusted party (a device) by a weak (in terms of computational powers) party while maintaining privacy of hidden data from the powerful party. Protocols under this functionality are commonly called Client-Server protocols. Delegated Quantum Computation (DQC) protocols involve partially or fully classical Client delegating a quantum computation to fully powerful single/multiple quantum Server/Servers. All DQC protocols involve three main stages, Preparation Stage, Computation Stage and Output Correction Stage. The roles of Client and Server in the different stages may differ according to the type of communication used see Protocols list.
Protocols
No protocols implement this functionality yet.
Classical Analogues
No content has been added to this section, yet!
Real-world Use Cases
- Quantum Task.
- No classical analog for Blind Quantum Computing where input, output and computation can be hidden. Classical analogue for Homomorphic encryption techniques exist, hiding only the input and the output of the client and not the computation.
- Quantum machine learning. acheck
Properties
- Universality A protocol for delegated quantum computation is universal if it client can use the server to compute any quantum circuit.
- Correctness A protocol is correct if the output of client’s input after Server’s processing is correct, given that both parties follow the protocol honestly.
- Blindness The protocol is blind to the server (who, in this case is the adversary/dishonest party) means that client’s computation is hidden from the server during the entire protocol.
- Compactness Decryption of datat the end of the protocol should be independent of the size of the quantum circuit used for computation.
- Full Homomorphism A homomorphic encryption which can perform any quantum computation.
Further Information
Secure Delegated Computation was an open problem in classical computation until Gentry’s work in 1994 on Homomorphic Encryption using Lattice Based Cryptography [1]. An analogue was required in case of delegating quantum data. Childs proposed the first work in the field in 2005 [2]. Unlike the classical scheme, this protocol could not only hide the input and output of the client from the sever but also client’s computation. This was a breakthrough as there exists no such scheme in classical cryptography which could provide this additional functionality, called ‘blindness’. Arrighi and Salvail later showed [3] that hiding of computation was possible only for a few functions. They also coined the notion of verifiability. In 2009, Broadbent, Fitzsimons and Kashefi developed prepare and send universal blind quantum computation, which was the first scheme to solve this problem for any quantum circuit. This property, also known as universality, opened the gates for further research in this field. New protocols came into picture, some using the measurement based quantum computation framework like blind quantum computation and some devising homomorphic encryption for quantum data. Out of which, prepare-and-send universal blind quantum computation has been proven to be universally composable i.e. it is secure in any and every scenerio possible. The only other protocol which is proven to be universally composable is Quantum Key Distribution. All the above protocols required quantum communication until the latest work by Urmila Mahadev in 2018, classical fully homomorphic encryption for quantum circuits. It requires no quantum operation on the client’s side. pseudo-secret random qubit generator is a functionality different from delegation of quantum computation. It comes with multiple uses, one of which being universal blind quantum computation. This protocol also requires no quantum computation on client’s side in order to instruct server to prepare her secret random qubits, of which she has complete knowledge but not the server.
Review Papers:
- Fitzsimons (2017) gives an overview of delegated quantum computation
- Dunjko et al (2013) gives the abstract cryptography framework for delegated computing and uses it prove universal composability of UBQC.
References
- Gentry, C., 2009. A fully homomorphic encryption scheme. Stanford university.
- Childs, Andrew M. “Secure assisted quantum computation.” arXiv preprint quant-ph/0111046 (2001).
- Arrighi, P. and Salvail, L., 2006. Blind quantum computation. International Journal of Quantum Information, 4(05), pp.883-898.