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 Communications

Oblivious Transfer over Discrete Memoryless Broadcast Channels

Hadi Aghaee, Christian Deppe, Holger Boche

Published May 24, 2026• 1 citation
Publisher

Abstract

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.

DOI
10.1109/icc59461.2026.11587767

Related papers

The oblivious transfer capacity of the wiretapped binary erasure channel

Manoj Mishra, Bikash Kumar Dey, Vinod M. Prabhakaran +1 more

We consider oblivious transfer between Alice and Bob in the presence of an eavesdropper Eve when there is a broadcast channel from Alice to Bob and Eve. In addition to the secrecy constraints of Alice and Bob, Eve should not learn the private data of Alice and Bob. When the broadcast channel consists of two independent binary erasure channels, we derive the oblivious transfer capacity for both 2-privacy (where the eavesdropper may collude with either party) and 1-privacy (where there are no collusions).

arXiv:1404.6614•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2014•14 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 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

Semi-deterministic Broadcast Channel With Side Information: A Secrecy Capacity Outer Bound

Saeid Pakravan, Ghosheh Abed Hodtani

In this study, we obtain an outer bound on the secrecy capacity region of a two-user semi-deterministic discrete memoryless broadcast channel with considering side-information available at the transmitter, where, the sender contain two independent confidential messages, each one is deliberated for one of the receivers but is kept entirely secret from the other. Further, we compare obtained outer bound via the specified secrecy capacity outer bound of the semi-deterministic broadcast channel without side information and without secrecy constraint; specifically, the side information impact on the outer bound is explained.

International Conference on Computer and Knowledge Engineering•Oct 29, 2020•2 citations

On the oblivious transfer capacity region of the binary erasure broadcast channel

Manoj Mishra, Bikash Kumar Dey, Vinod M. Prabhakaran +1 more

We study oblivious transfer (OT) using a binary erasure broadcast channel from Alice to Bob and Charlie. Alice wants to establish independent OTs with Bob and Charlie with 2-privacy, i.e., where secrecy needs to be maintained even against pairs of parties in addition to against parties working on their own. We give an achievable rate-region in the honest-but-curious setting and show its optimality for a range of erasure probabilities.

IEEE Information Theory Workshop (ITW)•Nov 1, 2014•6 citations

Wiretapped Oblivious Transfer

Manoj Mishra, Bikash Kumar Dey, Vinod M. Prabhakaran +1 more

In this paper, we study the problem of obtaining 1-of-2 string oblivious transfer (OT) between users Alice and Bob, in the presence of a passive eavesdropper Eve. The resource enabling OT in our setup is a noisy broadcast channel from Alice to Bob and Eve. Apart from the OT requirements between the users, Eve is not allowed to learn anything about the users' inputs. When Alice and Bob are honest-but-curious and the noisy broadcast channel is made up of two independent binary erasure channels (connecting Alice-Bob and Alice-Eve), we derive the 1-of-2 string OT capacity for both 2-privacy (when Eve can collude with either Alice or Bob) and 1-privacy (when no such collusion is allowed). We generalize these capacity results to 1-of-N string OT and study other variants of this problem. When Alice and/or Bob are malicious, we present a different scheme based on interactive hashing. This scheme is shown to be optimal for certain parameter regimes. We present a new formulation of multiple, simultaneous OTs between Alice-Bob and Alice-Cathy. For this new setup, we present schemes and outer bounds that match in all but one regime of parameters. Finally, we consider the setup where the broadcast channel is made up of a cascade of two independent binary erasure channels (connecting Alice-Bob and Bob-Eve) and 1-of-2 string OT is desired between Alice and Bob with 1-privacy. For this setup, we derive an upper and lower bound on the 1-of-2 string OT capacity which match in one of two possible parameter regimes.

arXiv:1604.05668•IEEE Transactions on Information Theory•Jan 17, 2017•7 citations
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.
We consider oblivious transfer between Alice and Bob in the presence of an eavesdropper Eve when there is a broadcast channel from Alice to Bob and Eve. In addition to the secrecy constraints of Alice and Bob, Eve should not learn the private data of Alice and Bob. When the broadcast channel consists of two independent binary erasure channels, we derive the oblivious transfer capacity for both 2-privacy (where the eavesdropper may collude with either party) and 1-privacy (where there are no collusions).
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.
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.
In this study, we obtain an outer bound on the secrecy capacity region of a two-user semi-deterministic discrete memoryless broadcast channel with considering side-information available at the transmitter, where, the sender contain two independent confidential messages, each one is deliberated for one of the receivers but is kept entirely secret from the other. Further, we compare obtained outer bound via the specified secrecy capacity outer bound of the semi-deterministic broadcast channel without side information and without secrecy constraint; specifically, the side information impact on the outer bound is explained.
In this paper, we study the problem of obtaining 1-of-2 string oblivious transfer (OT) between users Alice and Bob, in the presence of a passive eavesdropper Eve. The resource enabling OT in our setup is a noisy broadcast channel from Alice to Bob and Eve. Apart from the OT requirements between the users, Eve is not allowed to learn anything about the users' inputs. When Alice and Bob are honest-but-curious and the noisy broadcast channel is made up of two independent binary erasure channels (connecting Alice-Bob and Alice-Eve), we derive the 1-of-2 string OT capacity for both 2-privacy (when Eve can collude with either Alice or Bob) and 1-privacy (when no such collusion is allowed). We generalize these capacity results to 1-of-N string OT and study other variants of this problem. When Alice and/or Bob are malicious, we present a different scheme based on interactive hashing. This scheme is shown to be optimal for certain parameter regimes. We present a new formulation of multiple, simultaneous OTs between Alice-Bob and Alice-Cathy. For this new setup, we present schemes and outer bounds that match in all but one regime of parameters. Finally, we consider the setup where the broadcast channel is made up of a cascade of two independent binary erasure channels (connecting Alice-Bob and Bob-Eve) and 1-of-2 string OT is desired between Alice and Bob with 1-privacy. For this setup, we derive an upper and lower bound on the 1-of-2 string OT capacity which match in one of two possible parameter regimes.