English
Related papers

Related papers: Wiretapped Commitment over Binary Channels

200 papers

In this two-part paper, we consider the transmission of confidential data over wireless wiretap channels. The first part presents an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static…

Information Theory · Computer Science 2007-07-13 Matthieu Bloch , Joao Barros , Miguel R. D. Rodrigues , Steven W. McLaughlin

We study the following private data transfer problem: Alice has a database of files. Bob and Cathy want to access a file each from this database (which may or may not be the same file), but each of them wants to ensure that their choices of…

Information Theory · Computer Science 2016-11-18 Manoj Mishra , Tanmay Sharma , Bikash K. Dey , Vinod M. Prabhakaran

This work considers the problem of secure and reliable information transmission via relay cooperation in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While previous work on this…

Cryptography and Security · Computer Science 2012-12-04 Yulong Shen , Xiaohong Jiang , Jianfeng Ma , Weisong Shi

In this paper, we consider the problem of secret key agreement in state-dependent 3-receiver broadcast channels. In the proposed model, there are two legitimate receivers, an eavesdropper and a transmitter where the channel state…

Cryptography and Security · Computer Science 2013-05-17 Mohsen Bahrami , Ali Bereyhi , Sadaf Salehkalaibar , Mohammad Reza Aref

In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel…

Information Theory · Computer Science 2010-07-28 Xiang He , Aylin Yener

Secret-key agreement protocols over wiretap channels controlled by a state parameter are studied. The entire state sequence is known (non-causally) to the sender but not to the receiver and the eavesdropper. Upper and lower bounds on the…

Information Theory · Computer Science 2010-07-01 Ashish Khisti

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

In this paper, we consider a two-way wiretap Multi-Input Multi-Output Multi-antenna Eve (MIMOME) channel, where both nodes (Alice and Bob) transmit and receive in an in-band full-duplex (IBFD) manner. For this system with keyless security,…

Information Theory · Computer Science 2024-03-12 Navneet Garg , Haifeng Luo , Tharmalingam Ratnarajah

This paper considers a state dependent broadcast channel with one transmitter, Alice, and two receivers, Bob and Eve. The problem is to effectively convey ("amplify") the channel state sequence to Bob while "masking" it from Eve. The extent…

Information Theory · Computer Science 2015-10-27 O. Ozan Koyluoglu , Rajiv Soundararajan , Sriram Vishwanath

Quantum cryptography shows that one can guarantee the secrecy of correlation on the sole basis of the laws of physics, that is without limiting the computational power of the eavesdropper. The usual security proofs suppose that the…

Quantum Physics · Physics 2009-11-13 Valerio Scarani , Nicolas Gisin , Nicolas Brunner , Lluis Masanes , Sergi Pino , Antonio Acin

We present a quantum communication protocol which keeps all the properties of the ping-pong protocol [Phys. Rev. Lett. 89, 187902 (2002)] but improves the capacity doubly as the ping-pong protocol. Alice and Bob can use the variable…

Quantum Physics · Physics 2009-11-10 Qing-yu Cai , Bai-wen Li

We consider the problem of polar coding for secure communications over the two-way wiretap channel, where two legitimate users communicate with each other simultaneously while a passive eavesdropper overhears a combination of their…

Information Theory · Computer Science 2017-06-23 Mengfan Zheng , Meixia Tao , Wen Chen , Cong Ling

We consider MIMO (Multiple Input Multiple Output) wiretap channels, where a legitimate transmitter Alice is communicating with a legitimate receiver Bob in the presence of an eavesdropper Eve, and communication is done via MIMO channels. We…

Information Theory · Computer Science 2013-01-10 Jean-Claude Belfiore , Frédérique Oggier

We consider the scenario wherein Alice wants to (potentially) communicate to the intended receiver Bob over a network consisting of multiple parallel links in the presence of a passive eavesdropper Willie, who observes an unknown subset of…

Information Theory · Computer Science 2014-01-30 Swanand Kadhe , Sidharth Jaggi , Mayank Bakshi , Alex Sprintson

We consider the strong secret key (SK) agreement problem for the satellite communication setting, where a satellite chooses a common binary phase shift keying modulated input for three statistically independent additive white Gaussian noise…

Information Theory · Computer Science 2021-08-31 Onur Günlü , Ueli Maurer , João Ribeiro

We propose a secure transmission scheme for a relay wiretap channel, where a source communicates with a destination via a decode-and-forward relay in the presence of spatially random-distributed eavesdroppers. We assume that the source is…

Information Theory · Computer Science 2016-11-17 Chenxi Liu , Nan Yang , Jinhong Yuan , Robert Malaney

This work considers the secure and reliable information transmission in two-hop relay wireless networks without the information of both eavesdropper channels and locations. While the previous work on this problem mainly studied infinite…

Networking and Internet Architecture · Computer Science 2012-12-03 Yulong Shen , Xiaohong Jiang , Jianfeng Ma , Weisong Shi

We consider an experimental setup of three USRPs that implement a wiretap channel, two USRPs are the legitimate players Alice and Bob, while the third USRP is the eavesdropper, whose position we vary to evaluate information leakage. The…

Information Theory · Computer Science 2017-01-16 Jinlong Lu , J. Harshan , Frédérique Oggier

In this paper, we study covert communication in wireless networks consisting of a transmitter, Alice, an intended receiver, Bob, a warden, Willie, and a Poisson field of interferers. Bob and Willie are subject to uncertain shot noise due to…

Information Theory · Computer Science 2018-06-20 Biao He , Shihao Yan , Xiangyun Zhou , Hamid Jafarkhani

Recent works have considered the ability of transmitter Alice to communicate reliably to receiver Bob without being detected by warden Willie. These works generally assume a standard discrete-time model. But the assumption of a…

Cryptography and Security · Computer Science 2020-01-22 Ke Li , Don Towsley , Dennis Goeckel