English
Related papers

Related papers: Stealthy Secret Key Generation

200 papers

The problem of simultaneously generating a secret key (SK) and private key (PK) pair among three terminals via public discussion is investigated, in which each terminal observes a component of correlated sources. All three terminals are…

Information Theory · Computer Science 2014-04-28 Huishuai Zhang , Lifeng Lai , Yingbin Liang , Hua Wang

With the emergence of 5G low latency applications, such as haptics and V2X, low complexity and low latency security mechanisms are sought. Promising lightweight mechanisms include physical unclonable functions (PUF) and secret key…

Cryptography and Security · Computer Science 2020-03-27 Miroslav Mitev , Arsenia Chorti , Martin Reed , Leila Musavian

For a discrete or a continuous source model, we study the problem of secret-key generation with one round of rate-limited public communication between two legitimate users. Although we do not provide new bounds on the wiretap secret-key…

Information Theory · Computer Science 2014-05-19 Remi A. Chou , Matthieu R. Bloch

In the classical Secret-Key generation model, Common Randomness is generated by two terminals based on the observation of correlated components of a common source, while keeping it secret from a non-legitimate observer. It is assumed that…

Information Theory · Computer Science 2016-01-28 Nima Tavangaran , Holger Boche , Rafael F. Schaefer

We study covert communication and covert secret key generation with positive rates over quantum state-dependent channels. Specifically, we consider fully quantum state-dependent channels when the transmitter shares an entangled state with…

Information Theory · Computer Science 2025-12-01 Hassan ZivariFard , Rémi A. Chou , Xiaodong Wang

Physical layer secret key generation exploits the reciprocal channel randomness for key generation and has proven to be an effective addition security layer in wireless communications. However, static or scarcely random channels require…

Information Theory · Computer Science 2021-10-26 Zhuangkun Wei , Weisi Guo

We study the problem of generating a shared secret key between two terminals in a joint source-channel setup -- the sender communicates to the receiver over a discrete memoryless wiretap channel and additionally the terminals have access to…

Information Theory · Computer Science 2016-11-18 Ashish Khisti , Suhas Diggavi , Gregory Wornell

Information theoretic secret key agreement is impossible without making initial assumptions. One type of initial assumption is correlated random variables that are generated by using a noisy channel that connects the terminals. Terminals…

Information Theory · Computer Science 2020-08-10 Alireza Poostindouz , Reihaneh Safavi-Naini

We consider secret key generation for a "pairwise independent network" model in which every pair of terminals observes correlated sources that are independent of sources observed by all other pairs of terminals. The terminals are then…

Information Theory · Computer Science 2010-08-09 Sirin Nitinawarat , Chunxuan Ye , Alexander Barg , Prakash Narayan , Alex Reznik

We consider the secret key generation problem when sources are randomly excited by the sender and there is a noiseless public discussion channel. Our setting is thus similar to recent works on channels with action-dependent states where the…

Information Theory · Computer Science 2016-11-15 Tzu-Han Chou , Vincent Y. F. Tan , Stark C. Draper

Fundamental limits of secret-key agreement over reciprocal wireless channels are investigated. We consider a two-way block-fading channel where the channel gains in the forward and reverse links between the legitimate terminals are…

Information Theory · Computer Science 2012-11-08 Ashish Khisti

We consider a model for secrecy generation, with three terminals, by means of public interterminal communication, and examine the problem of characterizing all the rates at which all three terminals can generate a ``secret key,'' and --…

Information Theory · Computer Science 2007-07-13 Chunxuan Ye , Prakash Narayan

We study the fundamental limits to secret key generation from an excited distributed source (EDS). In an EDS a pair of terminals observe dependent sources of randomness excited by a pre-arranged signal. We first determine the secret key…

Information Theory · Computer Science 2016-11-17 Tzu-Han Chou , Stark C. Draper , Akbar M. Sayeed

We consider the generation of a secret key (SK) by the inputs and the output of a secure multipleaccess channel (MAC) that additionally have access to a noiseless public communication channel. Under specific restrictions on the protocols,…

Information Theory · Computer Science 2019-02-26 Himanshu Tyagi , Shun Watanabe

In this paper, we consider the problem of secret key generation with one-way communication through both a rate-limited public channel and a rate-limited secure channels where the public channel is from Alice to Bob and Eve and the secure…

Information Theory · Computer Science 2020-04-13 Yinfei Xu , Daming Cao

A source model for secret key generation between terminals is considered. Two users, namely users 1 and 2, at one side communicate with another user, namely user 3, at the other side via a public channel where three users can observe i.i.d.…

Information Theory · Computer Science 2010-04-07 Somayeh Salimi , Mahmoud Salmasizadeh , Mohammad Reza Aref

A new model of multi-party secret key agreement is proposed, in which one terminal called the communicator can transmit public messages to other terminals before all terminals agree on a secret key. A single-letter characterization of the…

Information Theory · Computer Science 2015-12-01 Jingbo Liu , Paul Cuff , Sergio Verdu

Joint communication and sensing is expected to be one of the features introduced by the sixth-generation (6G) wireless systems. This will enable a huge variety of new applications, hence, it is important to find suitable approaches to…

Cryptography and Security · Computer Science 2023-10-24 Miroslav Mitev , Amitha Mayya , Arsenia Chorti

We consider a 1-to-$K$ communication scenario, where a source transmits private messages to $K$ receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each…

Information Theory · Computer Science 2014-08-11 László Czap , Vinod M. Prabhakaran , Christina Fragouli , Suhas Diggavi

We determine the covert capacity for entanglement generation over a noisy quantum channel. While secrecy guarantees that the transmitted information remains inaccessible to an adversary, covert communication ensures that the transmission…

Quantum Physics · Physics 2026-05-27 Ohad Kimelfeld , Boulat A. Bash , Uzi Pereg
‹ Prev 1 2 3 10 Next ›