English
Related papers

Related papers: Secret Key and Private Key Constructions for Simpl…

200 papers

Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, termed "distributed arithmetic coding", which exploits the fact that arithmetic codes are good…

Information Theory · Computer Science 2008-11-11 M. Grangetto , E. Magli , G. Olmo

The security of neural cryptography is investigated. A key-exchange protocol over a public channel is studied where the parties exchanging secret messages use multilayer neural networks which are trained by their mutual output bits and…

Disordered Systems and Neural Networks · Physics 2009-11-07 R. Mislovaty , Y. Perchenok , Ido Kanter , Wolfgang Kinzel

In this paper, we consider a class of multiterminal source coding problems, each subject to distortion constraints computed using a specific, entropy-based, distortion measure. We provide the achievable rate distortion region for two cases…

Information Theory · Computer Science 2011-06-02 Thomas Courtade , Richard Wesel

We consider the problem of multiterminal secret key agreement (SKA) in wiretapped source model where terminals have access to samples of correlated random variables from a publicly known joint probability distribution. The adversary has…

Information Theory · Computer Science 2022-01-07 Alireza Poostindouz , Reihaneh Safavi-Naini

We consider the generation of a secret key (SK) by the inputs and the output of a secure multipleaccess channel (MAC) that additionally have access to a noiseless public communication channel. Under specific restrictions on the protocols,…

Information Theory · Computer Science 2019-02-26 Himanshu Tyagi , Shun Watanabe

The second-order achievable rate region in Slepian-Wolf source coding systems is investigated. The concept of second-order achievable rates, which enables us to make a finer evaluation of achievable rates, has already been introduced and…

Information Theory · Computer Science 2017-03-28 Ryo Nomura , Te Sun Han

Secret-key generation in a wireless environment exploiting the randomness and reciprocity of the channel gains is considered. A new channel model is proposed which takes into account the effect of reflections (or re-radiations) from receive…

Information Theory · Computer Science 2013-08-07 Hendrik Vogt , Aydin Sezgin

Motivated by streaming multi-view video coding and wireless sensor networks, we consider the problem of blockwise streaming compression of a pair of correlated sources, which we term streaming Slepian-Wolf coding. We study the moderate…

Information Theory · Computer Science 2017-09-21 Lin Zhou , Vincent Y. F. Tan , Mehul Motani

Strong secrecy communication over a discrete memoryless state-dependent multiple access channel (SD-MAC) with an external eavesdropper is investigated. The channel is governed by discrete memoryless and i.i.d. channel states and the channel…

Information Theory · Computer Science 2023-05-03 Yiqi Chen , Tobias Oechtering , Mikael Skoglund , Yuan Luo

We consider a noisy Slepian-Wolf problem where two correlated sources are separately encoded and transmitted over two independent binary memoryless symmetric channels. Each channel capacity is assumed to be characterized by a single…

Information Theory · Computer Science 2011-06-01 Arvind Yedla , Henry D. Pfister , Krishna Narayanan

We show how to efficiently simulate the sending of a message M to a receiver who has partial information about the message, so that the expected number of bits communicated in the simulation is close to the amount of additional information…

Information Theory · Computer Science 2011-06-21 Mark Braverman , Anup Rao

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

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

Secret-key agreement based on biometric or physical identifiers is a promising security protocol for authenticating users or devices with small chips due to its lightweight security. In previous studies, the fundamental limits of such a…

Information Theory · Computer Science 2025-03-13 Vamoua Yachongka , Hideki Yagi , Hideki Ochiai

We study a multi-task private semantic communication problem, in which an encoder has access to an information source arbitrarily correlated with some latent private data. A user has $L$ tasks with priorities. The encoder designs a message…

Information Theory · Computer Science 2024-05-15 Amirreza Zamani , Sajad Daei , Tobias J. Oechtering , Mikael Skoglund

For the multiterminal secret key agreement problem, new single-letter lower bounds are obtained on the public discussion rate required to achieve any given secret key rate below the secrecy capacity. The results apply to general source…

Information Theory · Computer Science 2017-01-20 Chung Chan , Manuj Mukherjee , Navin Kashyap , Qiaoqiao Zhou

Correlated sources are present in communication systems where protocols ensure that there is some predetermined information for sources. Here correlated sources across an eavesdropped channel that incorporate a heterogeneous encoding scheme…

Information Theory · Computer Science 2015-01-26 R Balmahoon , L Cheng

We analyze the fundamental trade-off of secret key-based authentication systems in the presence of an eavesdropper for correlated Gaussian sources. A complete characterization of trade-off among secret-key, storage, and privacy-leakage…

Information Theory · Computer Science 2022-06-30 Vamoua Yachongka , Hideki Yagi , Yasutada Oohama

In this paper, we consider different aspects of the network functional compression problem where computation of a function (or, some functions) of sources located at certain nodes in a network is desired at receiver(s). The rate region of…

Information Theory · Computer Science 2010-12-01 Soheil Feizi , Muriel Medard

We study covert secret key generation over a binary-input two-user multiple access channel with one-way public discussion and derive bounds on the capacity region. Specifically, in this problem, there are three legitimate parties: Alice,…

Information Theory · Computer Science 2025-04-09 Yingxin Zhang , Lin Zhou , Qiaosheng Zhang
‹ Prev 1 3 4 5 6 7 10 Next ›