Related papers: Exchanging Secrets without Using Cryptography

Secure communication over a memoryless wiretap channel in the presence of a passive eavesdropper is considered. Traditional information-theoretic security methods require an advantage for the main channel over the eavesdropper channel to…

This study examines the use of nonsystematic channel codes to obtain secure transmissions over the additive white Gaussian noise (AWGN) wire-tap channel. Unlike the previous approaches, we propose to implement nonsystematic coded…

Two or more mobiles users can continuously superimpose sequences of bits chosen from different packets or files already exchanged and authenticated between themselves to continuously renew a secret key for continuous strengthening of their…

We study common randomness where two parties have access to i.i.d. samples from a known random source, and wish to generate a shared random key using limited (or no) communication with the largest possible probability of agreement. This…

We consider a pair-wise independent network where every pair of terminals in the network observes a common pair-wise source that is independent of all the sources accessible to the other pairs. We propose a method for secret key agreement…

In the information exchange problem, k packets that are initially maintained by k nodes need to be disseminated to the whole network as quickly as possible. We consider this problem in single-hop multi- channel networks of n nodes, and…

This paper contributes to the challenging field of security for wireless sensor networks by introducing a key agreement scheme in which sensor nodes create secure radio connections with their neighbours depending on the aid of third…

In this paper, the compression of an independent and identically distributed Gaussian source sequence is studied in an unsecure network. Within a game theoretic setting for a three-party noiseless communication network (sender Alice,…

We consider an edge computing scenario where users want to perform a linear computation on local, private data and a network-wide, public matrix. Users offload computations to edge servers located at the edge of the network, but do not want…

We examine security of a protocol on cryptographic key distribution via classical noise proposed by Yuen and Kim (Phys. Lett. A 241 135 (1998)). Theoretical and experimental analysis in terms of the secure key distribution rate shows that…

We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals…

The goal of any cryptographic system is the exchange of information among the intended users without any leakage of information to others who may have unauthorized access to it. A common secret key could be created over a public channel…

A scheme for secure communications, called ``Secret-message Transmission by Echoing Encrypted Probes (STEEP)'', is revisited. STEEP is a round-trip scheme with a probing phase from one user to another and an echoing phase in the reverse…

Non-interactive key exchange (NIKE) enables two or multiple parties (just knowing the public system parameters and each other's public key) to derive a (group) session key without the need for interaction. Recently, NIKE in multi-party…

This work considers the secure and reliable information transmission in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While the previous work on this problem mainly studied infinite…

This paper investigates the secrecy capacity region of multiple access wiretap (MAC-WT) channels where, besides confidential messages, the users have also open messages to transmit. All these messages are intended for the legitimate…

A fundamental question that has been studied in cryptography and in information theory is whether two parties can communicate confidentially using exclusively an open channel. We consider the model in which the two parties hold inputs that…

A wireless communication network is considered, consisting of a source (Alice), a destination (Bob) and an eavesdropper (Eve), each equipped with a single antenna. The communication is assisted by multiple helpers, each equipped with two…

In this paper we construct a deterministic polynomial time algorithm for the problem where a set of users is interested in gaining access to a common file, but where each has only partial knowledge of the file. We further assume the…

Consider a single-hop, multi-channel, synchronous radio network in which a source node needs to disseminate a message to all other $n-1$ nodes. An adversary called Eve, which captures environmental noise and potentially malicious…