English
Related papers

Related papers: Strong Secrecy in Pairwise Key Agreement over a Ge…

200 papers

This paper studies the private key generation of a cooperative pairwise-independent network (PIN) with M+2 terminals (Alice, Bob and M relays), M >= 2. In this PIN, the correlated sources observed by every pair of terminals are independent…

Information Theory · Computer Science 2015-04-15 Peng Xu , Zhiguo Ding , Xuchu Dai

We investigate the secret key agreement from correlated Gaussian sources in which the legitimate parties can use the public communication with limited rate. For the class of protocols with the one-way public communication, we show a closed…

Information Theory · Computer Science 2011-03-08 Shun Watanabe , Yasutada Oohama

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…

Information Theory · Computer Science 2007-07-13 Ender Tekin , Aylin Yener

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

We consider the Gaussian Multiple Access Wire-Tap Channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the…

Information Theory · Computer Science 2008-03-31 Ender Tekin , Aylin Yener

The two-user multiple-input multiple-output (MIMO) Gaussian broadcast channel (BC) with common, private and confidential messages is considered. The transmitter sends a common message to both users, a confidential message to User 1 and a…

Information Theory · Computer Science 2019-05-29 Ziv Goldfeld , Haim H. Permuter

Secret-key generation and agreement based on wireless channel reciprocity offers a promising avenue for securing IoT networks. However, existing approaches predominantly rely on the similarity of instantaneous channel measurement samples…

Cryptography and Security · Computer Science 2025-10-14 Nora Basha , Bechir Hamdaoui , Attila A. Yavuz , Thang Hoang , Mehran Mozaffari Kermani

The demand private coded caching problem in a multi-access network with $K$ users and $K$ caches, where each user has access to $L$ neighbouring caches in a cyclic wrap-around manner, is studied. The additional constraint imposed is that…

Information Theory · Computer Science 2021-07-02 K. K. Krishnan Namboodiri , B. Sundar Rajan

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

Information Theory · Computer Science 2021-07-30 Hao Xu , Tianyu Yang , Kai-Kit Wong , Giuseppe Caire

A new scenario for generating a secret key and two private keys among three Terminals in the presence of an external eavesdropper is considered. Terminals 1, 2 and 3 intend to share a common secret key concealed from the external…

Cryptography and Security · Computer Science 2011-03-29 Parisa Babaheidarian , Somayeh Salimi , Mohammad Reza Aref

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

We consider the problem of reliable communication over multiple-access channels (MAC) where the channel is driven by an independent and identically distributed state process and the encoders and the decoder are provided with various degrees…

Information Theory · Computer Science 2012-01-20 Nevroz Şen , Fady Alajaji , Serdar Yüksel , Giacomo Como

We investigate the security of generalized quantum multiple-access channels. We provide the formula for the achievable rate region of secure communication in the scenario of two senders and a single receiver. We explicitly specify a…

Quantum Physics · Physics 2021-06-28 Tamoghna Das , Karol Horodecki , Robert Pisarczyk

This paper establishes the fundamental limits of a multi-access system where multiple users communicate to a legitimate receiver in presence of an external warden. Only a specific subset of the users, called covert users, needs their…

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

We investigate the $K$-user many-to-one interference channel with confidential messages in which the $K$th user experiences interference from all other $K-1$ users, and is at the same time treated as an eavesdropper to all the messages of…

Information Theory · Computer Science 2009-05-19 Xiang He , Aylin Yener

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

In wireless data networks, communication is particularly susceptible to eavesdropping due to its broadcast nature. Security and privacy systems have become critical for wireless providers and enterprise networks. This paper considers the…

Information Theory · Computer Science 2008-04-29 Ruoheng Liu , H. Vincent Poor

Secret key generation (SKG) between authenticated devices is a pivotal task for secure communications. Diffie-Hellman (DH) is de-facto standard but not post-quantum secure. In this paper, we shall invent and analyze a new security primitive…

Information Theory · Computer Science 2024-04-24 Gerhard Wunder , Axel Flinth , Daniel Becker , Benedikt Groß

We investigate the problem of covert and secret key generation over a state-dependent discrete memoryless channel with one-way public discussion in which an adversary, the warden, may arbitrarily choose the channel state. We develop an…

Information Theory · Computer Science 2019-11-12 Mehrdad Tahmasbi , Matthieu Bloch

We study the problem of simulating a two-user multiple-access channel (MAC) over a multiple access network of noiseless links. Two encoders observe independent and identically distributed (i.i.d.) copies of a source random variable each,…

Information Theory · Computer Science 2023-12-08 Gowtham R. Kurri , Viswanathan Ramachandran , Sibi Raj B. Pillai , Vinod M. Prabhakaran