International Conference on Computer Communications and Networks (ICCCN)

Improving the efficiency of entanglement based quantum key exchange

Abhishek Parakh, Pramode K. Verma

Published Aug 1, 2014• 3 citations

Abstract

This article 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 in terms of usable bits available for the secret key. This security parameter s can be varied by the communicating parties based on practical considerations.

DOI: 10.1109/icccn.2014.6911853

Related papers

Improving efficiency of quantum key distribution with probabilistic measurements

Abhishek Parakh, Pramode K. Verma, Mahadevan Subramaniam

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 in terms of usable bits available for the secret key. This security parameter s can be varied by the communicating parties based on practical considerations. In the second part of the paper, we apply the probabilistic model to BB84 and show how it can be used to improve the efficiency of BB84.

International Journal of Security and NetworksJan 1, 20164 citations

QKD protocol based on entangled states by trusted third party

Abdulbast A. Abushgra, Khaled M. Elleithy

Quantum cryptography is considered a solution for sharing secret information in a secure mode. Establishing a quantum security platform into an exciting system requires a package of stable processes. One of these processes is based on creating a Quantum Key Distribution (QKD) protocol or sharing a secret key. This paper presents a QKD protocol that utilizes two quantum channels to prepare a shared secret key. The first communication channel will be initiated by entanglement states, where the entangled photons will be emitted by a trusted third party. The second communication channel utilizes the superposition states that will be initiated by the one of the communicated parties. Moreover, the protocol produces a string of random qubits after verifying the communicated legitimate parties during entangled state channels. The produced string will reflect the shared secret key between the users.

IEEE Long Island Systems, Applications and Technology Conference (LISAT)May 1, 20173 citations

Everlasting security in the bounded storage model

Yonatan Aumann, Yan Zong Ding, Michael O. Rabin

We address the problem of the-security of cryptographic protocols in face of future advances in computing technology and algorithmic research. The problem stems from the fact may be deemed that computations which at a given point in time may be deemed infeasible, can, in the course of years or decades, be made possible with improved hardware and/or breakthroughs in code-breaking algorithms. In such cases, the security of historical , but nonetheless highly confidential data may be in jeopardy. We present a scheme for efficient secure two-party communication with provable everlasting security. The security is guaranteed in face of any future technological advances, given the current state of of the art. Furthermore, the security of the messages is also guaranteed even if the secret encryption/decryption key is revealed in the future, The scheme is based on the bounded storage model and provides information-theoretic security in this model. The bounded storage model postulates an adversary who is computationally unbounded, and is only bounded in the amount of storage (not computation space) available to store the output of his computation. The bound on the storage can be arbitrarily large (e.g., 100 Tbytes), as long as it is fixed. Given this storage bound, our protocols guarantee that even a computationally all powerful adversary gains no information about a message (except with a probability that is exponentially small in the security parameter k). The bound on storage space need only hold at the time of the message transmission. Thereafter, no additional storage space or, computational power can help the adversary in deciphering the message. We present two protocols. The first protocol, which elaborates on the autoregressive (AR) protocol of Aumann and Rabin (see Advances in Cryptology-Crypto '99, p. 65-79, 1999), employs a short secret key whose size is independent of the length of the message, but uses many public random bits. The second protocol uses an optimal number of public random bits, but employs a longer secret key. Our proof of security utilizes a novel linear algebraic technique.

IEEE Transactions on Information TheoryJun 1, 2002139 citations

Quantum key distribution protocols using entangled state

Jian Wang, Quan Zhang, Chaojing Tang

We present three quantum key distribution protocols using entangled state. The first protocol is based on the idea of qubit transmission in blocks. Although it needs quantum memory, its theoretic efficiency approximates to 100%. The second protocol does not need quantum memory and its efficiency for qubits can achieve 100%. The third protocol is a controlled quantum key distribution protocol which can be applied to a special cryptographic scenario

arXiv:quant-ph/0510208International Conference on Computational Intelligence and Security (CIS)Nov 1, 20068 citations

Strongly Secure Authenticated Key Exchange in the Standard Model

Zheng Yang

Nowadays many crucial network applications rely on the existence of a confidential channel established by authenticated key exchange (AKE) protocols over public networks.With the rapid development of cyber technology, novel attacks to cryptosystem emerge in an endless stream.This has also led to the development of AKE solutions to provide increasingly stronger security guarantees.In this thesis we focus on provision of practical constructions for AKE protocols which are provably secure in a strong sense without resorting to random oracles.We first we present three new efficient compilers to generically turn passively secure key exchange protocols (KE) into authenticated key exchange protocols (AKE) where security also holds in the presence of active adversaries.Our compilers are not only a useful tool for the design of new AKE systems with many additional security properties in a modular and less error-prone fashion, but they also help to relax the assumptions on existing, practical key exchange mechanisms which are not known to be provably secure AKE protocols.Security of our compilers is shown in a strong modified CK model where the adversary is allowed to reveal either long-term secret key or state information of the protocol participants.On the second, we study the open problem on constructing eCK secure two party AKE protocol without random oracles and NAXOS trick.A generic construction satisfying those requirements is given based on well-known cryptographic primitives following the guideline of efficiency.Then a concrete protocol is proposed which is the first eCK secure protocol in the standard model under both standard assumptions and post-specified peer setting (i.e.without knowing any cryptographic information about its communication peer).Both proposed schemes can be more efficiently implemented with secure device than previous works which are eCK secure in the standard model, where the secure device might be normally used to store the long-term private key and to implement codes of protocol which need to be resilience of state leakage.Finally, we generalize our one-round two party AKE construction to group case that yields an efficient tripartite AKE protocol based on bilinear maps and a candidate group AKE protocol (with more than three members) based on multilinear maps.Up to now they are the first solutions which can be proved secure in the g-eCK model without random oracles.Meanwhile we make first step to show how to simplify the security proof for one-round group AKE under g-eCK model.i

Jan 1, 20130 citations

Secure key distribution by swapping quantum entanglement

Daegene Song

We report two key distribution schemes achieved by swapping quantum entanglement. Using two Bell states, two bits of secret key can be shared between two distant parties that play symmetric and equal roles. We also address eavesdropping attacks against the schemes.

arXiv:quant-ph/0305168Physical Review AMar 5, 200457 citations