English
Related papers

Related papers: Secret Key Agreement under Discussion Rate Constra…

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

A quantum key distribution network enables pairs of users to generate independent secret keys by leveraging the principles of quantum physics. For end-to-end secure communication, a user pair's secret key must remain secure against any…

Quantum Physics · Physics 2026-02-26 Yiming Bian , Yichen Zhang , Song Yu , Zhengyu Li , Hong Guo

In this paper, new two-user multiple access wiretap channel models are studied. First, the multiple access wiretap channel II with a discrete memoryless main channel, under three different wiretapping scenarios, is introduced. The…

Information Theory · Computer Science 2018-02-07 Mohamed Nafea , Aylin Yener

The communication complexity of achieving secret key (SK) capacity in the multiterminal source model of Csisz$\'a$r and Narayan is the minimum rate of public communication required to generate a maximal-rate SK. It is well known that the…

Information Theory · Computer Science 2015-04-06 Manuj Mukherjee , Navin Kashyap

A multiple-access channel is considered in which messages from one encoder are confidential. Confidential messages are to be transmitted with perfect secrecy, as measured by equivocation at the other encoder. The upper bounds and the…

Information Theory · Computer Science 2007-07-13 Ruoheng Liu , Ivana Maric , Roy D. Yates , Predrag Spasojevic

The problem of identification over a discrete memoryless wiretap channel is examined under the criterion of semantic effective secrecy. This secrecy criterion guarantees both the requirement of semantic secrecy and of stealthy…

Information Theory · Computer Science 2025-02-27 Abdalla Ibrahim , Johannes Rosenberger , Boulat A. Bash , Christian Deppe , Roberto Ferrara , Uzi Pereg

Secrecy in communication systems is measured herein by the distortion that an adversary incurs. The transmitter and receiver share secret key, which they use to encrypt communication and ensure distortion at an adversary. A model is…

Information Theory · Computer Science 2015-04-14 Curt Schieler , Paul Cuff

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

This paper considers the problem of secret communication over a multiple access channel with generalized feedback. Two trusted users send independent confidential messages to an intended receiver, in the presence of a passive eavesdropper.…

Information Theory · Computer Science 2016-11-18 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

In this paper, we consider the case that sharing many secrets among a set of participants using the threshold schemes. All secrets are assumed to be statistically independent and the weak secure condition is focused on. Under such…

Information Theory · Computer Science 2023-12-12 Jiahong Wu , Nan Liu , Wei Kang

A broadcast channel (BC) where the decoders cooperate via a one-sided link is considered. One common and two private messages are transmitted and the private message to the cooperative user should be kept secret from the cooperation-aided…

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

This paper studies the capacity limits for quantum secret sharing (QSS). The goal of a QSS scheme is to distribute a quantum secret among multiple participants, such that only authorized parties can recover it through collaboration, while…

Quantum Physics · Physics 2026-04-28 Gabrielle Lalou , Husein Natur , Uzi Pereg

We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, "covert" means that a warden on the channel should observe similar…

Information Theory · Computer Science 2017-08-09 Si-Hyeon Lee , Ligong Wang , Ashish Khisti , Gregory W. Wornell

The secrecy rate region of wiretap interference channels with a multi-antenna passive eavesdropper is studied under receiver energy harvesting constraints. To stay operational in the network, the legitimate receivers demand energy alongside…

Information Theory · Computer Science 2019-03-01 Ali Kariminezhad , Zohaib Hassan Awan , Hendrik Vogt , Aydin Sezgin

The problem of secret-key based authentication under a privacy constraint on the source sequence is considered. The identifier measurements during authentication are assumed to be controllable via a cost-constrained "action" sequence.…

Information Theory · Computer Science 2020-02-27 Onur Günlü , Kittipong Kittichokechai , Rafael F. Schaefer , Giuseppe Caire

We investigate the task of conference key agreement in near-term quantum networks, where the nodes are connected by sources of bipartite entangled states, under the class of local operations not requiring quantum memory. We derive upper…

Quantum Physics · Physics 2026-05-19 Justus Neumann , Hermann Kampermann , Dagmar Bruß , Anton Trushechkin

This paper studies the problem of secure communication over broadcast channels under the individual secrecy constraints. That is, the transmitter wants to send two independent messages to two legitimate receivers in the presence of an…

Information Theory · Computer Science 2015-12-01 Yanling Chen , O. Ozan Koyluoglu , Aydin Sezgin

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

In this paper, the individual secrecy of two-way wiretap channel is investigated, where two legitimate users' messages are separately guaranteed secure against an external eavesdropper. For one thing, in some communication scenarios, the…

Information Theory · Computer Science 2017-07-20 Chao Qi , Bin Dai , Xiaohu Tang

This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are shown to be tighter than existing…

Information Theory · Computer Science 2016-01-25 Wei Yang , Rafael F. Schaefer , H. Vincent Poor
‹ Prev 1 3 4 5 6 7 10 Next ›