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

A new upperbound for the oblivious transfer capacity of discrete memoryless channels
复制标题

离散无记忆通道的不经意传输容量的新上限

DOI:
10.1109/itw.2014.6970787
复制
发表时间:
2014
期刊:
2014 IEEE Information Theory Workshop (ITW 2014)
影响因子:
--
通讯作者:
V. Prabhakaran
V. Prabhakaran
中科院分区:
--
文献类型:
--
作者:
K. Sankeerth Rao;V. Prabhakaran

文献摘要

被引文献

相似文献

本文给出了离散无记忆信道串不经意传输容量的一个新的上界。我们使用的主要工具是Prabhakaran和Prabhakaran(2014)中引入的一对随机变量的张力区域,它用于推导源模型中安全采样率的上限。本文研究了信道模型下字符串不经意传输的安全计算问题。我们的界限是基于在通道模型的张力区域的单调性。我们证明了我们的界严格改进了Ahlswede和Csiszár(2013)的上界。
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).