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.
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.
Quantum Anonymous Private Information Retrieval (QAPIR) allows a user to retrieve an item from a database anonymously thus achieving better user privacy. Recently, Khanet al. proposed the first QAPIR protocol [IEEE Trans. Commun. 70(6), 4026-4037 (2022)] which is the only known QAPIR protocol. However, a symbol coincidence error occurs when the main ingredients are combined to form this QAPIR protocol. Furthermore, it requires perfect (n+1)-partited-dimensional Greenberger-Horne-Zeilinger (GHZ) states to be pre-shared among the nodes whereD≥NandNis the size of the database. However, the difficulties in implementing the preparation of high-dimensional GHZ states and the quantum-computing-based queries under current technologies lead to the impracticability of this QAPIR protocol due to the extremely high dimensionalities of GHZ states and oracle operations when large databases are involved. To address these issues, we first point out the symbol coincidence error in Khanet al.’s QAPIR protocol and then give an improvement on it. Finally, we propose a practical QAPIR protocol based on quantum key distribution. We analyze its performance under certain types of noise. We also prove the security of our QAPIR protocol in an active adversary scenario where active dishonest users and database owner are taken into account. Compared with Khanet al.’s protocol, our protocol is easier to implement under current technologies, and can work over the noisy quantum channel.1It provides a practical way for the design of QAPIR protocols.
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.
In the shift toward the quantum computing era, the foundational principles of classical cybersecurity, particularly in the realm of cryptographic algorithms, are facing unprecedented challenges. This demands comprehensive reevaluation and redesign of cryptographic infrastructures to withstand quantum adversarial attacks. With the emergence of the quantum Internet, a new approach to secure communication is possible, utilizing quantum properties that have no counterpart in classical systems. As the quantum Internet facilitates the exchange of quantum information, data publication protocols become essential in anonymizing and protecting privacy-sensitive data in quantum communication networks. This paper proposes two controlled quantum anonymous communication (QAC) protocols for publishing classical and quantum information on an Internet server (IS) with the assistance of a communication service provider. The first protocol allows for the controlled publication of classical information without revealing the publisher’s identity such that an adversary, even with access to all network resources, cannot trace the publication source—i.e., achieving perfect untraceability. The second protocol enables anonymous publication of quantum information on an IS in a controlled and untraceable manner. These protocols serve as essential building blocks for advancing the quantum Internet, which has the potential to transform communication and information exchange methods. We provide a detailed anonymity analysis of these QAC protocols for data publication, ensuring that the published symbol or qudit information remains untraceable to its publisher. Moreover, the performance analysis in terms of publication error probability, fidelity, and degree of anonymity in noisy environments demonstrates the robustness of the protocols against noise and adversarial attacks.
We present the first quantum anonymous notification (QAN) protocol that introduces anonymity and paves the way for anonymous secure quantum communication in quantum networks. QAN protocol has applications ranging from multiparty quantum computation to quantum internet. We utilize the QAN protocol to propose an anonymous quantum private comparison protocol in an n-node quantum network. This protocol can compare private information of any 2≤k≤n parties with the help of the remaining n−k parties and a semi-honest third party. These protocols feature a traceless property, i.e., encoding operations cannot be traced back to their originating sources. Security analysis shows that this protocol is robust against external adversaries and malicious participants.
Preserving privacy in communication and networking is of paramount importance in the Internet-of-Everything age of escalating surveillance and data collection. Anonymous communication is a cornerstone of this endeavor, enabling individuals to interact and exchange private information without disclosing their identities. However, achieving absolute security and privacy in classical anonymous networks (CANs) is highly challenging, and in particular, the advent of quantum computing poses critical threats to securing classical communication. In this article, we explore the evolution of CANs and delve into the distinctive shift from classical to quantum anonymous networks (QANs), emphasizing a substantial leap in privacy protected by quantum anonymous communication (QAC). The fundamental motivations behind this transition are rooted in the remarkable privacy attributes—e.g., completeanonymityanduntraceability— of QAC protocols, as well as the unconditional security ensured by the principles of quantum mechanics. To make these concepts more tangible in practical settings and provide a benchmark to design the QAC protocols in QANs, we usher in exemplary protocols: quantum anonymous teleportation, voting, and information retrieval. In these case studies, we assess the fidelity and error rates of the QAC protocols in noisy environments, aiming to evaluate their robustness in practical quantum entangled settings. Moreover, we discuss the primary challenges and future research directions integral to the transition towards QANs.
Quantum Private Information Retrieval (QPIR) is a new and growing area that uses quantum computing to improve privacy and efficiency in database searches. Traditional Private Information Retrieval (PIR) methods often require a large amount of communication between the user and the server, making them slow and costly. QPIR aims to solve this problem by using quantum techniques like superposition and entanglement to reduce communication while keeping the user’s query private. In this paper, we review different QPIR methods and analyze how they handle communication complexity. We compare multi-server and single-server models, discussing their strengths and weaknesses. We also explore the practical challenges of QPIR, such as the need for quantum resources, errors in quantum systems, and security against quantum attackers. Additionally, we highlight important research gaps, including how to make single-server QPIR more efficient, balancing security with speed, and understanding how future quantum computers might impact QPIR security. By addressing these challenges, this survey aims to support further research and help develop practical, efficient, and secure QPIR systems for real-world use.