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

International Conference on Advanced Communication Technologies and Networking (CommNet)

Output Statistics of Random Binning for Multiple Access Channels and Strong Secrecy

Emmanouil M. Athanasakos

Published Dec 3, 2021• 0 citations
Publisher

Abstract

We consider utilizing the novel framework of output statistics of random binning, for proving achievability for communication over a multiple access channel. This framework uses the random binning technique while relying on the duality between channel and source coding problems. In particular, we provide the achievable rate region through a series of probability mass functions approximation arguments and consider randomness as an explicit random variable. Moreover, we analyze the wiretap version of the multiple access channel and prove that the strong secrecy criterion can be satisfied and an operational coding scheme can be designed by relying on the output statistics.

DOI
10.1109/commnet52204.2021.9641886

Related papers

Multiple Access Wiretap channels with strong secrecy

Mohammad Hossein Yassaee, Mohammad Reza Aref

The problem of secure communication over Multiple-Access Wiretap channel (MAC-WTC) under strong secrecy criterion is investigated. A new technique based on channel output statistics approximation is developed for establishing the strong security over multi-user channels. In particular, this technique shows that how simple wiretap coding results in secure communication under strong secrecy criterion instead of weak secrecy criterion. As a side result of the paper, two results on the output statistics of MAC are provided. Such results can be used to approximate the mutual information between input and output of MAC with respect to a given codebook of arbitrary rate.

IEEE Information Theory Workshop (ITW)•Aug 1, 2010•73 citations

An achievable region for the Wiretap multiple-access channel with common message

Moritz Wiese, Holger Boche

We derive a rate region which is achievable by the Wiretap MAC with Common Message under the strong secrecy criterion. We follow Devetak's approach to establishing strong secrecy. Using the concentration of the normed sum of bounded i.i.d. random variables around its mean, it is possible to show the existence of a code where the channel outputs at the eavesdropper are almost independent of the messages. The encoders may use a certain amount of common randomness. We give the example of a channel where the availability of common randomness is necessary for secret transmission.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2012•18 citations

Two-Multicast Channel With Confidential Messages

Hassan ZivariFard, Matthieu R. Bloch, Aria Nosratinia

Motivated in part by the problem of secure multicast distributed storage, we analyze secrecy rates for a channel in which two transmitters simultaneously multicast to two receivers in the presence of an eavesdropper. Achievable rates are calculated via extensions of a technique due to Chia and El Gamal and the method of output statistics of random binning. Outer bounds are derived for both the degraded and non-degraded versions of the channel, and examples are provided in which the inner and outer bounds meet. The inner bounds recover known results for the multiple-access wiretap channel, broadcast channel with confidential messages, and the compound MAC channel. An auxiliary result is also produced that derives an inner bound on the minimal randomness necessary to achieve secrecy in multiple-access wiretap channels.

arXiv:1902.08657•IEEE Transactions on Information Forensics and Security•Jan 1, 2021•4 citations

Non-Asymptotic Output Statistics of Random Binning and Its Applications

Mohammad Hossein Yassaee, Mohammad Reza Aref, Amin Gohari

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.

arXiv:1303.0695•Mar 4, 2013•13 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

Multi-terminal Strong Coordination Over Noisy Channels with Secrecy Constraints

Viswanathan Ramachandran, Tobias J. Oechtering, Mikael Skoglund

We investigate the problem of secure multi-terminal strong coordination aided by a multiple-access wiretap channel (MAC-WT). In this setup, independent and identically distributed (i.i.d.) copies of correlated sources are observed by two transmitters who encode the channel inputs to the MAC-WT. The legitimate receiver on observing the channel output must produce approximately i.i.d. copies of an output random variable jointly distributed with the two sources. Furthermore, we demand that an external eavesdropper learns essentially nothing about the sources and the simulated output sequence by observing its corresponding MAC-WT output. This is aided by the presence of independent pairwise shared randomness between each encoder and the legitimate decoder. The shared randomness rate tuples which permit such channel simulation with strong secrecy are of interest. We derive an achievable rate region based on a combination of coordination coding and wiretap coding, along with an outer bound. The inner bound is shown to be tight and a complete characterization is derived for the special case when the sources are independent and the legitimate receiver's channel is composed of deterministic links.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•4 citations
We consider utilizing the novel framework of output statistics of random binning, for proving achievability for communication over a multiple access channel. This framework uses the random binning technique while relying on the duality between channel and source coding problems. In particular, we provide the achievable rate region through a series of probability mass functions approximation arguments and consider randomness as an explicit random variable. Moreover, we analyze the wiretap version of the multiple access channel and prove that the strong secrecy criterion can be satisfied and an operational coding scheme can be designed by relying on the output statistics.
The problem of secure communication over Multiple-Access Wiretap channel (MAC-WTC) under strong secrecy criterion is investigated. A new technique based on channel output statistics approximation is developed for establishing the strong security over multi-user channels. In particular, this technique shows that how simple wiretap coding results in secure communication under strong secrecy criterion instead of weak secrecy criterion. As a side result of the paper, two results on the output statistics of MAC are provided. Such results can be used to approximate the mutual information between input and output of MAC with respect to a given codebook of arbitrary rate.
We derive a rate region which is achievable by the Wiretap MAC with Common Message under the strong secrecy criterion. We follow Devetak's approach to establishing strong secrecy. Using the concentration of the normed sum of bounded i.i.d. random variables around its mean, it is possible to show the existence of a code where the channel outputs at the eavesdropper are almost independent of the messages. The encoders may use a certain amount of common randomness. We give the example of a channel where the availability of common randomness is necessary for secret transmission.
Motivated in part by the problem of secure multicast distributed storage, we analyze secrecy rates for a channel in which two transmitters simultaneously multicast to two receivers in the presence of an eavesdropper. Achievable rates are calculated via extensions of a technique due to Chia and El Gamal and the method of output statistics of random binning. Outer bounds are derived for both the degraded and non-degraded versions of the channel, and examples are provided in which the inner and outer bounds meet. The inner bounds recover known results for the multiple-access wiretap channel, broadcast channel with confidential messages, and the compound MAC channel. An auxiliary result is also produced that derives an inner bound on the minimal randomness necessary to achieve secrecy in multiple-access wiretap channels.
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.
We investigate the problem of secure multi-terminal strong coordination aided by a multiple-access wiretap channel (MAC-WT). In this setup, independent and identically distributed (i.i.d.) copies of correlated sources are observed by two transmitters who encode the channel inputs to the MAC-WT. The legitimate receiver on observing the channel output must produce approximately i.i.d. copies of an output random variable jointly distributed with the two sources. Furthermore, we demand that an external eavesdropper learns essentially nothing about the sources and the simulated output sequence by observing its corresponding MAC-WT output. This is aided by the presence of independent pairwise shared randomness between each encoder and the legitimate decoder. The shared randomness rate tuples which permit such channel simulation with strong secrecy are of interest. We derive an achievable rate region based on a combination of coordination coding and wiretap coding, along with an outer bound. The inner bound is shown to be tight and a complete characterization is derived for the special case when the sources are independent and the legitimate receiver's channel is composed of deterministic links.