English
Related papers

Related papers: Key Agreement over an Interference Channel with No…

200 papers

This paper considers the problem of pairwise key agreement without public communication between three users connected through a generalized multiple access channel (MAC). While two users control the channel inputs, all three users observe…

Information Theory · Computer Science 2016-03-18 Somayeh Salimi , Matthieu Bloch , Frederic Gabry , Mikael Skoglund , Panos Papadimitratos

A source model of key sharing between three users is considered in which each pair of them wishes to agree on a secret key hidden from the remaining user. There are rate-limited public channels for communications between the users. We give…

Information Theory · Computer Science 2015-12-31 Somayeh Salimi , Panos Papadimitratos

We consider a group of $m$ trusted and authenticated nodes that aim to create a shared secret key $K$ over a wireless channel in the presence of an eavesdropper Eve. We assume that there exists a state dependent wireless broadcast channel…

Cryptography and Security · Computer Science 2016-04-11 Mahdi Jafari Siavoshani , Shaunak Mishra , Christina Fragouli , Suhas N. Diggavi

Secret-sharing building blocks based on quantum broadcast communication are studied. The confidential capacity region of the pure-loss bosonic broadcast channel is determined, both with and without key assistance, and an achievable region…

Quantum Physics · Physics 2021-09-15 Uzi Pereg , Roberto Ferrara , Matthieu R. Bloch

In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…

Information Theory · Computer Science 2021-05-20 Somalatha U , Parthajit Mohapatra

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

In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eavesdropper and a transmitter where the channel state…

Cryptography and Security · Computer Science 2013-05-17 Mohsen Bahrami , Ali Bereyhi , Sadaf Salehkalaibar , Mohammad Reza Aref

In this paper, the problem of secret key agreement in state-dependent multiple access channels with an eavesdropper is studied. For this model, the channel state information is non-causally available at the transmitters; furthermore, a…

Cryptography and Security · Computer Science 2013-01-23 Mohsen Bahrami , Ali Bereyhi , Mahtab Mirmohseni , Mohammad Reza Aref

Secret-key agreement protocols over wiretap channels controlled by a state parameter are studied. The entire state sequence is known (non-causally) to the sender but not to the receiver and the eavesdropper. Upper and lower bounds on the…

Information Theory · Computer Science 2010-07-01 Ashish Khisti

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

A secret key agreement setup between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. The three users observe i.i.d.…

Information Theory · Computer Science 2012-04-16 Somayeh Salimi , Mikael Skoglund

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

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

A secret key agreement framework between three users is considered in which each of the users 1 and 2 intends to share a secret key with user 3 and users 1 and 2 are eavesdroppers with respect to each other. There is a generalized discrete…

Information Theory · Computer Science 2013-05-08 Somayeh Salimi , Mikael Skoglund , Mahmoud Salmasizadeh , Mohammad Reza Aref

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…

Cryptography and Security · Computer Science 2013-09-11 Saleh Almowuena

We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Ivana Maric , Predrag Spasojevic , Roy D. Yates

This paper considers secret-key generation between several agents and a base station that observe independent and identically distributed realizations of correlated random variables. Each agent wishes to generate the longest possible…

Information Theory · Computer Science 2019-04-25 Remi A. Chou , Aylin Yener

This paper considers the problem of secret-key agreement with public discussion subject to a peak power constraint $A$ on the channel input. The optimal input distribution is proved to be discrete with finite support. The result is obtained…

Information Theory · Computer Science 2018-05-09 Marwen Zorgui , Zouheir Rezki , Basel Alomair , Mohamed-Slim Alouini

This paper considers the problem of information-theoretic Secret Key Establishment (SKE) in the presence of a passive adversary, Eve, when Alice and Bob are connected by a pair of independent discrete memoryless broadcast channels in…

Information Theory · Computer Science 2010-04-23 Hadi Ahmadi , Reihaneh Safavi-Naini

This paper studies the frequency/time selective $K$-user Gaussian interference channel with secrecy constraints. Two distinct models, namely the interference channel with confidential messages and the one with an external eavesdropper, are…

Information Theory · Computer Science 2016-11-17 Onur Ozan Koyluoglu , Hesham El Gamal , Lifeng Lai , H. Vincent Poor
‹ Prev 1 2 3 10 Next ›