Authentication is crucial for large and distributed systems, such as cyber-physical infrastructures. The focus of this paper is on the secure key distribution must be secure enough to any attempts to compromise the system. we first overview the key management scheme how probabilistic argumentation is applicable to modern public-key cryptography as an relevant gadget to evaluate webs of trust. W...

The common security criterion d in quantum key distribution is taken to solve the universal composability problem in quantum key distribution as well as providing good general quantitative security guarantee. In this paper it is shown that these are a result of an invalid interpretation of d. The general security significance of d is analyzed in detail. The related issues of universality and at...

• m, the length (in bits) of the private key to be generated. • ǫ, the maximum threshold value for the error rate during the quantum transmission (ǫ < 1/4). • τ , a security constant such that ǫ 1−ǫ < ǫ 1−ǫ + τ < 1. • the security parameter r. It must be large enough so that Alice and Bob can find a binary matrix K of size m × r such that any linear combination of rows of K that contains at lea...

Quantum key distribution (QKD) was proposed nearly 30 years ago by Bennett and Brassard [1] as a way to generate and distribute cryptographic keys whose security is guaranteed by the laws of physics, and in particular inherent limitations of quantum physics, rather than assumed limitations of a potential adversary’s computational power. Since that time, especially in the last 15 years or so, ge...

Quantum key distribution performs the trick of growing a secret key in two distant places connected by a quantum channel. The main reason is that the legitimate users can bound the information gathered by the eavesdropper. In practical systems, whether because of finite resources or external conditions, the quantum channel is subject to fluctuations. A rate adaptive information reconciliation p...

A new relativistic orthogonal states quantum key distribution protocol. The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. We introduce a new relativistic orthogonal states quantum key distribution protocol which leverages the properties of both quantum mechanics and special relativity to securely encode multiple bits onto the ...

An approach to the unconditional security of quantum key distribution protocols is presented, which is based on the uncertainty principle. The approach applies to every case that has been treated via the argument by Shor and Preskill, but it is not necessary to find quantum error correcting codes. It can also treat the cases with uncharacterized apparatuses. The proof can be applied to cases wh...

The first part of this paper presents two efficient cryptographic protocols, based on quantum entanglement, for secure exchange of secret keys. While the first protocol requires storage of entangled qubits, the second protocol has no storage requirements and presents a probabilistic model. We show that there is a tradeoff between security against eavesdropping and the efficiency of the protocol...

We provide a quantum key distribution protocol based on the correlations of the Greenburger-Horne-Zeilinger(GHZ) state. No classical communication is needed in the process of the establishment of the key. Our protocol is useful when an unjammable classical communication channel is unavailable. We prove that the protocol is secure.

What is the behavior of an adversary to launch attacks against a communication? The good choice is to eavesdrop the communication such that the communicators can not detect the eavesdropping. The general choice is to disrupt the communication at low cost, say, measuring the transferred quantum signals in the well-known BB84 quantum key distribution protocol. The bad choice is to disrupt it at e...