arXiv:1212.3017 · International Journal of Modern Physics Conference Series

The double-padlock problem: Is secure classical information transmission possible without key exchange?

James M. Chappell, Lachlan J. Gunn, Derek Abbott

Published Jan 1, 2014• 1 citation

Abstract

The idealized Kish-Sethuraman (KS) cipher is theoretically known to offer perfect security through a classical information channel. However, realization of the protocol is hitherto an open problem, as the required mathematical operators have not been identified in the previous literature. A mechanical analogy of this protocol can be seen as sending a message in a box using two padlocks; one locked by the Sender and the other locked by the Receiver, so that theoretically the message remains secure at all times. We seek a mathematical representation of this process, considering that it would be very unusual if there was a physical process with no mathematical description. We select Clifford's geometric algebra for this task as it is a natural formalism to handle rotations in spaces of various dimension. The significance of finding a mathematical description that describes the protocol, is that it is a possible step toward a physical realization having benefits in increased security with reduced complexity.

DOI: 10.1142/s201019451460355x

Related papers

Non Breakable Data Encryption With Classical Information?

László B. Kish

With the Kish‐Sethuraman (KS) cipher an attempt was made, by using special operators and communication, to reach absolutely secure classical communication. First the message is bounced back with additional encryption by the Receiver and then the original encryption is removed and the message is resent by the Sender. The mechanical analogy of this operation is using two padlocks; one by the Sender and one by the Receiver. Klappenecker has pointed out that finding an efficient software realization of the operators is equivalent of proving the P ≠ NP problem. Various open problems are discussed.

AIP conference proceedingsJan 1, 20052 citations

An absolutely secure QKD scheme with no detection noise, entanglement and classical communication

János A. Bergou, László B. Kish

A new quantum communication scheme is introduced which is the quantum realization of the classical Kish-Sethuraman (KS) cipher. First the message is bounced back with additional encryption by the Receiver and the original encryption is removed and the message is resent by the Sender. The mechanical analogy of this operation is using two padlocks; one by the Sender and one by the Receiver. We show that the rotation of the polarization is an operator which satisfies the conditions required for the KS encryption operators provided single photons are communicated. The new method is not only simple but has several advantages. The Evasdropper extracts zero information even if she executes a quantum measurement on the state. The communication can be done by two publicly agreed orthogonal states. Therefore, there is no inherent detection noise. No classical channel and no entangled states are required for the communication.

arXiv:quant-ph/0509097Sep 14, 20051 citation

Physical-layer encryption on the public internet: A stochastic approach to the Kish-Sethuraman cipher

Lachlan J. Gunn, James M. Chappell, Andrew Allison +1 more

While information-theoretic security is often associated with the one-time pad and quantum key distribution, noisy transport media leave room for classical techniques and even covert operation. Transit times across the public internet exhibit a degree of randomness, and cannot be determined noiselessly by an eavesdropper. We demonstrate the use of these measurements for information-theoretically secure communication over the public internet.

arXiv:1306.4174International Journal of Modern Physics Conference SeriesJan 1, 20142 citations

Protocol and applications for sharing quantum private keys

Hanwei Wang, Tien-Sheng Lin, I-Ming Tsai +1 more

Transmitting message in secret is getting more and more important nowadays. In the classical world, the message we sent run the risk of being intercepted by an attacker. As a result, we have to encrypt the message, or send it using a private channel. However, if we transmit messages via such methods, there are still some ways to decipher the information. For example, a powerful computer can be used to decrypt the message or try to steal the message from the private channel. In quantum cryptography, entanglement can be used as a secure channel to transmit information with absolute secrecy. From this perspective, quantum entanglement pairs are equivalent to a quantum private key. However, like the classical key distribution problem, the entanglement has to be shared before it can be used. In this paper, we propose a protocol that can be used to distribute such entanglement pairs securely, so they can be subsequently used to transmit messages with perfect security. The security of this protocol is based on the laws of nature, instead of unproven mathematical hard problems.

IEEE International Carnahan Conference on Security Technology (ICCST)Jan 1, 20057 citations

Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme.

Kaoru Kurosawa, Kazuhiro Suzuki

Abstract. In the model of perfectly secure message transmission schemes (PSMTs), there are n channels between a sender and a receiver. An infinitely powerful adversary A may corrupt (observe and forge) the messages sent through t out of n channels. The sender wishes to send a secret s to the receiver perfectly privately and perfectly reliably without sharing any key with the receiver. In this paper, we show the first 2-round PSMT for n = 2t + 1 such that not only the transmission rate is O(n) but also the computational costs of the sender and the receiver are both polynomial in n. This means that we solve the open problem raised by Agarwal, Cramer and de Haan at CRYPTO 2006. The main novelty of our approach is to introduce a notion of pseudobasis to the coding theory. It will be an independent interest for coding theory, too.

Jan 1, 20080 citations

Security of Quantum Key Distribution Protocols

Rotem Liss

The counter-intuitive features of quantum mechanics make it possible to solve problems and perform tasks that are beyond the abilities of non-quantum (classical) computers and communication devices. The field of quantum information processing studies how we can achieve such improvements by representing information as quantum states.One of the early achievements of quantum information processing is the development of quantum key distribution (QKD). QKD protocols allow two participants (Alice and Bob) to achieve the classically-impossible task of generating a secret shared key even if their adversary is computationally unlimited.Unfortunately, the security promises of QKD are true only in theory; practical implementations of QKD deviate from the theoretical protocols, and many of these deviations give rise to practical attacks. In this research thesis, we study the security properties of various QKD protocols in many practical settings:First, we study practical security of semiquantum key distribution (SQKD) protocols, where either Alice or Bob is non-quantum (classical). Following practical security problems in previous SQKD protocols, we suggest a new SQKD protocol (the "Mirror protocol") which can be securely implemented, and we prove it robust and secure against a wide range of attacks (the "uniform collective attacks").Then, we study "composable security" of the first QKD protocol created by Bennett and Brassard (BB84). BB84 has its unconditional security proved against adversaries performing the most general attacks in a theoretical (idealized) setting; however, some security approaches do not prove "composable security", which requires the secret key to remain secret even when Alice and Bob actually use it for cryptographic purposes. We generalize an algebraic security approach for BB84, making it prove composable security of BB84 (and many variants of BB84) against the most general attacks.Finally, we analyze an important practical attack (named "Bright Illumination"), showing how it can be modeled as a theoretical "Reversed-Space" attack.Overall, all results aim to enhance our understanding on how to bridge the gap between theory and practice in various sub-fields of QKD, and they may help solve a major open problem in the field of QKD: constructing a realistic QKD implementation that can be proved truly and unconditionally secure against any possible attack.

Aug 31, 20220 citations