A New Upperbound for the Oblivious Transfer Capacity of Discrete Memoryless Channels
This work addresses a fundamental problem in secure communication and cryptography, specifically for researchers in information theory and secure computation, but it is incremental as it builds on existing methods to refine bounds.
The paper tackles the problem of deriving an upper bound on the string oblivious transfer capacity of discrete memoryless channels, resulting in a new bound that strictly improves upon a previous upper bound from 2013.
We derive a new upper bound on the string oblivious transfer capacity of discrete memoryless channels. 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).