English
Related papers

Related papers: Information Theoretically Secure Encryption Key Ge…

200 papers

Key agreement is a fundamental cryptographic primitive. It has been proved that key agreement protocols with security against computationally unbounded adversaries cannot exist in a setting where Alice and Bob do not have dependent…

Cryptography and Security · Computer Science 2016-04-14 Reihaneh Safavi-Naini , Pengwei Wang

Secret key generation at the physical layer is expected to be a fundamental enabler for next-generation networks. We consider a network where the user equipment is a drone and propose a novel secret key generation solution when the…

Signal Processing · Electrical Eng. & Systems 2025-12-05 Mattia Piana , Stefano Tomasin

Covert communication can prevent an adversary from knowing that a wireless transmission has occurred. In additive white Gaussian noise (AWGN) channels, a square root law is found that Alice can reliably and covertly transmit…

Cryptography and Security · Computer Science 2019-09-30 Zhihong Liu , Jiajia Liu , Yong Zeng , Jianfeng Ma

This paper addresses the establishment of secure communication links between smart-meters (Alice) and an aggregator (Bob) in the presence of an eavesdropper (Eve). The proposed scenario assumes: (i) MIMOME wiretap channel; (ii) transmit…

Information Theory · Computer Science 2015-11-23 Hirley Alves , Mauricio Tomé , Pedro H. J. Nardelli , Carlos H. M. de Lima , Matti Latva-aho

This paper develops a novel framework for sharing secret keys using the Automatic Repeat reQuest (ARQ) protocol. We first characterize the underlying information theoretic limits, under different assumptions on the channel spatial and…

Information Theory · Computer Science 2013-04-09 Yara Abdallah , Mohamed Abdel Latif , Moustafa Youssef , Ahmed Sultan , Hesham El Gamal

Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to…

Information Theory · Computer Science 2015-03-13 Hessam Mahdavifar , Alexander Vardy

We consider problems of two-user secret key generation through an intermediate relay. Each user observes correlated source sequences and communicates to the relay over rate-limited noiseless links. The relay processes and broadcasts…

Information Theory · Computer Science 2016-07-27 Kittipong Kittichokechai , Rafael F. Schaefer , Giuseppe Caire

Prepare and measure quantum key distribution protocols can be decomposed into two basic steps: delivery of the signals over a quantum channel and distillation of a secret key from the signal and measurement records by classical processing…

Quantum Physics · Physics 2007-05-23 Joseph M. Renes , Markus Grassl

Entanglement swapping between Einstein-Podolsky-Rosen (EPR) pairs can be used to generate the same sequence of random bits in two remote places. A quantum key distribution protocol based on this idea is described. The scheme exhibits the…

Quantum Physics · Physics 2009-10-31 Adan Cabello

This work shows how a secure Internet for users A and B can be implemented through a fast key distribution system that uses physical noise to encrypt information transmitted in deterministic form. Starting from a shared secret random…

Quantum Physics · Physics 2007-05-23 Geraldo A. Barbosa

We presen a secure direct communication protocol by using step-split Einstein-Podolsky-Rosen (EPR) pair. In this communication protocol, Alice first sends one qubit of an EPR pair to Bob. Bob sends a receipt signal to Alice through public…

Quantum Physics · Physics 2016-09-08 Qing-yu Cai

Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channels to strengthen the security of communications systems.…

Networking and Internet Architecture · Computer Science 2016-11-18 Pedro C. Pinto , Joao Barros , Moe Z. Win

In this paper, we investigate joint information theoretic secrecy and covert communication in a single-input multi-output (SIMO) system where a transmitter (Alice) is communicating with two legitimate users (Bob and Carol). We consider that…

Signal Processing · Electrical Eng. & Systems 2020-07-13 Moslem Forouzesh , Paeiz Azmi , Ali Kuhestani , Phee Lep Yeoh

We analyzed the security of the secure direct communication protocol based on secret transmitting order of particles recently proposed by Zhu, Xia, Fan, and Zhang [Phys. Rev. A 73, 022338 (2006)], and found that this scheme is insecure if…

Quantum Physics · Physics 2007-05-23 Xi-Han Li , Fu-Guo Deng , Hong-Yu Zhou

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…

Cryptography and Security · Computer Science 2025-07-21 Yingbo Hua

Key distribution and renewing in wireless local area networks is a crucial issue to guarantee that unauthorized users are prevented from accessing the network. In this paper, we propose a technique for allowing an automatic bootstrap and…

Information Theory · Computer Science 2016-11-17 Marco Baldi , Marco Bianchi , Nicola Maturo , Franco Chiaraluce

Key establishment in sensor networks becomes a challenging problem because of the resource limitations of the sensors and also due to vulnerability to physical capture of the sensor nodes. In this paper, we propose an unconditionally secure…

Cryptography and Security · Computer Science 2011-03-25 Ashok Kumar Das

A Wireless Sensor Network (WSN) is emerging field in Information and communication technology. In WSN data transmission and data collection are unsecure because of sensor node Incompatibility. So providing security to Sensor network is very…

Networking and Internet Architecture · Computer Science 2012-07-25 V. Jayaraj , M. Indhumathi

We consider the secure communication problem for broadcasting of two encrypted sources. The sender wishes to broadcast two secret messages via two common key cryptosystems. We assume that the adversary can use the side-channel, where the…

Information Theory · Computer Science 2019-06-26 Bagus Santoso , Yasutada Oohama

In the model that has become known as "Perfectly Secure Message Transmission"(PSMT), a sender Alice is connected to a receiver Bob through n parallel two-way channels. A computationally unbounded adversary Eve controls t of these channels,…

Cryptography and Security · Computer Science 2016-08-08 Gabriele Spini , Gilles Zémor