[Paper Review] Exchanging Secrets without Using Cryptography

Iris Safaka, Siavoshani, Mahdi J.+5 more|arXiv (Cornell University)|May 25, 2011

Chaos-based Image/Signal Encryption20 references15 citations

TL;DR

This paper proposes a computationally efficient, information-theoretically secure secret-agreement protocol for $ n $ nodes on a shared broadcast channel, using active interference to create controlled channel noise that limits eavesdropper Eve’s ability to reconstruct shared bits. In a 14 m² wireless testbed with 8 nodes and 6 interferers, the protocol achieved a secret-generation rate of 38 Kbps, marking the first experimental demonstration of kilobit-per-second information-theoretic key exchange without public-key cryptography.

ABSTRACT

We consider the problem where a group of n nodes, connected to the same broadcast channel (e.g., a wireless network), want to generate a common secret bitstream, in the presence of an adversary Eve, who tries to obtain information on the bitstream. We assume that the nodes initially share a (small) piece of information, but do not have access to any out-of-band channel. We ask the question: can this problem be solved without relying on Eve's computational limitations, i.e., without using any form of public-key cryptography? We propose a secret-agreement protocol, where the n nodes of the group keep exchanging bits until they have all agreed on a bit sequence that Eve cannot reconstruct with very high probability. In this task, the nodes are assisted by a small number of interferers, whose role is to create channel noise in a way that bounds the amount of information Eve can overhear. Our protocol has polynomial-time complexity and requires no changes to the physical or MAC layer of network devices. First, we formally show that, under standard theoretical assumptions, our protocol is information-theoretically secure, achieves optimal secret-generation rate for n = 2 nodes, and scales well to an arbitrary number of nodes. Second, we adapt our protocol to a small wireless 14-square-meter testbed; we experimentally show that, if Eve uses a standard wireless physical layer and is not too close to any of the nodes, 8 nodes can achieve a secret-generation rate of 38 Kbps. To the best of our knowledge, ours is the first experimental demonstration of information-theoretic secret exchange on a wireless network at a rate beyond a few tens of bits per second.

Motivation & Objective

• To design a scalable, polynomial-time secret-agreement protocol for $ n $ nodes on a shared broadcast channel without relying on computational assumptions.
• To achieve information-theoretic security by exploiting physical-layer noise and interference, rather than computational hardness.
• To demonstrate practical feasibility of high-rate secret key generation in real-world wireless environments.
• To enable secret key exchange in resource-constrained devices without modifying physical or MAC layer protocols.

Proposed method

• The protocol uses a group of $ n $ honest nodes and a small number of interferers to inject controlled noise into the wireless channel, creating erasure-like conditions.
• Each node exchanges bits over the broadcast channel, and through a series of rounds, they converge on a common secret bitstream using a distributed agreement mechanism.
• The interferers are strategically positioned to ensure that Eve cannot overhear the same bit sequences as any honest node, exploiting spatial diversity in signal reception.
• The protocol assumes independent erasure channels with known erasure probabilities and uses feedback to improve agreement reliability and security.
• It leverages the fact that even if Eve overhears parts of the transmissions, she cannot reconstruct the full secret due to differing reception patterns across nodes.
• The scheme is designed to be computationally efficient, with per-node operations in polynomial time, and compatible with standard wireless hardware.

Experimental results

Research questions

• RQ1 Can a group of $ n $ nodes establish a common secret bitstream without relying on public-key cryptography or computational assumptions?
• RQ2 Can information-theoretic security be achieved in a multi-node wireless setting where Eve has access to the same broadcast medium?
• RQ3 What is the maximum achievable secret-generation rate in such a setting, and how does it scale with the number of nodes?
• RQ4 Can such a protocol be practically implemented in a real-world wireless environment with moderate hardware constraints?

Key findings

• The proposed protocol achieves information-theoretic security by ensuring that Eve cannot reconstruct the common secret with high probability, even if she overhears all transmissions.
• For $ n = 2 $, the protocol achieves the optimal secret-generation rate under the assumed channel model.
• The protocol scales well to an arbitrary number of nodes, maintaining security and efficiency.
• In a real 14 m² wireless testbed with 8 nodes and 6 interferers, the protocol achieved a secret-generation rate of 38 Kbps.
• This is, to the best of the authors' knowledge, the first experimental demonstration of information-theoretic secret key exchange at kilobit-per-second rates in a wireless network.
• The protocol requires no changes to physical or MAC layer devices and operates with polynomial-time complexity, making it suitable for low-power, resource-constrained nodes.