English
Related papers

Related papers: A Bit of Secrecy for Gaussian Source Compression

200 papers

We study secure source-coding with causal disclosure, under the Gaussian distribution. The optimality of Gaussian auxiliary random variables is shown in various scenarios. We explicitly characterize the tradeoff between the rates of…

Information Theory · Computer Science 2015-06-16 Sanket Satpathy , Paul Cuff

Two parties, Alice and Bob, wish to distill a binary secret key out of a list of correlated variables that they share after running a quantum key distribution protocol based on continuous-spectrum quantum carriers. We present a novel…

Cryptography and Security · Computer Science 2007-05-23 G. Van Assche , J. Cardinal , N. J. Cerf

This paper studies the problem of secure communication over the broadcast channel with receiver side information under the lens of individual secrecy constraints. That is, the transmitter wants to send two independent messages to two…

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

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

A new paradigm for secure communication, based on quantum illumination, is proposed. Alice uses spontaneous parametric down-conversion to send Bob a set of signal modes over a pure-loss channel while retaining the set of idler modes with…

Quantum Physics · Physics 2009-04-28 Jeffrey H. Shapiro

We consider a wiretap multiple-input multiple-output multiple-eavesdropper (MIMOME) channel, where agent Alice aims at transmitting a secret message to agent Bob, while leaking no information on it to an eavesdropper agent Eve. We assume…

Information Theory · Computer Science 2014-04-15 Francesco Renna , Nicola Laurenti , Stefano Tomasin

We consider the Gaussian wiretap channel, where two legitimate players Alice and Bob communicate over an additive white Gaussian noise (AWGN) channel, while Eve is eavesdropping, also through an AWGN channel. We propose a coding strategy…

Information Theory · Computer Science 2016-11-15 Frédérique Oggier , Patrick Solé , Jean-Claude Belfiore

This paper considers the problem of filter design with secrecy constraints, where two legitimate parties (Alice and Bob) communicate in the presence of an eavesdropper (Eve), over a Gaussian multiple-input-multiple-output (MIMO) wiretap…

Information Theory · Computer Science 2015-06-15 Hugo Reboredo , João Xavier , Miguel R. D. Rodrigues

We consider one of the quantum key distribution protocols recently introduced in Ref. [Pirandola et al., Nature Physics 4, 726 (2008)]. This protocol consists in a two-way quantum communication between Alice and Bob, where Alice encodes…

Quantum Physics · Physics 2009-02-20 Stefano Pirandola , Stefano Mancini , Seth Lloyd , Samuel L. Braunstein

The secrecy of a distributed-storage system for passwords is studied. The encoder, Alice, observes a length-n password and describes it using two hints, which she stores in different locations. The legitimate receiver, Bob, observes both…

Information Theory · Computer Science 2017-01-10 Annina Bracher , Eran Hof , Amos Lapidoth

This paper investigates the problem of secure lossy source coding in the presence of an eavesdropper with arbitrary correlated side informations at the legitimate decoder (referred to as Bob) and the eavesdropper (referred to as Eve). This…

Information Theory · Computer Science 2011-05-25 Joffrey Villard , Pablo Piantanida

This paper studies a particular sensor network model which involves one single Gaussian source observed by many sensors, subject to additive independent Gaussian observation noise. Sensors communicate with the receiver over an additive…

Information Theory · Computer Science 2013-05-20 Emrah Akyol , Kenneth Rose , Tamer Basar

We consider the following communication task in the multi-party setting, which involves a joint random variable $XYZMN$ with the property that $M$ is independent of $YZN$ conditioned on $X$ and $N$ is independent of $XZM$ conditioned on…

Information Theory · Computer Science 2020-03-24 Anurag Anshu , Penghui Yao

This work presents a novel method to generate secret keys shared between a legitimate node pair (Alice and Bob) to safeguard the communication between them from an unauthorized node (Eve). To this end, we exploit the {\it reciprocal carrier…

Cryptography and Security · Computer Science 2019-03-01 Waqas Aman , Aneeqa Ijaz , M. Mahboob Ur Rahman , Dushanta Nalin K. Jayakody , Haris Pervaiz

We consider a secure source coding problem with a rate-limited helper. In particular, Alice observes an independent and identically distributed (i.i.d.) source X and wishes to transmit this source losslessly to Bob over a rate-limited link.…

Information Theory · Computer Science 2012-12-10 Ravi Tandon , Sennur Ulukus , Kannan Ramchandran

The secrecy of a communication system in which both the legitimate receiver and an eavesdropper are allowed some distortion is investigated. The secrecy metric considered is the exponent of the probability that the eavesdropper estimates…

Information Theory · Computer Science 2017-04-04 Ibrahim Issa , Aaron B. Wagner

A secret-key generation scheme based on a layered broadcasting strategy is introduced for slow-fading channels. In the model considered, Alice wants to share a key with Bob while keeping the key secret from Eve, who is a passive…

Information Theory · Computer Science 2011-03-17 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

In recent years, neural networks have been used to implement symmetric cryptographic functions for secure communications. Extending this domain, the proposed approach explores the application of asymmetric cryptography within a neural…

Cryptography and Security · Computer Science 2024-07-15 Mina Cecilie Wøien , Ferhat Ozgur Catak , Murat Kuzlu , Umit Cali

In semiquantum key-distribution (Boyer et al.) Alice has the same capability as in BB84 protocol, but Bob can measure and prepare qubits only in $\{|0\rangle, |1\rangle\}$ basis and reflect any other qubit. We study an eavesdropping…

Quantum Physics · Physics 2015-01-30 Arpita Maitra , Goutam Paul

Quantum key distribution allows two parties, traditionally known as Alice and Bob, to establish a secure random cryptographic key if, firstly, they have access to a quantum communication channel, and secondly, they can exchange classical…

Quantum Physics · Physics 2007-05-23 Matthias Christandl , Renato Renner , Artur Ekert