Journal of Computer Science

Carving Secret Messages out of Public Information

Naya Nagy, Marius Nagy, Selim G. Akl

Published Jan 1, 2015• 6 citations

Abstract

This study shows that secret information can be shared or passed from a sender to a receiver even if not encoded in a secret message. In the protocol designed in this study, no parts of the original secret information ever travel via communication channels between the source and the destination, no encoding/decoding key is ever used. The two communicating partners, Alice and Bob, are endowed with coherent qubits that can be read and set and keep their quantum values over time. Additionally, there exists a central authority that is capable of identifying Alice and Bob to share with each half of entangled qubit pairs. The central authority also performs entanglement swapping. Our protocol relies on the assumption that public information can be protected, an assumption present in all cryptographic protocols. Also any classical communication channel need not be authenticated. As each piece of secret information has a distinct public encoding, the protocol is equivalent to a one-time pad protocol.

DOI: 10.3844/jcssp.2015.64.70

Related papers

Communicating Secret Information without Secret Messages in Wireless Sensor Networks

Naya Nagy, Marius Nagy, Selim G. Akl

The problem of security in a sensor network has been researched mainly with methods derived from classical cryptography. With the advance of quantum computation and quantum cryptography, the problem of securing a sensor network with quantum means is immediate. The present paper adapts an existing quantum security protocol [1] to sensor networks. The contribution of the protocol is that it shares a secret message between two nodes of the sensor network, without showing in the environment any information about the content of the message. The information visible to other nodes and to the environment refers to array indices and to the reading strategy, but not to the values read. As each piece of secret information has a distinct public encoding, the protocol is equivalent to a one-time pad protocol. To exploit quantum properties, sensor nodes are endowed with coherent qubits, that can be read and set within the node. Additionally, there exists a central authority that manages the identity of the nodes and can perform quantum entanglement swapping.

Oct 1, 20150 citations

A probabilistic quantum key transfer protocol

Abhishek Parakh

ABSTRACT We propose a protocol to transfer a one‐time pad (in a probabilistic manner) from Alice to Bob, over a public channel. The proposed protocol is unique because Bob merely acts as a receiver of the pad (secret key); that is, Bob does not need to send any message back to Alice unless he detects eavesdropping. Such a secure transfer of one‐time pad, over public channel, is not possible in classical cryptography, and in quantum cryptography, all previous protocols require Bob to send almost as many messages back to Alice as she does to Bob to establish a key. Copyright © 2013 John Wiley & Sons, Ltd.

Security and Communication NetworksMar 13, 201317 citations

Quantum cryptography

Jonathan A. Jones, Dieter Jaksch

Cryptographic protocols can be classified by the type of security against eavesdropping which they provide. There exist mathematically secure schemes whose security relies on mathematical proofs (like the Vernam cipher discussed below) or conjectures (like public key RSA encryption) about the complexity of deciphering the message without possessing the correct key. The majority of current secure public Internet connections rely on such schemes. Alternatively, a cryptographic setup may provide a physically secure method for communicating. In these setups the security is provided by the physical laws governing the communication protocol. Here we first discuss a provably secure classical communication protocol and then quantum methods for distributing the necessary keys. The BB84 protocol relies on the impossibility of perfectly distinguishing non-orthogonal quantum states from one copy of the quantum system. The scheme was invented in 1984 and is the first of its kind. In contrast, the Ekert91 protocol makes use of Bell correlations between entangled pairs of photons. These correlations are destroyed when Eve attempts to make a measurement on one of the particles but also when imperfections, such as decoherence processes, affect the scheme. As long as no such “elements of reality” are introduced, and Bell correlations violating local realism can be generated by Alice and Bob, no eavesdropper can be present. One-time pads and the Vernam cipher The Vernam cipher is a cryptographic protocol which allows the encryption and decryption protocol to be publicly known. The security of the protocol relies entirely on the key which is private and not publicly known. Alice and Bob share identical n -bit secret key strings (one-time pad).

Cambridge University Press eBooksJul 19, 20120 citations

Quantum secure direct communication by Einstein-Podolsky-Rosen pairs and entanglement swapping

Ting Gao, Fengli Yan, Zhi‐Xi Wang

We present a quantum secure direct communication scheme achieved by swapping quantum entanglement. In this scheme a set of ordered Einstein-Podolsky-Rosen (EPR) pairs is used as a quantum information channel for sending secret messages directly. After insuring the safety of the quantum channel, the sender Alice encodes the secret messages directly by applying a series local operations on her particles sequence according to their stipulation. Using three EPR pairs, three bits of secret classical information can be faithfully transmitted from Alice to remote Bob without revealing any information to a potential eavesdropper. By both Alice and Bob's GHZ state measurement results, Bob is able to read out the encoded secret messages directly. The protocol is completely secure if perfect quantum channel is used, because there is not a transmission of the qubits carrying the secret message between Alice and Bob in the public channel.

arXiv:quant-ph/0406083Jun 13, 200427 citations

A scheme for quantum communication using EPR pairs and local measurement

Fengli Yan, Ting Gao

We present a scheme for quantum communication, where a set of EPR pairs, initially shared by the sender Alice and the receiver Bob, functions as a quantum channel. After insuring the safety of the quantum channel, Alice applies local measurement on her particles of the EPR pairs and informs Bob the encoding classical information publicly. According to Alice's classical information and his measurement outcomes on the EPR pairs Bob can infer the secret messages directly. In this scheme, to transmit one bit secret message, the sender Alice only needs to send one bit classical information to the receiver Bob. We also show that this scheme is completely secure if perfect quantum channel is used.

arXiv:quant-ph/0501055Jan 12, 20050 citations

Quantum secure direct communication by EPR pairs and entanglement swapping

Ting Gao, Fei Yan, Z. X. Wang

We present a quantum secure direct communication scheme achieved by swapping quantum entanglement. In this scheme a set of ordered Einstein-Podolsky-Rosen (EPR) pairs is used as a quantum information channel for sending secret messages directly. After insuring the safety of the quantum channel, the sender Alice encodes the secret messages directly by applying a series local operations on her particle sequences according to their stipulation. Using three EPR pairs, three bits of secret classical information can be faithfully transmitted from Alice to remote Bob without revealing any information to a potential eavesdropper. By both Alice and Bob's GHZ state measurement results, Bob is able to read out the encoded secret messages directly. The protocol is completely secure if perfect quantum channel is used, because there is not a transmission of the qubits carrying the secret message between Alice and Bob in the public channel.

Il Nuovo Cimento BMar 1, 200434 citations