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

IEEE International Symposium on Information Theory (ISIT)

Capacity of K-out-of-N Oblivious Transfer over the Binary Erasure Channel

Amirhossein Shekofteh, Rémi A. Chou

Published Jun 1, 2026• 1 citation
Publisher

Abstract

We study K-out-of-N oblivious transfer (OT) over a binary erasure channel (BEC) and a public noiseless channel, under an honest-but-curious model. In this setting, a client retrieves K out of N messages stored by a server; the protocol must guarantee that the unselected messages remain private to the server and that the client’s choices remain hidden from the server. We show that the K-out-of-N OT capacity over a BEC with erasure probability ϵ is $C = \min \left({\frac{{K\varepsilon }}{{N - K}},1 - \varepsilon }\right).$ This characterization recovers the known capacity for 1-out-of-2 OT and, for 1-out-of-N OT, recovers the established capacity when $\frac{{N - 1}}{N} \leq \varepsilon $ while further establishing the capacity for all ϵ ∈ [0,1]. We also show that the naive K-out-of-N OT construction obtained by repeating an optimal 1-out-of-N OT protocol K times is suboptimal.

DOI
10.1109/isit62367.2026.11653775

Related papers

Oblivious Transfer Over Compound Binary Erasure Channels

Anuj Kumar Yadav, Preetam Kumar

Oblivious Transfer (OT) is a broadly studied cryptographic primitive which involves two mutually distrustful users who wish to interact with each other in order to transfer messages in an oblivious manner. Noise is an important resource to realize information-theoretically secure cryptographic protocols including oblivious transfer. However, oftentimes these noisy channels may be poorly characterized and the complete channel characteristics might be unknown to both users. Such channels are studied in the literature through the lens of compound channels. We study 1-out-of-2 oblivious transfer over a compound binary erasure channel (compound-BEC) and characterize the oblivious transfer capacity of compound-BEC. Our OT capacity characterization involves a general alphabet compound-DMC converse, subsequently specialized to compound-BEC along with an optimal and computationally-efficient achievability scheme for honest-but-curious users.

IEEE Communications Letters•Mar 3, 2022•2 citations

Private Set Intersection Using a Binary Erasure Channel

Amirhossein Shekofteh, Rémi A. Chou

We consider a Private Set Intersection (PSI) problem, where a server holds an arbitrary number of private subsets and a client holds a private subset of size K over a universe of size N. The client wants to compute the intersection of its set with each private subset of the server, learning only these intersections, while the server learns nothing about the client’s private set. The server controls the input of a binary erasure channel (BEC) with parameter ϵ, whose output is observed by the client, and both client and server can communicate over a noiseless channel. We define the PSI rate as the ratio of the number of server subsets to the number of BEC uses and characterize the information-theoretic PSI capacity as ${C_{{\text{PSI}}}} = \min \left( {\frac{\varepsilon }{{N - K}},\frac{{1 - \varepsilon }}{K}} \right)$. Our result is obtained by reducing the PSI problem to a K-out-of-N oblivious transfer problem and proving that this reduction is optimal.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2026•0 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

An Improved Lower Bound on Oblivious Transfer Capacity via Interactive Erasure Emulation

So Suda, Shun Watanabe, Haruya Yamaguchi

We revisit the oblivious transfer (OT) capacities of noisy channels against the passive adversary, which have been identified only for a limited class of channels. In the literature, the general construction of oblivious transfer has been known only for generalized erasure channels (GECs); for other channels, we first convert a given channel to a GEC via alphabet extension and erasure emulation, and then apply the general construction for GEC. In this paper, we derive an improved lower bound on the OT capacity of the binary symmetric channel (BSC) and binary symmetric erasure channel (BSEC) by proposing a new protocol; by using interactive communication between the sender and the receiver, our protocol emulates erasure events recursively in multiple rounds. We also discuss a potential necessity of multiple rounds interactive communication to attain the OT capacity.

arXiv:2401.14965•IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•4 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

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
We study K-out-of-N oblivious transfer (OT) over a binary erasure channel (BEC) and a public noiseless channel, under an honest-but-curious model. In this setting, a client retrieves K out of N messages stored by a server; the protocol must guarantee that the unselected messages remain private to the server and that the client’s choices remain hidden from the server. We show that the K-out-of-N OT capacity over a BEC with erasure probability ϵ is C=min⁡(KεN−K,1−ε).C = \min \left({\frac{{K\varepsilon }}{{N - K}},1 - \varepsilon }\right).C=min(N−KKε​,1−ε). This characterization recovers the known capacity for 1-out-of-2 OT and, for 1-out-of-N OT, recovers the established capacity when N−1N≤ε\frac{{N - 1}}{N} \leq \varepsilon NN−1​≤ε while further establishing the capacity for all ϵ ∈ [0,1]. We also show that the naive K-out-of-N OT construction obtained by repeating an optimal 1-out-of-N OT protocol K times is suboptimal.
Oblivious Transfer (OT) is a broadly studied cryptographic primitive which involves two mutually distrustful users who wish to interact with each other in order to transfer messages in an oblivious manner. Noise is an important resource to realize information-theoretically secure cryptographic protocols including oblivious transfer. However, oftentimes these noisy channels may be poorly characterized and the complete channel characteristics might be unknown to both users. Such channels are studied in the literature through the lens of compound channels. We study 1-out-of-2 oblivious transfer over a compound binary erasure channel (compound-BEC) and characterize the oblivious transfer capacity of compound-BEC. Our OT capacity characterization involves a general alphabet compound-DMC converse, subsequently specialized to compound-BEC along with an optimal and computationally-efficient achievability scheme for honest-but-curious users.
We consider a Private Set Intersection (PSI) problem, where a server holds an arbitrary number of private subsets and a client holds a private subset of size K over a universe of size N. The client wants to compute the intersection of its set with each private subset of the server, learning only these intersections, while the server learns nothing about the client’s private set. The server controls the input of a binary erasure channel (BEC) with parameter ϵ, whose output is observed by the client, and both client and server can communicate over a noiseless channel. We define the PSI rate as the ratio of the number of server subsets to the number of BEC uses and characterize the information-theoretic PSI capacity as CPSI=min⁡(εN−K,1−εK){C_{{\text{PSI}}}} = \min \left( {\frac{\varepsilon }{{N - K}},\frac{{1 - \varepsilon }}{K}} \right)CPSI​=min(N−Kε​,K1−ε​). Our result is obtained by reducing the PSI problem to a K-out-of-N oblivious transfer problem and proving that this reduction is optimal.
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.
We revisit the oblivious transfer (OT) capacities of noisy channels against the passive adversary, which have been identified only for a limited class of channels. In the literature, the general construction of oblivious transfer has been known only for generalized erasure channels (GECs); for other channels, we first convert a given channel to a GEC via alphabet extension and erasure emulation, and then apply the general construction for GEC. In this paper, we derive an improved lower bound on the OT capacity of the binary symmetric channel (BSC) and binary symmetric erasure channel (BSEC) by proposing a new protocol; by using interactive communication between the sender and the receiver, our protocol emulates erasure events recursively in multiple rounds. We also discuss a potential necessity of multiple rounds interactive communication to attain the OT capacity.
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.