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 ISC Conference on Information Security and Cryptology (ISCISC)

Classical-Quantum Multiple Access Wiretap Channel

Hadi Aghaee, Bahareh Akhbari

Published Aug 1, 2019• 15 citations
Publisher

Abstract

In this paper, the quantum wiretap channel (QWTC) and quantum multiple access channel (QMAC) are used so as to introduce the classical-quantum multiple access wiretap channel (C-QMA-WTC). In this regard, the classical concepts about the multiple access wiretap channel (MA-WTC) are defined. Moreover, the multiple access wiretap channel with classical inputs and quantum output is considered. An achievable secrecy rate region of C-QMA-WTC is derived. After presenting the results of quantum wiretap channel, we illustrate how mutual information can be used instead of the Holevo information in the expression of the secrecy capacity region.

DOI
10.1109/iscisc48546.2019.8985142

Related papers

Quantum Multiple Access Wiretap Channel: On the One-Shot Achievable Secrecy Rate Regions

Hadi Aghaee, Bahareh Akhbari

In this paper, we want to investigate classical-quantum multiple access wiretap channels (CQ-MA-WTC) under one-shot setting. In this regard, we analyze the CQ-MA-WTC using simultaneous position-based decoder for reliable decoding and using a newly introduced technique in order to decode securely. Also, for the sake of comparison, we analyze the CQ-MA-WTC using Sen's one-shot joint typicality lemma for reliable decoding. The simultaneous position-based decoder tends to a multiple hypothesis testing problem. Also, using convex splitting to analyze the privacy criteria in a simultaneous scenario becomes problematic. To overcome both problems, we first introduce a new channel that can be considered as a dual to the CQ-MA-WTC. This channel is called a point-to-point quantum wiretap channel with multiple messages (PP-QWTC). In the following, as a strategy to solve the problem, we also investigate and analyze quantum broadcast channels (QBCs) under the one-shot setting.

arXiv:2301.02479•Jan 6, 2023•0 citations

Quantum Advantage in Multiple Access Wiretap Channels with Entangled Transmitters

Hassan ZivariFard, Xiaodong Wang

We investigate secure communication over a classical multiple-access wiretap channel (MAC-WTC), specifically exploring the benefit of shared entanglement between the transmitters. Under the strict semantic security criterion, we derive an achievable rate region and a regularized expression for the secrecy capacity. We further establish a single-letter upper bound on the secure capacity of the MAC-WTC with entangled transmitters. Our results demonstrate that entanglement strictly enlarges the secrecy capacity of MAC-WTC compared to sharing only classical correlated randomness, a finding we illustrate using a pseudo-telepathy game example. Finally, we establish new strong soft-covering lemmas for the output statistics of multipleaccess channels (MACs) with entangled transmitters. Our results generalize existing results for non-entangled systems.

cs.ITCross-listedarXiv:2609.06808•IEEE Transactions on Information Theory•Sep 8, 2026•1 citation

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

Private Classical Information over a Quantum Multiple Access Channel: One-Shot Secrecy Rate Region

Hadi Aghaee, Bahareh Akhbari

In this paper, the problem of private communication of classical messages over a quantum multiple access channel under one-shot setting is studied. In this regard, we first introduce general quantum multiple access wiretap channel, and then we calculate an achievable secrecy rate region for the main channel. The encoding process follows the combination of the superposition and Wyner wiretap coding schemes, and the decoding technique is based on the simultaneous decoder and convex splitting. At last, we extend the results to the l-user case.

International Symposium on Telecommunications•Dec 15, 2020•5 citations

Classical-Quantum Multiple Access Channel with Secrecy Constraint: One-Shot Rate Region

Hadi Aghaee, Bahareh Akhbari

In this paper, we aim to study a -user quantum multiple access wiretap channel with an arbitrary number of wiretappers under one-shot setting. In this regard, we first introduce the general quantum multiple access wiretap channel and the simplified proposed channel. Then, we calculate an achievable secrecy rate region for the main channel with two users. The encoding process uses the superposition and wiretap coding techniques, and the decoding technique is based on the simultaneous decoder. Also, Convex splitting is used to satisfy security requirements. At last, we extend the results to the l-user case.

International Journal of Information & Communication Technology Research•Apr 1, 2020•2 citations

Deterministic multiple access wiretap channel

Vahid Jahandideh, Somayeh Salimi, Mahmoud Salmasizadeh

Two-user Multiple Access Channel with a Wire-Tapper (MAC-WT) is considered. A general outer bound for the secrecy capacity region is given. Also, we have defined the Deterministic MAC-WT, where the channel input of each user is a deterministic function of the channel output and the channel input of the other user. For this network single-letter inner and outer bounds for the secrecy capacity region are given. Furthermore, it is shown that in the Deterministic MAC-WT, if the wiretapper channel is a degraded version of the main channel, inner and outer bounds meet and the secrecy capacity region is characterized.

IEEE International Conference on Information Theory and Information Security•Dec 1, 2010•2 citations
In this paper, the quantum wiretap channel (QWTC) and quantum multiple access channel (QMAC) are used so as to introduce the classical-quantum multiple access wiretap channel (C-QMA-WTC). In this regard, the classical concepts about the multiple access wiretap channel (MA-WTC) are defined. Moreover, the multiple access wiretap channel with classical inputs and quantum output is considered. An achievable secrecy rate region of C-QMA-WTC is derived. After presenting the results of quantum wiretap channel, we illustrate how mutual information can be used instead of the Holevo information in the expression of the secrecy capacity region.
In this paper, we want to investigate classical-quantum multiple access wiretap channels (CQ-MA-WTC) under one-shot setting. In this regard, we analyze the CQ-MA-WTC using simultaneous position-based decoder for reliable decoding and using a newly introduced technique in order to decode securely. Also, for the sake of comparison, we analyze the CQ-MA-WTC using Sen's one-shot joint typicality lemma for reliable decoding. The simultaneous position-based decoder tends to a multiple hypothesis testing problem. Also, using convex splitting to analyze the privacy criteria in a simultaneous scenario becomes problematic. To overcome both problems, we first introduce a new channel that can be considered as a dual to the CQ-MA-WTC. This channel is called a point-to-point quantum wiretap channel with multiple messages (PP-QWTC). In the following, as a strategy to solve the problem, we also investigate and analyze quantum broadcast channels (QBCs) under the one-shot setting.
We investigate secure communication over a classical multiple-access wiretap channel (MAC-WTC), specifically exploring the benefit of shared entanglement between the transmitters. Under the strict semantic security criterion, we derive an achievable rate region and a regularized expression for the secrecy capacity. We further establish a single-letter upper bound on the secure capacity of the MAC-WTC with entangled transmitters. Our results demonstrate that entanglement strictly enlarges the secrecy capacity of MAC-WTC compared to sharing only classical correlated randomness, a finding we illustrate using a pseudo-telepathy game example. Finally, we establish new strong soft-covering lemmas for the output statistics of multipleaccess channels (MACs) with entangled transmitters. Our results generalize existing results for non-entangled systems.
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.
In this paper, the problem of private communication of classical messages over a quantum multiple access channel under one-shot setting is studied. In this regard, we first introduce general quantum multiple access wiretap channel, and then we calculate an achievable secrecy rate region for the main channel. The encoding process follows the combination of the superposition and Wyner wiretap coding schemes, and the decoding technique is based on the simultaneous decoder and convex splitting. At last, we extend the results to the l-user case.
In this paper, we aim to study a -user quantum multiple access wiretap channel with an arbitrary number of wiretappers under one-shot setting. In this regard, we first introduce the general quantum multiple access wiretap channel and the simplified proposed channel. Then, we calculate an achievable secrecy rate region for the main channel with two users. The encoding process uses the superposition and wiretap coding techniques, and the decoding technique is based on the simultaneous decoder. Also, Convex splitting is used to satisfy security requirements. At last, we extend the results to the l-user case.
Two-user Multiple Access Channel with a Wire-Tapper (MAC-WT) is considered. A general outer bound for the secrecy capacity region is given. Also, we have defined the Deterministic MAC-WT, where the channel input of each user is a deterministic function of the channel output and the channel input of the other user. For this network single-letter inner and outer bounds for the secrecy capacity region are given. Furthermore, it is shown that in the Deterministic MAC-WT, if the wiretapper channel is a degraded version of the main channel, inner and outer bounds meet and the secrecy capacity region is characterized.