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

Zhongguo kexue. Wulixue Lixue Tianwenxue

Anonymous blind quantum computation protocol fordistributed quantum networks

Dong-Mei Gao, Yu‐Guang Yang

Published Oct 17, 2022• 2 citations
Publisher

Abstract

Quantum cyber security aims to examine the communication and computation of security within a distributed quantum network. Two primary security concerns, privacy and anonymity, are typically investigated in quantum computational tasks. Therefore, this study proposes a state-of-the-art, single-server, multi-user anonymous blind quantum computation protocol, wherein the anonymous entanglement shared between the server and user is utilized as a quantum resource for blind quantum computation tasks. The anonymity, blindness, and security analyses demonstrated that the proposed protocol can perform blind quantum computation tasks while maintaining the confidentiality of the user identity. Compared with conventional blind quantum computation protocols, this protocol provides additional security for blind quantum computing and serves as a novel design idea for anonymous quantum cryptography protocols.

DOI
10.1360/sspma-2022-0370

Related papers

Quantum Anonymous Private Information Retrieval for Distributed Networks

Awais Khan, Uman Khalid, Junaid ur Rehman +1 more

Quantum cybersecurity is the study of all facets regarding the security of communication and computation in a distributed network. Significant developments in quantum technologies have outclassed their classical counterparts, thus envisioning the realization of a quantum internet. However, such quantum resources, in the hands of an adversary, can jeopardize network security. In this paper, we study two secure network connectivity concerns, namely,privacyandanonymity, in quantum information retrieval systems. To this end, we propose a state-of-the-art single-server multi-user quantum anonymous private information retrieval (QAPIR) protocol. To actualize this, we utilize anonymous entanglement as a quantum resource. We show that the QAPIR protocol not only provides privacy but also introduces anonymity as an added layer of security in quantum networks. Furthermore, we also detail a comparative security analysis that establishes the desirable properties of our proposal.

IEEE Transactions on Communications•Apr 18, 2022•29 citations

On the Security of Two Blind Quantum Computations

Shih-Min Hung, Tzonelih Hwang

Blind quantum computation (BQC) protocol allows a client having partial quantum ability to delegate his quantum computation to a remote quantum server without leaking any information about the input, the output and the intended computation to the server. Several BQC protocols have been proposed, e.g., Li et al. in [1] proposed a triple-server BQC protocol and Xu et al. in [2] proposed a single-server BQC protocol. Though both papers claimed that their protocols can satisfy the requirement of privacy, this paper points out a security loophole in their protocols. With that the server can reveal the private information of the client.

arXiv:1508.07478•Aug 29, 2015•2 citations

Experimental implementation of secure anonymous protocols on an eight-user quantum network

Zixin Huang, Siddarth Koduru Joshi, Djeylan Aktas +12 more

Anonymity in networked communication is vital for many privacy-preserving tasks. Secure key distribution alone is insufficient for high-security communications, often knowing who transmits a message to whom and when must also be kept hidden from an adversary. Here we experimentally demonstrate 5 information-theoretically secure anonymity protocols on an 8 user city-wide quantum network using polarisation-entangled photon pairs. At the heart of these protocols is anonymous broadcasting, which is a cryptographic primitive that allows one user to reveal one bit of information while keeping her identity anonymous. For a network of $n$ users, the protocols retain anonymity for the sender, given less than $n-2$ users are dishonest. This is one of the earliest implementations of genuine multi-user cryptographic protocols beyond standard QKD. Our anonymous protocols enhance the functionality of any fully-connected Quantum Key Distribution network without trusted nodes.

arXiv:2011.09480•Nov 18, 2020•4 citations

Comparison on security of single server and multiple servers blind quantum protocols

Yuichi Sano

A user who delegates quantum computation to others hopes to keep information on the computation secret. Several different blind quantum computation protocols which attain this goal have been proposed thus far. While in single server protocols a user needs to manipulate quantum states, multiple server protocols do not require a user to have any quantum equipment although they prohibit any communication among servers even after the computation. It is not a straightforward task for a user to decide the most proper protocol among them as each protocol has its own merits and defects. In this paper we introduce a notion called usability which enables us to compare the different protocols. In particular we consider a blind protocol with multiple servers which allows classical communication during and after the computation, and compare it with a single server protocol. As a result we find that their usability are partially equal to each other.

•Jun 10, 2021•0 citations

Experimental implementation of secure anonymous protocols on an eight-user quantum key distribution network

Zixin Huang, Siddarth Koduru Joshi, Djeylan Aktas +12 more

Abstract Anonymity in networked communication is vital for many privacy-preserving tasks. Secure key distribution alone is insufficient for high-security communications. Often, knowing who transmits a message to whom and when must also be kept hidden from an adversary. Here, we experimentally demonstrate five information-theoretically secure anonymity protocols on an eight user city-wide quantum network using polarisation entangled photon pairs. At the heart of these protocols is anonymous broadcasting, which is a cryptographic primitive that allows one user to reveal one bit of information while keeping their identity anonymous. For a network of n users, the protocols retain anonymity for the sender, given that no more than n − 2 users are colluding. This is an implementation of genuine multi-user cryptographic protocols beyond standard QKD. Our anonymous protocols enhance the functionality of any fully-connected Quantum Key Distribution network without trusted nodes.

npj Quantum Information•Mar 7, 2022•34 citations

Quantum secure blind decryption with two users

Masahito Hayashi, Yuki Ito

We propose two types of protocols for quantum secure blind decryption, involving two users and servers. User 1 holds the encrypted ciphertext. The servers store several indexed keys including the key encrypting the ciphertext. User 2 aims to obtain the decrypted text. The protocols are designed to preserve the following types of secrecy: Users ensure the secrecy of the text from the servers. Servers maintain the secrecy of the keys from the users. Our protocols enable User 2 to obtain the decrypted text while preserving these secrecy requirements. Additionally, the second protocol ensures the secrecy of the key index to identify the key encrypting the ciphertext from the servers, and the second protocol requires two non-commuting servers. Furthermore, we analyze the secrecy of the second protocol under post-attack scenarios, where the two servers communicates with each other after the completion of the protocol. We show that our quantum protocol satisfies the secrecy under these attacks, whereas its classical counterpart fails to do so.

quant-pharXiv:2606.01949•Jun 2, 2026•0 citations
Quantum cyber security aims to examine the communication and computation of security within a distributed quantum network. Two primary security concerns, privacy and anonymity, are typically investigated in quantum computational tasks. Therefore, this study proposes a state-of-the-art, single-server, multi-user anonymous blind quantum computation protocol, wherein the anonymous entanglement shared between the server and user is utilized as a quantum resource for blind quantum computation tasks. The anonymity, blindness, and security analyses demonstrated that the proposed protocol can perform blind quantum computation tasks while maintaining the confidentiality of the user identity. Compared with conventional blind quantum computation protocols, this protocol provides additional security for blind quantum computing and serves as a novel design idea for anonymous quantum cryptography protocols.
Quantum cybersecurity is the study of all facets regarding the security of communication and computation in a distributed network. Significant developments in quantum technologies have outclassed their classical counterparts, thus envisioning the realization of a quantum internet. However, such quantum resources, in the hands of an adversary, can jeopardize network security. In this paper, we study two secure network connectivity concerns, namely,privacyandanonymity, in quantum information retrieval systems. To this end, we propose a state-of-the-art single-server multi-user quantum anonymous private information retrieval (QAPIR) protocol. To actualize this, we utilize anonymous entanglement as a quantum resource. We show that the QAPIR protocol not only provides privacy but also introduces anonymity as an added layer of security in quantum networks. Furthermore, we also detail a comparative security analysis that establishes the desirable properties of our proposal.
Blind quantum computation (BQC) protocol allows a client having partial quantum ability to delegate his quantum computation to a remote quantum server without leaking any information about the input, the output and the intended computation to the server. Several BQC protocols have been proposed, e.g., Li et al. in [1] proposed a triple-server BQC protocol and Xu et al. in [2] proposed a single-server BQC protocol. Though both papers claimed that their protocols can satisfy the requirement of privacy, this paper points out a security loophole in their protocols. With that the server can reveal the private information of the client.
Anonymity in networked communication is vital for many privacy-preserving tasks. Secure key distribution alone is insufficient for high-security communications, often knowing who transmits a message to whom and when must also be kept hidden from an adversary. Here we experimentally demonstrate 5 information-theoretically secure anonymity protocols on an 8 user city-wide quantum network using polarisation-entangled photon pairs. At the heart of these protocols is anonymous broadcasting, which is a cryptographic primitive that allows one user to reveal one bit of information while keeping her identity anonymous. For a network of nnn users, the protocols retain anonymity for the sender, given less than n−2n-2n−2 users are dishonest. This is one of the earliest implementations of genuine multi-user cryptographic protocols beyond standard QKD. Our anonymous protocols enhance the functionality of any fully-connected Quantum Key Distribution network without trusted nodes.
A user who delegates quantum computation to others hopes to keep information on the computation secret. Several different blind quantum computation protocols which attain this goal have been proposed thus far. While in single server protocols a user needs to manipulate quantum states, multiple server protocols do not require a user to have any quantum equipment although they prohibit any communication among servers even after the computation. It is not a straightforward task for a user to decide the most proper protocol among them as each protocol has its own merits and defects. In this paper we introduce a notion called usability which enables us to compare the different protocols. In particular we consider a blind protocol with multiple servers which allows classical communication during and after the computation, and compare it with a single server protocol. As a result we find that their usability are partially equal to each other.
Abstract Anonymity in networked communication is vital for many privacy-preserving tasks. Secure key distribution alone is insufficient for high-security communications. Often, knowing who transmits a message to whom and when must also be kept hidden from an adversary. Here, we experimentally demonstrate five information-theoretically secure anonymity protocols on an eight user city-wide quantum network using polarisation entangled photon pairs. At the heart of these protocols is anonymous broadcasting, which is a cryptographic primitive that allows one user to reveal one bit of information while keeping their identity anonymous. For a network of n users, the protocols retain anonymity for the sender, given that no more than n − 2 users are colluding. This is an implementation of genuine multi-user cryptographic protocols beyond standard QKD. Our anonymous protocols enhance the functionality of any fully-connected Quantum Key Distribution network without trusted nodes.
We propose two types of protocols for quantum secure blind decryption, involving two users and servers. User 1 holds the encrypted ciphertext. The servers store several indexed keys including the key encrypting the ciphertext. User 2 aims to obtain the decrypted text. The protocols are designed to preserve the following types of secrecy: Users ensure the secrecy of the text from the servers. Servers maintain the secrecy of the keys from the users. Our protocols enable User 2 to obtain the decrypted text while preserving these secrecy requirements. Additionally, the second protocol ensures the secrecy of the key index to identify the key encrypting the ciphertext from the servers, and the second protocol requires two non-commuting servers. Furthermore, we analyze the secrecy of the second protocol under post-attack scenarios, where the two servers communicates with each other after the completion of the protocol. We show that our quantum protocol satisfies the secrecy under these attacks, whereas its classical counterpart fails to do so.