Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Secure Multi-Party Computation Based on Blind Quantum Computing

Yongli Wang, Tianci Cao, Yixin Wang, Rui Zhang, Yinghui Yang, Yongli Tang

Published May 13, 2026• 0 citations
Publisher

Abstract

Abstract Blind Quantum Computing (BQC) is a protocol proposed in recent years to tackle the practical need where users want to perform quantum computing tasks but lack the necessary capabilities, and thus delegate the work to quantum computing platforms while keeping their data secure throughout the process. Besides, its characteristics provide new ways for secure multi-party computation, helping multiple untrusted users to compute together securely. Most existing secure multi-party computation protocol based on blind quantum computing rely on DT(G) states to perform joint computation. However, this can lead to security risks because one client has too much authority, and these schemes also lack generality. In this paper, a secure multi-party computation protocol is proposed based on brickwork states. By exploiting and optimizing the properties of these states, the security issues in joint client computation are solved and centralized authority is avoided. Meanwhile, it reflects the interactive mode in multi-party computation. The proposed protocol effectively improves the generality of computation.

DOI
10.21203/rs.3.rs-9186808/v1

Related papers

Multi-party verifiable blind quantum computation protocol with mutual authentication

Ming-Qiang Bai, Jing Wen, Guang-Yang Wu

Abstract Most existing blind quantum computation protocols involve a client and a server or multiple servers. The case of multiple clients needs to be explored as well, but it becomes less secure as more people are involved. Authentication helps to solve the problem by enabling clients and servers to verify each other’s identity. In this paper, a multi-party verifiable blind quantum computation protocol with mutual authenti-cation is proposed which consists of three phases. Firstly, we improve the method for generating keys. Based on this, a deterministic method is proposed to generate authentication keys. Then, the client and the server perform mutual authentication. Finally, the only requirement for the client is to perform the gate S to accomplish the quantum computing task. The proposed protocol can resist both insider and outsider attacks, ensuring the legitimacy of clients and servers in a quantum network. The protocol further also limits the client’s quantum power and allows the client to verify the accuracy of the calculation results.

Quantum Information Processing•Jan 12, 2026•0 citations

Verifiable Blind Quantum Computation With Identity Authentication for Multi-Type Clients

Junyu Quan, Qin Li, Lvzhou Li

Blind quantum computation (BQC) provides a solution for clients with limited quantum capabilities to delegate their quantum computational tasks to remote quantum servers while keeping their own data private. In this paper, we first propose three multi-party verifiable blind quantum computation (MPVBQC) protocols, each of which can handle one type of clients with certain simple quantum capabilities such as making single-qubit measurements, preparing single qubits, or performing a few single-qubit gates. Then a flexible and hybrid MPVBQC framework for multi-type clients in quantum networks is given by combining the three proposed MPVBQC protocols. It simultaneously allows at least three types of clients in quantum networks to achieve BQC depending on their own quantum devices. Furthermore, all the proposed protocols can achieve identity authentication, resist both insider and outsider attacks, and be verifiable which means that the clients can verify the correctness of their computational results.

IEEE Transactions on Information Forensics and Security•Dec 7, 2023•18 citations

Universal single-server blind quantum computation for classical clients

Hai-Ru Xu, Bang-Hai Wang

Abstract Blind quantum computation (BQC) allows a client without enough quantum technologies to delegate her quantum computation to a remote quantum server, while keeping her input, output and algorithm secure. In this paper, we propose a universal single-server and almost-classical-client BQC protocol. In this protocol, the client interfaces with only one server and the only ability of the client required is to get particles from the trusted center and forward them to the server. We present an analysis of this protocol and modify it to a universal single-server and fully-classical-client BQC protocol by improving the ability of the trusted center. Based on our protocols and recent works, a new ‘Cloud + Certificate Authority (CA)’ style is proposed for the BQC.

arXiv:1410.7054•Laser Physics Letters•Nov 25, 2021•9 citations

Verifiable blind quantum computation with identity authentication for different types of clients

Junyu Quan, Qin Li, Lvzhou Li

Quantum computing has considerable advantages in solving some problems over its classical counterpart. Currently various physical systems are developed to construct quantum computers but it is still challenging and the first use of quantum computers may adopt the cloud style. Blind quantum computing (BQC) provides a solution for clients with limited quantum capabilities to delegate their quantum computation to remote quantum servers while keeping input, output, and even algorithm private. In this paper, we propose three multi-party verifiable blind quantum computing (VBQC) protocols with identity authentication to handle clients with varying quantum capabilities in quantum networks, such as those who can just make measurements, prepare single qubits, or perform a few single-qubit gates. They are client-friendly and flexible since the clients can achieve BQC depending on their own quantum devices and resist both insider outsider attacks in quantum networks. Furthermore, all the three proposed protocols are verifiable, namely that the clients can verify the correctness of their calculations.

arXiv:2210.09830•Oct 18, 2022•0 citations

Blind quantum computation with completely classical client and a trusted center

Min Liang

Blind quantum computation (BQC) enables a client without enough quantum power to delegate his quantum computation to a quantum server, while keeping the input data, the algorithm and the result unknown to the server. In the studies of practical BQC protocol, an important problem is how to reduce the quantum requirement of the client. Multi-server BQC protocols have been proposed to solve this problem. We review the double-server and triple-server protocols [Li et al., Phys. Rev. A 89, 040302(R) (2014)], and propose a modified double-server BQC protocol with a trusted center. In our protocol, the servers are allowed to communicate mutually, and the client is completely classical. Furthermore, our double-server protocol can be modified into a single-server protocol by simply combining the two servers. Compared with the triple-server protocol, our double-server and single-server protocols are more simple and the client is not required to have the ability to access quantum channel. So our protocols are more practical when quantum computer is applied in the `cloud' model.

arXiv:1508.07778•Aug 31, 2015•1 citation

Practical blind quantum computation with parity quantum computing framework

Yuxun Wang, Qin Li, Shao‐Ming Fei +1 more

Abstract Blind quantum computation (BQC) allows clients with limited quantum capabilities to delegate computational tasks to remote quantum servers while keeping the privacy of their data. However, existing BQC protocols often fail to balance resource consumption and practical feasibility, which is particularly significant in the noisy intermediate-scale quantum era. In this paper, we propose a practical BQC model based on the parity quantum computing framework. It requires the server to perform operations only on adjacent qubits and eliminates the need for additional SWAP gates when two-qubit gates should be applied to non-adjacent qubits, greatly facilitating the physical implementation on real quantum devices. Furthermore, we prove that the proposed BQC model ensures the privacy of client’s information and satisfies the property of verifiability which enables clients to identify dishonest servers. Finally, a detailed example is given and simulated on the IBM’s quantum platform to demonstrate its feasibility.

Quantum Science and Technology•Mar 19, 2026•0 citations
Abstract Blind Quantum Computing (BQC) is a protocol proposed in recent years to tackle the practical need where users want to perform quantum computing tasks but lack the necessary capabilities, and thus delegate the work to quantum computing platforms while keeping their data secure throughout the process. Besides, its characteristics provide new ways for secure multi-party computation, helping multiple untrusted users to compute together securely. Most existing secure multi-party computation protocol based on blind quantum computing rely on DT(G) states to perform joint computation. However, this can lead to security risks because one client has too much authority, and these schemes also lack generality. In this paper, a secure multi-party computation protocol is proposed based on brickwork states. By exploiting and optimizing the properties of these states, the security issues in joint client computation are solved and centralized authority is avoided. Meanwhile, it reflects the interactive mode in multi-party computation. The proposed protocol effectively improves the generality of computation.
Abstract Most existing blind quantum computation protocols involve a client and a server or multiple servers. The case of multiple clients needs to be explored as well, but it becomes less secure as more people are involved. Authentication helps to solve the problem by enabling clients and servers to verify each other’s identity. In this paper, a multi-party verifiable blind quantum computation protocol with mutual authenti-cation is proposed which consists of three phases. Firstly, we improve the method for generating keys. Based on this, a deterministic method is proposed to generate authentication keys. Then, the client and the server perform mutual authentication. Finally, the only requirement for the client is to perform the gate S to accomplish the quantum computing task. The proposed protocol can resist both insider and outsider attacks, ensuring the legitimacy of clients and servers in a quantum network. The protocol further also limits the client’s quantum power and allows the client to verify the accuracy of the calculation results.
Blind quantum computation (BQC) provides a solution for clients with limited quantum capabilities to delegate their quantum computational tasks to remote quantum servers while keeping their own data private. In this paper, we first propose three multi-party verifiable blind quantum computation (MPVBQC) protocols, each of which can handle one type of clients with certain simple quantum capabilities such as making single-qubit measurements, preparing single qubits, or performing a few single-qubit gates. Then a flexible and hybrid MPVBQC framework for multi-type clients in quantum networks is given by combining the three proposed MPVBQC protocols. It simultaneously allows at least three types of clients in quantum networks to achieve BQC depending on their own quantum devices. Furthermore, all the proposed protocols can achieve identity authentication, resist both insider and outsider attacks, and be verifiable which means that the clients can verify the correctness of their computational results.
Abstract Blind quantum computation (BQC) allows a client without enough quantum technologies to delegate her quantum computation to a remote quantum server, while keeping her input, output and algorithm secure. In this paper, we propose a universal single-server and almost-classical-client BQC protocol. In this protocol, the client interfaces with only one server and the only ability of the client required is to get particles from the trusted center and forward them to the server. We present an analysis of this protocol and modify it to a universal single-server and fully-classical-client BQC protocol by improving the ability of the trusted center. Based on our protocols and recent works, a new ‘Cloud + Certificate Authority (CA)’ style is proposed for the BQC.
Quantum computing has considerable advantages in solving some problems over its classical counterpart. Currently various physical systems are developed to construct quantum computers but it is still challenging and the first use of quantum computers may adopt the cloud style. Blind quantum computing (BQC) provides a solution for clients with limited quantum capabilities to delegate their quantum computation to remote quantum servers while keeping input, output, and even algorithm private. In this paper, we propose three multi-party verifiable blind quantum computing (VBQC) protocols with identity authentication to handle clients with varying quantum capabilities in quantum networks, such as those who can just make measurements, prepare single qubits, or perform a few single-qubit gates. They are client-friendly and flexible since the clients can achieve BQC depending on their own quantum devices and resist both insider outsider attacks in quantum networks. Furthermore, all the three proposed protocols are verifiable, namely that the clients can verify the correctness of their calculations.
Blind quantum computation (BQC) enables a client without enough quantum power to delegate his quantum computation to a quantum server, while keeping the input data, the algorithm and the result unknown to the server. In the studies of practical BQC protocol, an important problem is how to reduce the quantum requirement of the client. Multi-server BQC protocols have been proposed to solve this problem. We review the double-server and triple-server protocols [Li et al., Phys. Rev. A 89, 040302(R) (2014)], and propose a modified double-server BQC protocol with a trusted center. In our protocol, the servers are allowed to communicate mutually, and the client is completely classical. Furthermore, our double-server protocol can be modified into a single-server protocol by simply combining the two servers. Compared with the triple-server protocol, our double-server and single-server protocols are more simple and the client is not required to have the ability to access quantum channel. So our protocols are more practical when quantum computer is applied in the `cloud' model.
Abstract Blind quantum computation (BQC) allows clients with limited quantum capabilities to delegate computational tasks to remote quantum servers while keeping the privacy of their data. However, existing BQC protocols often fail to balance resource consumption and practical feasibility, which is particularly significant in the noisy intermediate-scale quantum era. In this paper, we propose a practical BQC model based on the parity quantum computing framework. It requires the server to perform operations only on adjacent qubits and eliminates the need for additional SWAP gates when two-qubit gates should be applied to non-adjacent qubits, greatly facilitating the physical implementation on real quantum devices. Furthermore, we prove that the proposed BQC model ensures the privacy of client’s information and satisfies the property of verifiability which enables clients to identify dishonest servers. Finally, a detailed example is given and simulated on the IBM’s quantum platform to demonstrate its feasibility.