Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1303.0695

Non-Asymptotic Output Statistics of Random Binning and Its Applications

Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin Gohari

Published Mar 4, 2013• 13 citations
arXivHTMLPDF

Abstract

In this paper we develop a finite blocklength version of the Output Statistics of Random Binning (OSRB) framework. The framework is shown to be optimal in the point-to-point case. New second order regions for broadcast channel and wiretap channel with strong secrecy criterion are derived.
DOI
10.48550/arxiv.1303.0695

Related papers

Secure channel simulation

Amin Gohari, Mohammad Hossein Yassaee, Mohammad Reza Aref

In this paper the Output Statistics of Random Binning (OSRB) framework is used to prove a new inner bound for the problem of secure channel simulation. Our results subsume some recent results on the secure function computation. We also provide an achievability result for the problem of simultaneously simulating a channel and creating a shared secret key. A special case of this result generalizes the lower bound of Gohari and Anantharam on the source model to include constraints on the rates of the public discussion.

arXiv:1207.3513•IEEE Information Theory Workshop (ITW)•Sep 1, 2012•9 citations

Second order asymptotics for degraded wiretap channels: How good are existing codes?

Mehrdad Tahmasbi, Matthieu R. Bloch

We develop three new results regarding the second-order asymptotics of secure communication over wiretap channels. We first establish the optimal second-order asymptotics for a class of degraded wiretap channels without feedback under an effective secrecy criterion. We then derive the optimal second-order asymptotics for degraded wiretap channels with feedback. We finally develop a new converse bound for channel resolvability with non-capacity achieving distributions, which we use to develop useful converse bounds for asymmetric degraded wiretap channels. Our results are illustrated with several numerical examples, and suggest that known coding techniques already achieve their best performance.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2016•3 citations

A new wiretap channel model and its strong secrecy capacity

Mohamed Nafea, Aylin Yener

In this paper, a new wiretap channel (WTC) model with a discrete memoryless (DM) main channel and a wiretapper who noiselessly observes a fixed portion, of her choice, of the transmitted symbols, while observing the remaining transmitted symbols through another DM channel (DMC), is considered. The strong secrecy capacity of the model is identified. The achievability is established using the output statistics of random binning framework which exploits the duality between source and channel coding problems. The converse is derived by upper bounding the secrecy capacity of an equivalent model with the secrecy capacity of a DM-WTC. This result generalizes both the classical DM-WTC and the WTC-II with a DM main channel.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•11 citations

Wiretap Channels: Nonasymptotic Fundamental Limits

Wei Qing Yang, Rafael F. Schaefer, H. Vincent Poor

This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than existing bounds, and lead to the tightest bounds on the second-order coding rate for discrete memoryless and Gaussian wiretap channels. The exact second-order coding rate is established for semi-deterministic wiretap channels, which characterizes the optimal tradeoff between reliability and secrecy in the finite-blocklength regime. Underlying our achievability bounds are two new privacy amplification results, which not only refine the classic privacy amplification results, but also achieve secrecy under the stronger semantic-security metric.

arXiv:1706.03866•IEEE Transactions on Information Theory•Mar 12, 2019•147 citations

Secrecy-reliability tradeoff for semi-deterministic wiretap channels at finite Blocklength

Wei Qing Yang, Rafael F. Schaefer, H. Vincent Poor

This paper studies the maximum secrecy rate for a semi-deterministic wiretap channel, in which the channel between the transmitter and the legitimate receiver is deterministic, while that between the transmitter and the eavesdropper is a discrete memoryless channel. For a given decoding error probability and information leakage (measured by the total variation distance), the optimal second-order secrecy rate is derived. Unlike the secrecy capacity, the second-order secrecy rate characterizes the optimal tradeoff between secrecy and reliability at finite blocklength.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2017•20 citations

Finite-blocklength bounds for wiretap channels

Wei Qing Yang, Rafael F. Schaefer, H. Vincent Poor

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 bounds. The bounds also lead to the tightest second-order coding rate for discrete memoryless and Gaussian wiretap channels.

arXiv:1601.06055•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2016•61 citations
In this paper the Output Statistics of Random Binning (OSRB) framework is used to prove a new inner bound for the problem of secure channel simulation. Our results subsume some recent results on the secure function computation. We also provide an achievability result for the problem of simultaneously simulating a channel and creating a shared secret key. A special case of this result generalizes the lower bound of Gohari and Anantharam on the source model to include constraints on the rates of the public discussion.
We develop three new results regarding the second-order asymptotics of secure communication over wiretap channels. We first establish the optimal second-order asymptotics for a class of degraded wiretap channels without feedback under an effective secrecy criterion. We then derive the optimal second-order asymptotics for degraded wiretap channels with feedback. We finally develop a new converse bound for channel resolvability with non-capacity achieving distributions, which we use to develop useful converse bounds for asymmetric degraded wiretap channels. Our results are illustrated with several numerical examples, and suggest that known coding techniques already achieve their best performance.
In this paper, a new wiretap channel (WTC) model with a discrete memoryless (DM) main channel and a wiretapper who noiselessly observes a fixed portion, of her choice, of the transmitted symbols, while observing the remaining transmitted symbols through another DM channel (DMC), is considered. The strong secrecy capacity of the model is identified. The achievability is established using the output statistics of random binning framework which exploits the duality between source and channel coding problems. The converse is derived by upper bounding the secrecy capacity of an equivalent model with the secrecy capacity of a DM-WTC. This result generalizes both the classical DM-WTC and the WTC-II with a DM main channel.
This paper investigates the maximal secret communication rate over a wiretap channel subject to reliability and secrecy constraints at a given blocklength. New achievability and converse bounds are derived, which are uniformly tighter than existing bounds, and lead to the tightest bounds on the second-order coding rate for discrete memoryless and Gaussian wiretap channels. The exact second-order coding rate is established for semi-deterministic wiretap channels, which characterizes the optimal tradeoff between reliability and secrecy in the finite-blocklength regime. Underlying our achievability bounds are two new privacy amplification results, which not only refine the classic privacy amplification results, but also achieve secrecy under the stronger semantic-security metric.
This paper studies the maximum secrecy rate for a semi-deterministic wiretap channel, in which the channel between the transmitter and the legitimate receiver is deterministic, while that between the transmitter and the eavesdropper is a discrete memoryless channel. For a given decoding error probability and information leakage (measured by the total variation distance), the optimal second-order secrecy rate is derived. Unlike the secrecy capacity, the second-order secrecy rate characterizes the optimal tradeoff between secrecy and reliability at finite blocklength.