Searcharxiv⌕ Search

arXiv subjects

Hadi Aghaee

Publications and source records attributed to Hadi Aghaee.

7 recordsLinked to original sources
arXiv2026

On (Im)possibility of Network Oblivious Transfer via Noisy Channels and Non-Signaling Correlations

This work investigates the fundamental limits of implementing network oblivious transfer via noisy multiple access channels and broadcast channels between honest-but-curious parties when the parties have access to general tripartite non-signaling correlations. By modeling the shared resource as an arbitrary tripartite non-signaling box, we obtain a unified perspective on both the channel behavior and the resulting correlations. Our main result demonstrates that perfect oblivious transfer is impossible. In the asymptotic regime, we further show that even negligible leakage cannot be achieved, as repeated use of the resource amplifies the receiver(s)'s ability to distinguish messages that were not intended for him/them. In contrast, the receiver(s)'s own privacy is not subject to a universal impossibility limitation.

cs.IT↗
arXiv2026

Implementation of Oblivious Transfer over Binary-Input AWGN Channels by Polar Codes

We develop a one-out-of-two oblivious transfer protocol over the binary-input additive white Gaussian noise (BI-AWGN) channel using polar codes. The scheme uses two decoder views linked by automorphisms of the polar transform and publicly draws the encoder at random from the corresponding automorphism group. This yields perfect secrecy for Bob at any blocklength. Secrecy for Alice is obtained asymptotically via channel polarization combined with privacy amplification. Because the construction deliberately injects randomness into selected bad bit-channels, we derive a relaxed reliability criterion, which is empirically certified via Monte-Carlo simulations. We also evaluate finite-blocklength performance. Finally, we characterize the polar-transform automorphisms as bit-level permutations of bit-channel indices, and exploit this structure to derive and optimize an achievable finite-blocklength rate.

cs.IT↗
arXiv2025

Network Oblivious Transfer via Noisy Broadcast Channels

This paper investigates information-theoretic oblivious transfer via a discrete memoryless broadcast channel with one sender and two receivers. We analyze both non-colluding and colluding honest-but-curious user models and establish general upper bounds on the achievable oblivious transfer capacity region for each case. Two explicit oblivious transfer protocols are proposed. The first ensures correctness and privacy for independent, non-colluding receivers by leveraging the structure of binary erasure broadcast channels. The second protocol, secure even under receiver collusion, introduces additional entropy-sharing and privacy amplification mechanisms to preserve secrecy despite information leakage between users. Our results show that for the non-colluding case, the upper and lower bounds on oblivious transfer capacity coincide, providing a complete characterization of the achievable region. The work provides a unified theoretical framework bridging network information theory and cryptographic security, highlighting the potential of noisy broadcast channels as powerful primitives for multi-user privacy-preserving communication.

cs.IT↗
arXiv2025

Network Oblivious Transfer via Noisy Channels: Limits and Capacities

In this paper, we study the information-theoretic limits of oblivious transfer via noisy channels. We also investigate oblivious transfer over a noisy multiple-access channel with two non-colluding senders and a single receiver. The channel is modeled through correlations among the parties, who may be honest-but-curious or, in the case of the receiver, potentially malicious. We first revisit the information-theoretic limits of two-party oblivious transfer and then extend these results to the multiple-access setting. For honest-but-curious participants, we introduce a multiparty protocol that reduces a general multiple access channel to a suitable correlation model. In scenarios with a malicious receiver, we characterize an achievable oblivious transfer rate region.

cs.IT↗
arXiv2024

The Interference Channel with Entangled Transmitters

This paper explores communication over a two-sender, two-receiver classical interference channel, enhanced by the availability of entanglement resources between transmitters. The central contributions are an inner and outer bound on the capacity region for a general interference channel with entangled transmitters. It addresses the persistent challenge of the lack of a general capacity formula, even in the purely classical case, and highlights the striking similarities in achievable rate expressions when assessing quantum advantages. Through a concrete example, it is shown that entanglement can significantly boost performance in certain types of channels.

quant-ph↗
arXiv2023

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

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.

cs.IT↗