English
Related papers

Related papers: Perfect Omniscience, Perfect Secrecy and Steiner T…

200 papers

We consider a model with three terminals and examine the problem of characterizing the largest rates at which two pairs of terminals can simultaneously generate private keys, each of which is effectively concealed from the remaining…

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

The multiterminal secret key agreement problem by public discussion is formulated with an additional source compression step where, prior to the public discussion phase, users independently compress their private sources to filter out…

Information Theory · Computer Science 2017-11-22 Chung Chan

Conventionally, secrecy is achieved using cryptographic techniques beyond the physical layer. Recent studies raise the interest of performing encryption within the physical layer by exploiting some unique features of the physical wireless…

Cryptography and Security · Computer Science 2018-08-19 Suzhi Bi , Xiaojun Yuan , Ying Jun Zhang

Physical-layer key generation (PKG) based on channel reciprocity has recently emerged as a new technique to establish secret keys between devices. Most works focus on pairwise communication scenarios with single or small-scale antennas.…

Information Theory · Computer Science 2020-09-23 Guyue Li , Chen Sun , Eduard Jorswieck , Junqing Zhang , Aiqun Hu , You Chen

In this paper, we explore the connection between secret key agreement and secure omniscience within the setting of the multiterminal source model with a wiretapper who has side information. While the secret key agreement problem considers…

Information Theory · Computer Science 2023-07-28 Praneeth Kumar Vippathalla , Chung Chan , Navin Kashyap , Qiaoqiao Zhou

Cryptographic protocols are often based on the two main resources: private randomness and private key. In this paper, we develop a relationship between these two resources. First, we show that any state containing perfect, directly…

Quantum Physics · Physics 2020-07-21 Karol Horodecki , Ryszard P. Kostecki , Roberto Salazar , Michał Studziński

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 novel framework for sharing common randomness and generating secret keys in wireless networks is considered. In particular, a network of users equipped with pulse oscillators (POs) and coupling mechanisms in between is considered. Such…

Information Theory · Computer Science 2019-10-29 Hessam Mahdavifar , Najme Ebrahimi

We consider secret key generation from relative localization information of a pair of nodes in a mobile wireless network in the presence of a mobile eavesdropper. Our problem can be categorized under the source models of information…

Information Theory · Computer Science 2015-03-19 Onur Gungor , Fangzhou Chen , C. Emre Koksal

We consider the secret key agreement problem under the multiterminal source model proposed by Csisz\'ar and Narayan. A single-letter characterization of the secrecy capacity is desired but remains unknown except in the extreme case with…

Information Theory · Computer Science 2019-04-26 Chung Chan , Manuj Mukherjee , Praneeth Kumar Vippathalla , Qiaoqiao Zhou

Hypergraphical sources are a natural class of sources for secret key generation, within which different subsets of terminals sharing secrets are allowed to discuss publicly in order to agree upon a global secret key. While their secrecy…

Information Theory · Computer Science 2018-05-04 Chung Chan , Manuj Mukherjee , Navin Kashyap , Qiaoqiao Zhou

Exchange of secret keys over public channels based on neural synchronization using a variety of learning rules offer an appealing alternative to number theory based cryptography algorithms. Though several forms of attacks are possible on…

Cryptography and Security · Computer Science 2015-02-19 Sandip Chakraborty , Jiban Dalal , Bikramjit Sarkar , Debaprasad Mukherjee

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

The dynamic establishment of shared information (e.g. secret key) between two entities is particularly important in networks with no pre-determined structure such as wireless sensor networks (and in general wireless mobile ad-hoc networks).…

Cryptography and Security · Computer Science 2008-12-18 V. Liagkou , E. Makri , P. Spirakis , Y. C. Stamatiou

This paper investigates generation of a secret key from a reciprocal wireless channel. In particular we consider wireless channels that exhibit sparse structure in the wideband regime and the impact of the sparsity on the secret key…

Cryptography and Security · Computer Science 2012-08-21 Tzu-Han Chou , Stark C. Draper , Akbar M. Sayeed

We show that for a legitimate communication under multipath quasi-static fading with a reduced number of scatterers, it is possible to achieve perfect secrecy even in the presence of a passive eavesdropper for which no channel state…

Information Theory · Computer Science 2019-10-23 Pablo Ramírez-Espinosa , R. José Sánchez-Alarcón , F. Javier López-Martínez

The random-energy model (REM), a solvable spin-glass model, has impacted an incredibly diverse set of problems, from protein folding to combinatorial optimization to many-body localization. Here, we explore a new connection to secret…

Disordered Systems and Neural Networks · Physics 2025-02-13 Vudtiwat Ngampruetikorn , David J. Schwab

Efficiently distributing secret keys over long distances remains a critical challenge in the development of quantum networks. "First-generation" quantum repeater chains distribute entanglement by executing protocols composed of…

In this paper, we propose a transmission scheme that achieves information theoretic security, without making assumptions on the eavesdropper's channel. This is achieved by a transmitter that deliberately introduces synchronization errors…

Information Theory · Computer Science 2015-01-27 Jason Castiglione , Aleksandar Kavcic

This article presents a novel method for establishing an information theoretically secure encryption key over wireless channels. It exploits the fact that data transmission over wireless links is accompanied by packet error, while noise…

Information Theory · Computer Science 2024-02-08 Amir K. Khandani