English
Related papers

Related papers: Successive Secret Key Agreement over Generalized M…

200 papers

We study a multi-antenna broadcast channel with two legitimate receivers and an external eavesdropper. We assume that the channel matrix of the eavesdropper is unknown to the legitimate terminals but satisfies a maximum rank constraint. As…

Information Theory · Computer Science 2016-11-15 Xiang He , Ashish Khisti , Aylin Yener

In this work we give a $(n,n)$-threshold protocol for sequential secret sharing of quantum information for the first time. By sequential secret sharing we refer to a situation where the dealer is not having all the secrets at the same time,…

Quantum Physics · Physics 2016-08-11 Maharshi Ray , Sourav Chatterjee , Indranil Chakrabarty

This paper investigates the fundamental performance limits of the two-user interference channel in the presence of an external eavesdropper. In this setting, we construct an inner bound, to the secrecy capacity region, based on the idea of…

Information Theory · Computer Science 2015-03-13 O. Ozan Koyluoglu , Hesham El Gamal

Alice and Bob want to share a secret key and to communicate an independent message, both of which they desire to be kept secret from an eavesdropper Eve. We study this problem of secret communication and secret key generation when two…

Information Theory · Computer Science 2016-11-15 Vinod M. Prabhakaran , Krishnan Eswaran , Kannan Ramchandran

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

Information Theory · Computer Science 2020-01-14 Hao Xu , Giuseppe Caire , Cunhua Pan

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

This paper develops a novel framework for sharing secret keys using the well-known Automatic Repeat reQuest (ARQ) protocol. The proposed key sharing protocol does not assume any prior knowledge about the channel state information (CSI),…

Information Theory · Computer Science 2009-08-04 Mohamed Abdel Latif , Ahmed Sultan , Hesham El Gamal

We consider a secret-sharing model where a dealer distributes the shares of a secret among a set of participants with the constraint that only predetermined subsets of participants must be able to reconstruct the secret by pooling their…

Information Theory · Computer Science 2024-02-07 Remi A. Chou

We consider the problem of secure communications over the two-way wiretap channel under a strong secrecy criterion. We improve existing results by developing an achievable region based on strategies that exploit both the interference at the…

Information Theory · Computer Science 2015-03-17 Alexandre J. Pierrot , Matthieu R. Bloch

This paper studies the problem of secure communication over a K-transmitter multiple access channel in the presence of an external eavesdropper, subject to a joint secrecy constraint (i.e., information leakage rate from the collection of K…

Information Theory · Computer Science 2017-01-24 Yanling Chen , O. Ozan Koyluoglu , A. J. Han Vinck

This work investigates the secrecy capacity of the Wiretap Broadcast Channel (WBC) with an external eavesdropper where a source wishes to communicate two private messages over a Broadcast Channel (BC) while keeping them secret from the…

Information Theory · Computer Science 2015-08-21 Meryem Benammar , Pablo Piantanida

The broadcast channel (BC) with one common and two private messages with leakage constraints is studied, where leakage rate refers to the normalized mutual information between a message and a channel symbol string. Each private message is…

Information Theory · Computer Science 2017-05-30 Ziv Goldfeld , Gerhard Kramer , Haim H. Permuter

This paper investigates the secret key authentication capacity region. Specifically, the focus is on a model where a source must transmit information over an adversary controlled channel where the adversary, prior to the source's…

Information Theory · Computer Science 2020-01-07 Jake Perazzone , Eric Graves , Paul Yu , Rick Blum

Approximate capacity regions are established for a class of interfering multiple access channels consisting of two multiple-access channels (MACs), each with an arbitrary number of transmitters, with one transmitter in each MAC causing…

Information Theory · Computer Science 2018-09-05 Yimin Pang , Mahesh K. Varanasi

A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…

Information Theory · Computer Science 2016-11-18 O. Simeone , D. Gunduz , H. V. Poor , A. Goldsmith , S. Shamai

In this paper, we characterize the fundamental limits of a communication system with three users (i.e., three transmitters) and a single receiver where communication from two covert users must remain undetectable to an external warden. Our…

Information Theory · Computer Science 2024-04-23 Abdelaziz Bounhar , Mireille Sarkiss , Michèle Wigger

To accomplish secure group communication, it is essential to share a unique cryptographic key among group members. The underlying challenges to group key agreement are scalability, efficiency, and security. In a dynamic group environment,…

Cryptography and Security · Computer Science 2019-07-29 Muhammad Bilal , Shin-Gak Kang

We study the security of communication between a single transmitter and multiple receivers in a broadcast channel in the presence of an eavesdropper. We consider several special classes of channels. As the first model, we consider the…

Information Theory · Computer Science 2008-12-02 Ersen Ekrem , Sennur Ulukus

We study the multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter…

Information Theory · Computer Science 2011-06-22 Ersen Ekrem , Sennur Ulukus

Secure communication with feedback is studied. An achievability scheme in which the backward channel is used to generate a shared secret key is proposed. The scenario of binary symmetric forward and backward channels is considered, and a…

Information Theory · Computer Science 2016-11-17 Deniz Gunduz , D. Richard Brown , H. Vincent Poor
‹ Prev 1 4 5 6 7 8 10 Next ›