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:2501.17021

Network Oblivious Transfer via Noisy Channels: Limits and Capacities

Hadi Aghaee, Akhbari, Bahareh, Deppe, Christian

Published Jan 28, 2025• 4 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2501.17021

Related papers

On Information Theoretical Limits of Oblivious Transfer

Hadi Aghaee, Bahareh Akhbari, Christian Deppe

Information-theoretical limits of oblivious transfer are studied. First, we explore the feasibility and constraints of implementing oblivious transfer protocols over some communication channels, with a focus on noisy point-to-point and multiple-access channels with non-colluding parties. The paper also examines secure multiparty communication, and highlighting the challenges of achieving oblivious transfer under information-theoretic security models. As an example, the limits of oblivious transfer over a two-user multiple access channel are studied.

IEEE Globecom Workshops (GC Wkshps)•Dec 8, 2025•2 citations

On the Oblivious Transfer Capacity of the Erasure Channel

Hideki Imai, Kirill Morozov, Anderson C. A. Nascimento

One of the most important primitives in two-party distrustful cryptography is oblivious transfer, a complete primitive for two-party computation. Recently introduced, the oblivious transfer capacity of a noisy channel measures an efficiency of information theoretical reductions from 1-out-of-k, l-string oblivious transfer to noisy channels. It is defined as the maximal achievable ratio l/n, where l is the length of the strings which are to be transferred and n is the number of times the noisy channel is invoked. This quantity is unknown in a general case. For discrete memoryless channels, it is known to be nonnegligible for honest-but-curious players, but the non-zero rates have not ever been proved achievable in the case of malicious players. Here, we show that in the particular case of the erasure channel, more precise answers can be obtained. We compute the OT capacity of the erasure channel for the case of honest-but-curious players and, for the fully malicious players, we give its lower bound.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2006•36 citations

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

Hadi Aghaee, Christian Deppe, Holger Boche

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.

arXiv:2602.03421•Feb 3, 2026•0 citations

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

Hadi Aghaee, Christian Deppe, Holger Boche

We investigate the feasibility of oblivious transfer over discrete memoryless multiple-access channels assisted by tripartite non-signaling correlations among honest-but-curious parties. Modeling the shared resource as an arbitrary non-signaling box provides a unified framework encompassing both channel behavior and induced correlations, including quantum and super-quantum resources. Our main result establishes an impossibility: oblivious transfer cannot be achieved, as any nontrivial non-signaling correlation used as resources inevitably causes receiver’s observation to depend on both senders’ inputs, violating sender-privacy. Consequently, no tripartite non-signaling assistance, including entanglement or PR-box–type correlations, can enable or enhance network oblivious transfer over noisy multiple-access channels.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2026•0 citations

Oblivious Transfer over Discrete Memoryless Broadcast Channels

Hadi Aghaee, Christian Deppe, Holger Boche

We study the oblivious transfer capacity of discrete memoryless broadcast channels with one sender and two receivers. Both non-colluding and colluding receiver cases are analyzed. We derive general outer bounds on the OT capacity region and propose a secure OT protocol resilient to collusion. These results generalize prior findings on specific channels, such as binary erasure broadcast channels, and reveal fundamental insights into how channel noise enables information-theoretic security.

International Conference on Communications•May 24, 2026•1 citation

Quantum-State Oblivious Transfer over Quantum Erasure Channels

Remi A. Chou

We study quantum-state oblivious transfer over the quantum erasure channel under information-theoretic security guarantees. Specifically, Alice holds two quantum systems, Bob wishes to recover one of them, and the parties have access to independent channel uses and authenticated public classical communication, with no initial shared entanglement. We consider both honest-but-curious and malicious behavior. We establish finite-blocklength converse and achievability bounds, which match in the honest-but-curious setting. The malicious setting construction combines interactive hashing with tests of whether Bob received selected channel outputs, and distributes each input across several qubits so that erasures conceal an entire input from a dishonest receiver, even when the inputs are entangled with an external reference. We also derive fixed-error asymptotic expansions and show that both malicious and honest-but-curious settings have the same capacity.

quant-pharXiv:2610.04667•Oct 6, 2026•0 citations
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.
Information-theoretical limits of oblivious transfer are studied. First, we explore the feasibility and constraints of implementing oblivious transfer protocols over some communication channels, with a focus on noisy point-to-point and multiple-access channels with non-colluding parties. The paper also examines secure multiparty communication, and highlighting the challenges of achieving oblivious transfer under information-theoretic security models. As an example, the limits of oblivious transfer over a two-user multiple access channel are studied.
One of the most important primitives in two-party distrustful cryptography is oblivious transfer, a complete primitive for two-party computation. Recently introduced, the oblivious transfer capacity of a noisy channel measures an efficiency of information theoretical reductions from 1-out-of-k, l-string oblivious transfer to noisy channels. It is defined as the maximal achievable ratio l/n, where l is the length of the strings which are to be transferred and n is the number of times the noisy channel is invoked. This quantity is unknown in a general case. For discrete memoryless channels, it is known to be nonnegligible for honest-but-curious players, but the non-zero rates have not ever been proved achievable in the case of malicious players. Here, we show that in the particular case of the erasure channel, more precise answers can be obtained. We compute the OT capacity of the erasure channel for the case of honest-but-curious players and, for the fully malicious players, we give its lower bound.
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.
We investigate the feasibility of oblivious transfer over discrete memoryless multiple-access channels assisted by tripartite non-signaling correlations among honest-but-curious parties. Modeling the shared resource as an arbitrary non-signaling box provides a unified framework encompassing both channel behavior and induced correlations, including quantum and super-quantum resources. Our main result establishes an impossibility: oblivious transfer cannot be achieved, as any nontrivial non-signaling correlation used as resources inevitably causes receiver’s observation to depend on both senders’ inputs, violating sender-privacy. Consequently, no tripartite non-signaling assistance, including entanglement or PR-box–type correlations, can enable or enhance network oblivious transfer over noisy multiple-access channels.
We study quantum-state oblivious transfer over the quantum erasure channel under information-theoretic security guarantees. Specifically, Alice holds two quantum systems, Bob wishes to recover one of them, and the parties have access to independent channel uses and authenticated public classical communication, with no initial shared entanglement. We consider both honest-but-curious and malicious behavior. We establish finite-blocklength converse and achievability bounds, which match in the honest-but-curious setting. The malicious setting construction combines interactive hashing with tests of whether Bob received selected channel outputs, and distributes each input across several qubits so that erasures conceal an entire input from a dishonest receiver, even when the inputs are entangled with an external reference. We also derive fixed-error asymptotic expansions and show that both malicious and honest-but-curious settings have the same capacity.