The development of automated gate specification for quantum communications and quantum networked computation opens up the way for malware designed at corrupting the automation software, changing the automated quantum communications protocols and algorithms. We study two types of attacks on automated quantum communications protocols and simulate these attacks on the superdense coding protocol, using remote access to IBM's Quantum Computers available through IBM Q Experience to simulate these attacks on what would be a low noise quantum communications network. The first type of attack leads to a hacker-controlled bijective transformation of the final measured strings, the second type of attack is a unitary scrambling attack that modifies the automated gate specification to effectively scramble the final measurement, disrupting quantum communications and taking advantage of quantum randomness upon measurement in a way that makes it difficult to distinguish from hardware malfunction or from a sudden rise in environmental noise. We show that, due to quantum entanglement and symmetries, the second type of attack works as a way to strategically disrupt quantum communications networks and quantum networked computation in a way that makes it difficult to ascertain which node was attacked. The main findings are discussed in the wider setting of quantum cybersecurity and quantum networked computation, where ways of hacking including the role of insider threats are discussed.
The development of automated gate specification for quantum communications and quantum networked computation opens up the way for malware designed at corrupting the automation software, changing the automated quantum communications protocols and algorithms. We study two types of attacks on automated quantum communications protocols and simulate these attacks on the superdense coding protocol, using remote access to IBM's Quantum Computers available through IBM Q Experience to simulate these attacks on what would be a low noise quantum communications network. The first type of attack leads to a hacker-controlled bijective transformation of the final measured strings, the second type of attack is a unitary scrambling attack that modifies the automated gate specification to effectively scramble the final measurement, disrupting quantum communications and taking advantage of quantum randomness upon measurement in a way that makes it difficult to distinguish from hardware malfunction or from a sudden rise in environmental noise. We show that, due to quantum entanglement and symmetries, the second type of attack works as a way to strategically disrupt quantum communications networks and quantum networked computation in a way that makes it difficult to ascertain which node was attacked. The main findings are discussed in the wider setting of quantum cybersecurity and quantum networked computation, where ways of hacking including the role of insider threats are discussed.
The paper gives the demonstrates of quantum super dense protocol and its related. Firstly, Qiskit's simulator is used to set-up and run the proposed quantum circuit, and then IBM quantum computer will be used to run the circuit for evaluation. In addition, we also introduce the two types of attacks which are possible on communication system and its simulation on IBM quantum computer via using quantum super dense protocol. The main findings are discussed in the wider setting of quantum cyber-security, where ways of hacking including the role of insider threats are discussed. Keywords—Quantum information, Quantum communication protocol, Quantum super dense coding, Quantum simulator, Quantum IBM Computer, Qiskit’s simulator
Quantum superdense coding protocol is addressed in the literature as a promising approach for efficient quantum communication. It allows two parties, to transmit classical bits using quantum bits. However, its security is threatened by a scrambling attack that involves modifying the automated gate specification to effectively scramble the final measurement, and by a bijection attack that performs a bijective transformation on the final measured strings. In this paper, we propose a novel approach to preventing such attacks by introducing decoy qubits into the superdense coding protocol, which act as a source of randomness that can detect any tampering with the entangled states and enable the detection of an eavesdropper. To strategize the selection and sending of these decoy qubits and address the interaction between the sender, receiver, and eavesdropper, we propose a dynamic non-cooperative game-based approach evaluated with a Q-learning algorithm to model and analyze this problem as a benefit-cost model. The utility functions of the proposed game are based on the concepts of return on protection, which illustrates the gain of selecting and sending a decoy qubit, and return on attack, which illustrates the reward of the eavesdropper for performing an attack to compromise the communication. Moreover, we discuss and analyze the Nash equilibrium convergence of this attack-defense model. Finally, we perform simulation work using a Q-learning algorithm to show the effectiveness of the proposed model in assessing the behavior of the players and its ability to reach equilibrium within a finite number of steps.
In quantum information theory, superdense coding allows two network entities to exchange two classical bits via a quantum channel using a single quantum bit (qubit) transmission, provided they have pre-shared an entangled qubit. An attacker intercepting the qubit during transmission cannot extract meaningful data without the other entangled qubit from the pair. However, an attacker can disrupt the communication by introducing its own qubit to the receiver. To enhance the security of superdense coding, we propose an authentication mechanism through a classical communication channel.
With rising cyberattack frequency and range, Quantum Computing companies, institutions and research groups may become targets of nation-state actors, cybercriminals and hacktivists for sabotage, espionage and fiscal motivations as the Quantum computing race intensifies. Quantum applications have expanded into commercial, classical information systems and services approaching the necessity to protect their networks, software, hardware and data from digital attacks. This paper discusses the status quo of quantum computing technologies and the quantum threat associated with it. We proceed to outline threat vectors for quantum computing systems and the respective defensive measures, mitigations and best practices to defend against the rapidly evolving threat landscape. We subsequently propose recommendations on how to proactively reduce the cyberattack surface through threat intelligence and by ensuring security by design of quantum software and hardware components.
Abstract The superdense coding protocol is essential for quantum communication, allowing more efficient data transmission. This protocol facilitates the transfer of two bits of classical information using just one qubit by leveraging a pre-existing pair of Bell states. To achieve this capability, traditional implementations of superdense coding depend on entangled states, such as Bell states. This paper introduces a novel circuit that utilizes Bell diagonal states to implement the superdense coding protocol. We provide detailed instructions for the procedure using IBM’s Quantum Computing Lab, enabling practical applications in real-world contexts. Furthermore, the paper highlights the security features of this protocol, emphasizing its significance for secure communication in quantum networks. The combination of efficiency and security represents a notable advancement in quantum information science. We implemented and tested the proposed superdense coding circuit on the IBM Q quantum computing platform using Qiskit. Through extensive simulations on IBM’s Statevector and QASM simulators, we assessed the performance of the circuit based on Bell diagonal states (BDS)in terms of accuracy, noise resilience, and resource efficiency. Our findings indicate that, while Bell diagonal states pose challenges related to noise and decoherence, they also provide potential advantages in reducing qubit usage and enhancing error correction. This research contributes to the exploration of alternative techniques for superdense coding, which may have applications in quantum communication and future quantum networks. However, additional theoretical and experimental investigations are necessary to fully evaluate the scalability and practicality of this approach.
As the race to develop practical quantum computers heats up, businesses, academic institutions, and research organisations working in the field may find themselves the focus of increasingly sophisticated cyberattacks for espionage, economic gain, and other nefarious purposes. As a consequence of the proliferation of quantum applications, conventional commercial information systems and services are rapidly approaching the point at which they will be required to protect their networks, software, hardware, and data from being subjected to digital assaults. This is the case as a result of the fact that quantum applications have been expanding. In this paper, we take a look at the present level of quantum computing as well as the risks that are associated with the emergence of this new area. We next proceed to describe potential attack vectors against quantum computing systems and the countermeasures, precautions, and best practises that can be taken to protect against them. After that, we propose suggestions for proactively reducing the cyberattack surface through threat intelligence and by ensuring the security by design of quantum software and hardware components.