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 Information Theory Workshop (ITW)

On oblivious transfer capacity

Rudolf Ahlswede, Imre Csiszár

Published Jun 1, 2009• 7 citations
Publisher

Abstract

The concept of oblivious transfer capacity has been introduced by Nascimento and Winter, ISIT06. Its value has been determined for certain models, and bounds to it were given for other models, in the present authors' ISIT07 contribution. This talk is based on the latter work. The tools include known results on secrecy capacity of simple source and channel models.

DOI
10.1109/itwnit.2009.5158528

Related papers

On Oblivious Transfer Capacity

Rudolf Ahlswede, Imre Csiszár

The concept of oblivious transfer capacity has been recently introduced by Nascimento and Winter. We give an upper bound to this capacity, both for source and channel models, and prove that it is tight for a class of channels. For other cases, lower bounds are provided. The tools include known results on secrecy capacity of simple source and channel models.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•30 citations

On the Oblivious-Transfer Capacity of Noisy Resources

Anderson C. A. Nascimento, Andreas Winter

In this paper, we deal with the task of obtaining oblivious transfer (OT) from noisy resources. We characterize which noisy channels/distributions are useful for obtaining OT. We also introduce the problem of computing the oblivious-transfer capacity of a noisy resource, which measures the optimal way of implementing OT 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 Transactions on Information Theory•May 29, 2008•67 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

On ObliviousTransfer Capacity

Rudolf Ahlswede

Theconcept ofoblivious transfer capacity hasbeen recently introduced byNascimento andWinter. Wegive anupper boundtothis capacity, bothforsource andchannel models, and provethatitistight fora class ofchannels. Forothercases, lowerboundsareprovided. Thetools include knownresults on secrecy capacity ofsimple source andchannel models.

•Jan 1, 2007•0 citations

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

A new upperbound for the oblivious transfer capacity of discrete memoryless channels

K. Sankeerth Rao, Vinod M. Prabhakaran

We derive a new upper bound on the string oblivious transfer capacity of discrete memoryless channels (DMCs). The main tool we use is the tension region of a pair of random variables introduced in Prabhakaran and Prabhakaran (2014) where it was used to derive upper bounds on rates of secure sampling in the source model. In this paper, we consider secure computation of string oblivious transfer in the channel model. Our bound is based on a monotonicity property of the tension region in the channel model. We show that our bound strictly improves upon the upper bound of Ahlswede and Csiszár (2013).

arXiv:1405.2049•IEEE Information Theory Workshop (ITW)•Nov 1, 2014•9 citations
The concept of oblivious transfer capacity has been introduced by Nascimento and Winter, ISIT06. Its value has been determined for certain models, and bounds to it were given for other models, in the present authors' ISIT07 contribution. This talk is based on the latter work. The tools include known results on secrecy capacity of simple source and channel models.
In this paper, we deal with the task of obtaining oblivious transfer (OT) from noisy resources. We characterize which noisy channels/distributions are useful for obtaining OT. We also introduce the problem of computing the oblivious-transfer capacity of a noisy resource, which measures the optimal way of implementing OT 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.
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.
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).
We derive a new upper bound on the string oblivious transfer capacity of discrete memoryless channels (DMCs). The main tool we use is the tension region of a pair of random variables introduced in Prabhakaran and Prabhakaran (2014) where it was used to derive upper bounds on rates of secure sampling in the source model. In this paper, we consider secure computation of string oblivious transfer in the channel model. Our bound is based on a monotonicity property of the tension region in the channel model. We show that our bound strictly improves upon the upper bound of Ahlswede and Csiszár (2013).