Related papers: Key exchange protocol based on circulant matrix ac…
We propose a new quantum key distribution scheme that uses the blind polarization basis. In our scheme the sender and the receiver share key information by exchanging qubits with arbitrary polarization angles without basis reconciliation.…
We consider a problem, which we call secure grouping, of dividing a number of parties into some subsets (groups) in the following manner: Each party has to know the other members of his/her group, while he/she may not know anything about…
A quantum key distribution protocol based on entanglement swapping is proposed. Through choosing particles by twos from the sequence and performing Bell measurements, two communicators can detect eavesdropping and obtain the secure key.…
The widespread use of wireless sensor networks (WSNs) that are consisted of resource-constrained sensor nodes in communication with gateways in open-space environments and industries has highlighted the need for a secure yet fast…
In this paper, a novel semi-quantum key distribution (SQKD) protocol is designed based on single photons in both polarization and spatial-mode degrees of freedom, which allows to establish a raw key between one quantum communicant and one…
Our goal is to provide different semiring-based formal tools for the specification of security requirements: we quantitatively enhance the open-system approach, according to which a system is partially specified. Therefore, we suppose the…
This paper investigates a reconciliation method in order to establish an errorless secret key in a QKD protocol. Classical key distribution protocols are no longer unconditionally secure because computational complexity of mathematical…
Circulant matrices are an important family of operators, which have a wide range of applications in science and engineering related fields. They are in general non-sparse and non-unitary. In this paper, we present efficient quantum circuits…
A new proposal for group key exchange is introduced which proves to be both efficient and secure and compares favorably with state of the art protocols.
We present a variational method to calculate the exchange interactions among donor clusters in a semiconductor. Such clusters are candidates for a so-called control-qubit architecture for quantum information, where the effective exchange…
Quantum key distribution, which allows two distant parties to share an unconditionally secure cryptographic key, promises to play an important role in the future of communication. For this reason such technique has attracted many…
In this paper, a new key-agreement scheme is proposed and analyzed. In addition to being provably secure in shared secret key indistinguishability model, the scheme has an interesting feature: while using exponentiation over a cyclic…
In conventional quantum key distribution protocols, the secure key is normally extracted from the measurement outcomes of the system. Here, a different approach is proposed, where the secure key is extracted from the measurement bases,…
We develop a new method to quantify the secret key rate for permutation-invariant protocols for coherent attacks and finite resources. The method reduces the calculation of secret key rates for coherent attacks to the calculation for…
In this paper we present a new primitive for a key exchange protocol based on multivariate non-commutative polynomial rings, analogous to the classic Diffie-Hellman method. Our technique extends the proposed scheme of Boucher et al. from…
We investigate the post-quantum security of the encrypted key exchange(EKE) protocols based on some basic physical parameters of ion-trap quantum computer, and show that the EKE protocol with a 40-bit password will be secure against a…
In recent times, secure quantum communication in layered networks has emerged as an important area of study. In this paper, we harness the potential offered by multidimensional states in secure quantum communication with only one quantum…
In this paper we present quantum key distribution protocol that, instead of single qubits, uses mesoscopic coherent states of light $|\alpha\rangle$ to encode bit values of a randomly generated key. Given the reference value…
A cryptographic protocol (CP) is a distributed algorithm designed to provide a secure communication in an insecure environment. CPs are used, for example, in electronic payments, electronic voting procedures, database access systems, etc.…
We use matrices over bit strings as platforms for Diffie-Hellman-like public key exchange protocols. When multiplying matrices like that, we use Boolean OR operation on bit strings in place of addition and Boolean AND operation in place of…