Trojan Horse Attacks Research Articles

Trojan Horse Attacks, Decoy State Method, and Side Channels of Information Leakage in Quantum Cryptography

Early proofs of key secrecy in quantum cryptography systems were based on the assumption that the transmitting and receiving stations are completely isolated from the outside world—the eavesdropper. However, this condition cannot be implemented in practice since quantum cryptography systems are open systems in the sense that the eavesdropper may have indirect access, for example, through a fiber communication channel, to the critical elements of the equipment (phase modulators, intensity modulators, etc.) using active probing of the state of these elements. The state of the elements carries information about the transmitted key. In addition, the eavesdropper can use passive detection of side radiation from the receiving and transmitting equipment. Signals in side channels of information leakage may have extremely low intensity and are actually quantum signals. The eavesdropper may use the joint measurement of quantum information states in the communication channel and of states in various side channels of information leakage. The paper considers both passive attacks with measurement of side radiation and active attacks involving the probing of the states of the phase modulator and the intensity modulator, as well as backscattering radiation of single-photon avalanche detectors, which occurs during detecting information states on the receiver side. Combined attacks are also considered. The decoy state method is generalized with regard to active probing attacks, and boundaries for state parameters in side communication channels are obtained that guarantee secret key distribution for a given length of the communication channel.

Finite-key security analysis of the 1-decoy state QKD protocol with a leaky intensity modulator

The finite-key security of the standard three-intensity decoy-state quantum key distribution (QKD) protocol in the presence of information leakage has been analyzed (Wang et al. in New J Phys 20:083027, 2018). On the other hand, the 1-decoy state QKD protocol has been proved to be able to achieve higher secret key rate than the three-intensity decoy-state QKD protocol in the finite-key regime by using only two different intensity settings (Davide et al. in Appl Phys Lett 112:171104, 2018). In this work, we analyze the finite-key security of the 1-decoy state QKD protocol with a leaky intensity modulator, which is used to generate the decoy state. In particular, we simulate the secret key rate under three practical cases of Trojan-horse attacks. Our simulation results demonstrate that the 1-decoy state QKD protocol can be secure over long distances within a reasonable time frame given that the intensity modulator is sufficiently isolated. By comparing the simulation results to those presented in Wang et al. (2018), we find that, as expected, the 1-decoy state QKD protocol is more robust against information leakage from the intensity modulator for all achievable distances.

Secure and efficient quantum designated verifier signature scheme

A digital signature with designated verifier (SWDV) makes that only the designated verifier can verify its validity. It can be used to protect the privacy and economic interest of the signer. So, the SWDV schemes have many applications in e-voting, auction and some other fields. To make the SWDV secure against the quantum forger, a quantum signature with designated verifier signature (QSWDV) scheme is proposed. Our QSWDV is robust due to its strong security against forgery attack, inter-resending attacks, impersonation attacks and Trojan horse attacks. Its properties such as non-transferability and hiding source can be guaranteed by the signature simulation of the designated verifier. What is more, our scheme can be proved to be information-theoretically secure, which can guarantee the secrecy of the signer’s private key and the unforgeability of the QSWDV. In the proposed QSWDV scheme, the partners neither need use quantum one-way function nor need perform quantum state comparisons, which can reduce the complexity and improve the efficiency the QSWDV scheme.

Passive continuous-variable quantum secret sharing using a thermal source

We propose a continuous-variable quantum secret sharing (CV-QSS) protocol in which the quantum states are prepared passively using a thermal source. In our protocol, one player splits the output of a thermal source into two spatial modes with the help of a beam splitter, then he (or she) measures one of the correlated thermal states and sends the others to the secure station of the adjacent player in sequence after using appropriate optical attenuation, which waives the necessity of employment of high extinction ratio modulators with good stability. Therefore, the proposed protocol provides convenient implementation in QSS framework. Moreover, our scheme is immune to Trojan horse attacks. We derive the security bounds for our protocol against both eavesdroppers and dishonest players. Furthermore, we can achieve tighter bound of QSS distance by considering the finite-size effect, which is more practical than that obtained in the asymptotic limit.

Semi-device-independent quantum money

The seminal idea of quantum money, not forgeable due to laws of Quantum Mechanics, proposed by Stephen Wiesner, has laid the foundations for the Quantum Information Theory in the early ’70s. Recently, several other schemes for quantum currencies have been proposed, all, however, relying on the assumption that the quantum source device, acts according to its specification. This makes several known quantum money protocols vulnerable to the so-called hardware Trojan horse attacks. We, therefore, study the following problem: to what extent quantum money schemes can be made independent from the inner working of source and verification-devices used by the honest parties (bank and mint) in creating and processing the quantum money? Drawing inspirations from the semi-device-independent quantum key distribution protocol, we introduce the first scheme of quantum money with this assumption partially relaxed, along with the proof of its unforgeability. Finally, we formulate and discuss a quantum analog of the Oresme–Copernicus–Gresham’s law of economy, that may hold in the future.

A Novel Quantum Solution to Privacy-preserving Lexicographical String Sorting Problem

A novel quantum protocol for privacy-preserving lexicographical string sorting problem based on POVM measurement is proposed. Using the POVM measurement and a designed coding scheme, Alice and Bob can jointly determine the lexicographical position of their strings. Correctness analysis shows that our protocol can get the sorting result correctly. Our protocol can also resist outside attacks, such as Trojan horse attack, intercept-resend attack, entanglement-and-measure attack, man-in-the-middle attack and so on. And it also can overcome participant attacks and parties will not leak their private information to each other.

Quantum designated verifier signature based on Bell states

Recently, Shi et al. proposed two quantum designated verifier signature (QDVS) schemes. First, we demonstrate the forgery attack and repudiation attack to Shi et al.’s quantum QDVS schemes. Then, a new QDVS scheme based on Bell states is proposed. Our scheme overcomes the security drawbacks of Shi et al.’s scheme. It is secure against forgery attack, repudiation attack, inter-resending attack, impersonation attack and Trojan horse attack. What is more, our scheme has a strong security. It can be proved to be information-theoretically secure. Our scheme also has the properties such as designated verification, non-transferability and hiding source. On the other hand, in our scheme, the partners need not use any quantum one-way function or perform any quantum state comparison algorithm. The qubit efficiency of our scheme can achieve 66.7%. Therefore, our scheme is more secure and efficient than the similar schemes.

Quantum signature for designated verifier with strong security

Most of the classical designated verifier signature schemes are insecure against quantum adversary. In this paper, a quantum signature scheme for the designated verifier is proposed. In our scheme, during the initialization phase, the partners share secret keys by performing the quantum key distribution protocol. On the other hand, by performing the quantum direct communication protocol, the key generator center shares secret keys with the signer and the designated verifier, respectively. The key generator center generates a particle sequence of Bell state and distributes the particles between the signer and the designated verifier. During the signature generation phase, the signer encrypts the particle sequence by the secret keys and Hardmard operators. After that, the signer performs the controlled unitary operations on the encrypted particle sequence so as to generate the quantum signature. The designated verifier can simulate the quantum signature by performing the same symmetric signing steps as that performed by the original signer. Hence, the quantum signature signed by the true signer is the same as the one simulated by the receiver, which makes our scheme possess the designated properties. During the signature verification phase, the designated verifier performs the controlled unitary operations on the quantum signature and obtains the quantum ciphertexts. After that, the designated verifier decrypts the quantum ciphertexts by the symmetric secret keys and Hardmard operators so that the quantum signature can be verified. Our signature is secure against forgery attack, inter-resending attacks and Trojan horse attack. Because the trace distance between the density operators of different quantum signatures is zero, the information-theoretical security of our quantum signature scheme can be proved. The unconditionally secure quantum key distribution protocol and the one-time pad encryption algorithm can guarantee the security of the secret keys shared by the partners. What is more, the security assumption about the key generation center is weak. That is, it is not necessary to assume that the key generation center should be fully trusted. On the other hand, in our scheme, the quantum one-way function is not used. To generate a quantum signature, the signer need not prepare for entangled particle sequence. To verify a quantum signature, the verifier need not apply any state comparison to the received particles. The qubit efficiency is 100%. Therefore, our scheme has the advantages in the security and efficiency over the other quantum signature schemes for the designated verifier.

Анализ эффективности методов защиты от атак активного оптического зондирования на волоконные системы квантового распределения ключей в спектральном диапазоне 1260-1650 nm

In this paper, the results of research of spectral features of several passive fiber optic components are presented. There are spectra of isolators, circulators, spectral filters, and WDM, that are used in quantum key distribution (QKD) systems, and contribute to the protection of these systems against active optical probing attacks. We also provide an estimate of the degree of isolation required to protect the QKD system from Trojan-horse attacks. Based on the isolation requirements and measurement data we analyzed the efficiency of the QKD system protection through the use passive isolating components. As an example, we have shown the achievement of the required isolation level (150 dB) in the considered spectral range in the system presented in the article.

Unambiguous measurements and Trojan-horse attack in quantum cryptography

Early security proofs of the keys in quantum cryptography systems were based on the assumption that the transmitting and receiving stations were completely isolated from the outside world—the eavesdropper. However, this condition cannot be implemented in practice, since quantum cryptography systems are open systems, in the sense that an eavesdropper can have indirect access, for example, through a fiber communication channel to critical equipment elements (phase modulators, intensity modulators, etc) using active sensing of the state of these elements—Trojan-horse attacks. A new Trojan-horse attack based on joint unambiguous measurements of reflected probing states from an intensity modulator and information states in a quantum communication channel is proposed. Estimates of attack parameters for a number of quantum key distribution protocols are given, when an attack leads to compromise of keys.

Lightweight mediated semi-quantum key distribution protocol

Classical users can share a secret key with a quantum user by using a semi-quantum key distribution (SQKD) protocol. Allowing two classical users to share a secret key is the objective of the mediated semi-quantum key distribution (MSQKD) protocol. However, the existing MSQKD protocols need a quantum user to assist two classical users in distributing the secret keys, and these protocols require that the classical users be equipped with a Trojan horse photon detector. This reduces the practicability of the MSQKD protocols. Therefore, in this study we propose a lightweight MSQKD, in which the two participants and third party are classical users. Due to the usage of the one-way transmission strategy, the proposed lightweight MSQKD protocol is free from quantum Trojan horse attack. The proposed MSQKD is more practical than the existing MSQKD protocols.

Active sensing and side channels of information leakage in quantum cryptography

Various Trojan-horse attacks on quantum cryptography systems are systematically considered: an attack with passive detection of side radiation, an attack with active sensing, as well as joint attacks on states in the quantum channel, side and reflected radiation. It is shown that the most effective attack is an attack with the measurement of the number of photons in the reflected states and further joint measurement of information and reflected quantum states. Explicit estimates are obtained for the intensity of the reflected quantum states at which secret keys can be transmitted to a given length.

Practical quantum private query based on Bell state

Quantum private query (QPQ) is a cryptographic application that protects the privacy of both users and databases while querying the database secretly. In most existing QPQ protocols, the protection of user privacy can only be cheat-sensitive. Cheat-sensitive means that Bob will be found later with a certain probability if he tries to get the address queried by Alice. On the premise of cheat-sensitivity, although Alice can discover Bob’s malicious behavior after a query (transaction), the secret information of Alice was leaked in the completed query, which is likely to be a fatal blow to Alice. Or, to prevent Bob’s malicious behavior, Alice executes one or more additional queries to test Bob’s honesty. However, to bypass Alice’s honesty test, Bob can also provide several honest queries before performing dishonest queries. Therefore, cheat-sensitive should not be the ultimate goal of user privacy protection in QPQ. In this paper, we propose a practical QKD-based QPQ protocol with better user privacy protection than cheat-sensitivity based on order rearrangement of qubits. The proposed QPQ protocol can resist the Trojan horse attack even without wavelength filter and photon number splitter (PNS) equipped with auxiliary monitoring detectors.

Quantum key distribution with flawed and leaky sources

In theory, quantum key distribution (QKD) allows secure communications between two parties based on physical laws. However, most of the security proofs of QKD today make unrealistic assumptions and neglect many relevant device imperfections. As a result, they cannot guarantee the security of the practical implementations. Recently, the loss-tolerant protocol (K. Tamaki et al., Phys. Rev. A, 90, 052314, 2014) was proposed to make QKD robust against state preparation flaws. This protocol relies on the emission of qubit systems, which, unfortunately, is difficult to achieve in practice. In this work, we remove such qubit assumption and generalise the loss-tolerant protocol to accommodate multiple optical modes in the emitted signals. These multiple optical modes could arise, e.g., from Trojan horse attacks and/or device imperfections. Our security proof determines some dominant device parameter regimes needed for achieving secure communication and, therefore, it can serve as a guideline to characterise QKD transmitters. Furthermore, we compare our approach with that of H.-K. Lo et al. (Quantum Inf. Comput., 7, 431–458, 2007) and identify which method provides the highest secret key generation rate as a function of the device imperfections. Our work constitutes an important step towards the best practical and secure implementation for QKD.

Multi-Party Quantum Summation Based on Quantum Teleportation.

We present a secure multi-party quantum summation protocol based on quantum teleportation, in which a malicious, but non-collusive, third party (TP) helps compute the summation. In our protocol, TP is in charge of entanglement distribution and Bell states are shared between participants. Users encode the qubits in their hand according to their private bits and perform Bell-state measurements. After obtaining participants’ measurement results, TP can figure out the summation. The participants do not need to send their encoded states to others, and the protocol is therefore congenitally free from Trojan horse attacks. In addition, our protocol can be made secure against loss errors, because the entanglement distribution occurs only once at the beginning of our protocol. We show that our protocol is secure against attacks by the participants as well as the outsiders.

Eavesdropping on quantum secret sharing protocols based on ring topology

Quantum secret sharing (QSS) is the process of splitting a secret message into multiple parts such that no subset of parts is sufficient to reconstruct the secret message, but the entire set is. Ever since the first protocol was proposed, QSS has attracted intensive study, and many protocols have been proposed and implemented over recent years. However, we discover that several ring-topology based QSS protocols cannot resist Trojan-horse attacks. In this paper, we first give a modified Trojan-horse attack strategy and show that the eavesdropper can obtain any player's private data and the dealer's secret message without leaving any trace. Then we show that existing defense strategies cannot resist our attack. To defeat such attacks, we design a defense strategy based on quantum memory and evaluate its performance. The evaluation results indicate that the eavesdropper's attack significantly increases the quantum bit error rate and can thus be detected.

Three-party quantum secret sharing against collective noise

In this paper, based on logical GHZ states and logical χ-states, we present four three-party quantum secret sharing protocols immune to the collective-dephasing noise and the collective-rotation noise, respectively. They make full use of the measurement correlation property of multi-particle entangled states and local unitary operations. Compared with existing three-party quantum secret sharing protocols against collective noise, our protocols are the most efficient. Furthermore, these protocols are congenitally free from the Trojan horse attacks.

Practical Two-Way QKD-Based Quantum Private Query with Better Performance in User Privacy

Quantum privacy query (QPQ) is a cryptographic application that protects the privacy of both users and databases while querying the database secretly. In most existing QPQ protocols, the protection of user privacy can only be cheat-sensitive. Cheat-sensitive means that Bob will be found later with a certain probability if he tries to get the address queried by Alice. On the premise of cheat-sensitive, although Alice can discover Bob’s malicious behavior after a query (transaction), the secret information of Alice was leaked in the completed query, which is likely to be a fatal blow to Alice. Or, to prevent Bob’s malicious behavior, Alice executes one or more additional queries to test Bob’s honesty. However, to bypass Alice’s honesty test, Bob can also provide several honest queries before performing dishonest queries. Therefore, cheat-sensitive should not be the ultimate goal of user privacy protection in QPQ. In this paper, we propose a two-way QKD-based QPQ protocol with better user privacy protection than cheat-sensitive based on order rearrangement of qubits. The proposed QPQ protocol can resist the Trojan horse attack even without wavelength filter and photon number splitter equipped with auxiliary monitoring detectors.

Quantum key agreement with Bell states and Cluster states under collective noise channels

The collective noises, which include the collective-dephasing noise and the collective-rotation noise, are the topical noises in quantum key agreement (QKA). How to eliminate the influence of the collective noises on quantum communication is a problem to be solved urgently. In this paper, based on logical quantum states, by using controlled-Z, controlled-NOT and unitary operations, two QKA protocols which can be immune to the collective-dephasing noise and the collective-rotation noise are proposed, respectively. The security analysis indicates that these two protocols can resist participant attack and outsider attacks which include Trojan-horse attacks, intercept-resend attack, measure-resend attack and entangle-measure attack. By comparing with the proposed two-party QKA protocols against the collective noises, it is clear that our protocols are more efficient.

Cryptanalysis of Zhang et al’s Quantum Private Comparison and the Improvement

Based on EPR pairs, Zhang et al. analyzed the security of Yang and Tseng et al’s two QPC protocols, and proposed some new improvement strategies (Zhang and Zhang, Quantum Inform. Process. 12(5):1981–1990 2013). This paper points that Zhang et al’s protocol is insecure under a special attack, i.e. Trojan-horse attacks. To avoid this attack, we present an improved QPC protocol based on single particle encryption. Through security analysis of presented protocol, the improved protocol can resist Trojan horse attack (THA). We give a suggestion that non-orthogonal quantum states can be used to transmit information for reducing the leakage in a QPC protocol.