English
Related papers

Related papers: Wiretap Secret Key Agreement Via Secure Omniscienc…

200 papers

The random-energy model (REM), a solvable spin-glass model, has impacted an incredibly diverse set of problems, from protein folding to combinatorial optimization to many-body localization. Here, we explore a new connection to secret…

Disordered Systems and Neural Networks · Physics 2025-02-13 Vudtiwat Ngampruetikorn , David J. Schwab

We design short blocklength codes for the Gaussian wiretap channel under information-theoretic security guarantees. Our approach consists in decoupling the reliability and secrecy constraints in our code design. Specifically, we handle the…

Information Theory · Computer Science 2023-01-24 Vidhi Rana , Remi A. Chou

We study a special case of Willems's two-user multi-access channel with partially cooperating encoders from a security perspective. This model differs from Willems's setup in that only one encoder, Encoder 1, is allowed to conference;…

Information Theory · Computer Science 2016-11-17 Zohaib Hassan Awan , Abdellatif Zaidi , Luc Vandendorpe

We are interested in investigating the security of source encryption with a symmetric key under side-channel attacks. In this paper, we propose a general framework of source encryption with a symmetric key under the side-channel attacks,…

Information Theory · Computer Science 2022-05-05 Yasutada Oohama , Bagus Santoso

In this paper, we study the problem of physical layer security in a large-scale multiple-input multiple-output (LS-MIMO) relaying system. The advantage of LS-MIMO relaying systems is exploited to enhance both wireless security and spectral…

Information Theory · Computer Science 2014-01-15 Xiaoming Chen , Lei Lei , Huazi Zhang , Chau Yuen

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

An upper bound to the identification capacity of discrete memoryless wiretap channels is derived under the requirement of semantic effective secrecy, combining semantic secrecy and stealth constraints. A previously established lower bound…

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

This paper considers the problem of simultaneously communicating two messages, a high-security message and a low-security message, to a legitimate receiver, referred to as the security embedding problem. An information-theoretic formulation…

Information Theory · Computer Science 2011-02-09 Hung D. Ly , Tie Liu , Yufei Blankenship

We analyze physical-layer security based on the premise that the coding mechanism for secrecy over noisy channels is tied to the notion of channel resolvability. Instead of considering capacity-based constructions, which associate to each…

Information Theory · Computer Science 2013-09-09 Matthieu R. Bloch , J. Nicholas Laneman

The physical layer security in the up-link of the wireless communication systems is often modeled as the multiple access wiretap channel (MAC-WT), and recently it has received a lot attention. In this paper, the MAC-WT has been re-visited…

Information Theory · Computer Science 2017-01-17 Bin Dai , Zheng Ma

We consider secret key generation for a "pairwise independent network" model in which every pair of terminals observes correlated sources that are independent of sources observed by all other pairs of terminals. The terminals are then…

Information Theory · Computer Science 2010-08-09 Sirin Nitinawarat , Chunxuan Ye , Alexander Barg , Prakash Narayan , Alex Reznik

End-to-end learning of communication systems with neural networks and particularly autoencoders is an emerging research direction which gained popularity in the last year. In this approach, neural networks learn to simultaneously optimize…

Information Theory · Computer Science 2019-03-12 Rick Fritschek , Rafael F. Schaefer , Gerhard Wunder

Key agreement is a fundamental cryptographic primitive. It has been proved that key agreement protocols with security against computationally unbounded adversaries cannot exist in a setting where Alice and Bob do not have dependent…

Cryptography and Security · Computer Science 2016-04-14 Reihaneh Safavi-Naini , Pengwei Wang

The problem of secure broadcasting with independent secret keys is studied. The particular scenario is analyzed in which a common message has to be broadcast to two legitimate receivers, while keeping an external eavesdropper ignorant of…

Information Theory · Computer Science 2018-02-20 Rafael F. Schaefer , Ashish Khisti , H. Vincent Poor

We study common randomness where two parties have access to i.i.d. samples from a known random source, and wish to generate a shared random key using limited (or no) communication with the largest possible probability of agreement. This…

Computational Complexity · Computer Science 2017-07-26 Badih Ghazi , T. S. Jayram

Large Language Models (LLMs) are increasingly deployed in sensitive domains including healthcare, legal services, and confidential communications, where privacy is paramount. This paper introduces Whisper Leak, a side-channel attack that…

Cryptography and Security · Computer Science 2025-11-06 Geoff McDonald , Jonathan Bar Or

In this paper we consider tandem error control coding and cryptography in the setting of the {\em wiretap channel} due to Wyner. In a typical communications system a cryptographic application is run at a layer above the physical layer and…

Information Theory · Computer Science 2015-09-24 Willie K Harrison , Steven W. McLaughlin

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ß

The work by Christandl, K\"onig and Renner [Phys. Rev. Lett. 102, 020504 (2009)] provides in particular the possibility of studying unconditional security in the finite-key regime for all discrete-variable protocols. We spell out this bound…

Quantum Physics · Physics 2011-02-02 Lana Sheridan , Thinh Phuc Le , Valerio Scarani

In this paper, we consider the problem of power allocation in MIMO wiretap channel for secrecy in the presence of multiple eavesdroppers. Perfect knowledge of the destination channel state information (CSI) and only the statistical…

Information Theory · Computer Science 2014-01-16 Sanjay Vishwakarma , A. Chockalingam