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

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

Hadi Aghaee, Christian Deppe, Holger Boche

Published Feb 3, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2602.03421

Related papers

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

Network Oblivious Transfer via Noisy Channels: Limits and Capacities

Hadi Aghaee, Akhbari, Bahareh, Deppe, Christian

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.

arXiv:2501.17021•Jan 28, 2025•4 citations

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

Oblivious Transfer Over Wireless Channels

Jithin Ravi, Bikash Kumar Dey, Emanuele Viterbo

We consider the problem of oblivious transfer (OT) over OFDM and MIMO wireless communication systems where only the receiver knows the channel state information. The sender and receiver also have unlimited access to a noise-free real channel. Using a physical layer approach, based on the properties of the noisy fading channel, we propose a scheme for honest-but-curious parties that enables the transmitter to send obliviously one-of-two files, i.e., without knowing which one has been actually requested by the receiver, while also ensuring that the receiver does not get any information about the other file.

arXiv:1508.00664•IEEE Transactions on Communications•Jan 8, 2016•3 citations

Unconditional secure cooperation on real-world networks : the case of oblivious transfer

Paolo Palmieri

Historically, cryptography was created and used to deliver messages between people in such a way that only the intended receiver would be able to read them. The two persons communicating trusted each other, but not the rest of the world - for instance, not the message bearer. But what happens if we assume instead that even the receiver of a message may not be trusted by the sender, while both still have an interest in communicating? This problem is addressed by secure multi-party computation, that studies communication and shared computation between mutually distrusting parties. In a world where most of the communication happens over the Internet, and where an ever-increasing amount of computation is outsourced, for example to the cloud, multi-party computation is a subject of crucial importance. However, unconditionally secure multi-party protocols have never found practical application: the lack of realistic noisy channel models, that are required to achieve security against computationally unbounded adversaries, prevents implementation over real-world, standard communication protocols.\n\nIn this thesis, we study the properties and characteristics of noisy channels, and we introduce new models based on real-world error sources that have never been studied in this context, such as delays. On the contrary, previous works mostly focused on theoretical noisy channels that have little in common with the reality of network communication. We show that the models we propose are suitable for multi-party computation by building on each of them a protocol for oblivious transfer, a fundamental cryptographic primitive that implies any secure computation. Thanks to the realism of our noisy channels, we are able to provide the first working implementation of unconditionally secure oblivious transfer over both wired and wireless networks and different Internet protocols, which we test thoroughly in an extensive set of experiments. Our constructions are not only more realistic, but also more flexible, as they allow larger ranges of error probabilities. This will eventually open the way for the widespread use of unconditionally secure multi-party computation.

•Jan 1, 2013•0 citations

On the Oblivious Transfer Capacity of Noisy Correlations

Anderson C. A. Nascimento, Andreas Winter

We deal with the task of obtaining oblivious transfer from noisy resources. We characterize which noisy channels/distributions are useful for obtaining oblivious transfer. We also introduce the problem of computing the oblivious transfer capacity of a noisy resource, which measures the optimal way of implementing oblivious transfer from a noisy channel/distribution. We show that for honest but curious sender, the oblivious transfer capacity of noisy resources is strictly positive. Several open questions are raised.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2006•45 citations
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.
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.
We consider the problem of oblivious transfer (OT) over OFDM and MIMO wireless communication systems where only the receiver knows the channel state information. The sender and receiver also have unlimited access to a noise-free real channel. Using a physical layer approach, based on the properties of the noisy fading channel, we propose a scheme for honest-but-curious parties that enables the transmitter to send obliviously one-of-two files, i.e., without knowing which one has been actually requested by the receiver, while also ensuring that the receiver does not get any information about the other file.
Historically, cryptography was created and used to deliver messages between people in such a way that only the intended receiver would be able to read them. The two persons communicating trusted each other, but not the rest of the world - for instance, not the message bearer. But what happens if we assume instead that even the receiver of a message may not be trusted by the sender, while both still have an interest in communicating? This problem is addressed by secure multi-party computation, that studies communication and shared computation between mutually distrusting parties. In a world where most of the communication happens over the Internet, and where an ever-increasing amount of computation is outsourced, for example to the cloud, multi-party computation is a subject of crucial importance. However, unconditionally secure multi-party protocols have never found practical application: the lack of realistic noisy channel models, that are required to achieve security against computationally unbounded adversaries, prevents implementation over real-world, standard communication protocols.\n\nIn this thesis, we study the properties and characteristics of noisy channels, and we introduce new models based on real-world error sources that have never been studied in this context, such as delays. On the contrary, previous works mostly focused on theoretical noisy channels that have little in common with the reality of network communication. We show that the models we propose are suitable for multi-party computation by building on each of them a protocol for oblivious transfer, a fundamental cryptographic primitive that implies any secure computation. Thanks to the realism of our noisy channels, we are able to provide the first working implementation of unconditionally secure oblivious transfer over both wired and wireless networks and different Internet protocols, which we test thoroughly in an extensive set of experiments. Our constructions are not only more realistic, but also more flexible, as they allow larger ranges of error probabilities. This will eventually open the way for the widespread use of unconditionally secure multi-party computation.
We deal with the task of obtaining oblivious transfer from noisy resources. We characterize which noisy channels/distributions are useful for obtaining oblivious transfer. We also introduce the problem of computing the oblivious transfer capacity of a noisy resource, which measures the optimal way of implementing oblivious transfer from a noisy channel/distribution. We show that for honest but curious sender, the oblivious transfer capacity of noisy resources is strictly positive. Several open questions are raised.