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

arXiv:1709.10420 · Quantum Information Processing

Arbitrable blind quantum computation

Go Sato, Takeshi Koshiba, Tomoyuki Morimae

Published Oct 30, 2019• 10 citations
arXivHTMLPDF
DOI
10.1007/s11128-019-2482-4

Related papers

Arbitrated Quantum Signature with Hamiltonian Algorithm Based on Blind Quantum Computation

Ronghua Shi, Wanting Ding, Jinjing Shi

International Journal of Theoretical Physics•Mar 22, 2018•12 citations

Blind Quantum Signature with Blind Quantum Computation

Wei Li, Ronghua Shi, Ying Guo

International Journal of Theoretical Physics•Dec 27, 2016•12 citations

Universal Blind Quantum Computation

Joseph F. Fitzsimons, Elham Kashefi

Bulletin of the American Physical Society•Feb 29, 2012•1 citation

Semi-quantum blind double signature scheme with semi-trusted arbitrator

Ling Zhang, Jia-Hao Zhang, Xiangjun Xin +1 more

In order to solve the security of electronic transactions on limited goods, some quantum blind double signature (QBDS) protocols were proposed. In existing QBDS protocols, all participants must have specific quantum computing capabilities. Realistically, high cost of quantum devices may hinder people from using the QBDS protocol. Therefore, we propose a semi-quantum arbitrator blind double signature (SQABDS) scheme. In this scheme, the sender (signer) and the receiver both are classical participants, which can relatively reduce the dependence on quantum hardware. The introduction of blind signers can protect the privacy of electronic transactions, the introduction of semi-trusted arbitrator can relax the strong assumption about the trustworthiness of the arbitrator, for the arbitrator cannot forge the signature. In addition, the SQABDS scheme can be used to sign classical messages directly without performing any quantum swapping tests or quantum gate operations. Finally, the analysis shows that our scheme is securer and its quantum cost is relatively lower.

Modern Physics Letters B•Feb 15, 2024•1 citation

Universal half-blind quantum computation

Xiaoqing Tan, Xu Zhou

Annals of Telecommunications•Jan 21, 2017•19 citations

Verifiable Multi‐Party Universal Blind Quantum Computing in Distributed Networks

SHAN Ruiting, CHEN Xiubo, Gang Xu +4 more

Blind quantum computing (BQC) ensures that a classical client could delegate complex computing tasks to a remote quantum server safely. In order to detect the dishonest behavior of the participants, we present a verifiable multi-party universal BQC protocol in distributed networks. By using the stabilizer formalism, we propose an honesty check method to test the correctness of the graph states generated by the servers. The honesty of both the clients and the servers can be judged fairly with the help of the arbitrator. Moreover, a load balancer is introduced to control the possible breakdown of servers in the network. No-signaling principle ensures the unconditional security of the protocol. Through the use of universal resource states, our protocol can be applied in more multi-party verifiable universal BQC protocols. The failure management and workload balancing of the protocol also provide a promising prospect for the future BQC network.

Chinese Journal of Electronics•Jul 1, 2021•3 citations
In order to solve the security of electronic transactions on limited goods, some quantum blind double signature (QBDS) protocols were proposed. In existing QBDS protocols, all participants must have specific quantum computing capabilities. Realistically, high cost of quantum devices may hinder people from using the QBDS protocol. Therefore, we propose a semi-quantum arbitrator blind double signature (SQABDS) scheme. In this scheme, the sender (signer) and the receiver both are classical participants, which can relatively reduce the dependence on quantum hardware. The introduction of blind signers can protect the privacy of electronic transactions, the introduction of semi-trusted arbitrator can relax the strong assumption about the trustworthiness of the arbitrator, for the arbitrator cannot forge the signature. In addition, the SQABDS scheme can be used to sign classical messages directly without performing any quantum swapping tests or quantum gate operations. Finally, the analysis shows that our scheme is securer and its quantum cost is relatively lower.
Blind quantum computing (BQC) ensures that a classical client could delegate complex computing tasks to a remote quantum server safely. In order to detect the dishonest behavior of the participants, we present a verifiable multi-party universal BQC protocol in distributed networks. By using the stabilizer formalism, we propose an honesty check method to test the correctness of the graph states generated by the servers. The honesty of both the clients and the servers can be judged fairly with the help of the arbitrator. Moreover, a load balancer is introduced to control the possible breakdown of servers in the network. No-signaling principle ensures the unconditional security of the protocol. Through the use of universal resource states, our protocol can be applied in more multi-party verifiable universal BQC protocols. The failure management and workload balancing of the protocol also provide a promising prospect for the future BQC network.