论文标题
窃听传输的容量结果
Capacity Results for the Wiretapped Oblivious Transfer
论文作者
论文摘要
在本文中，我们研究了Alice和Bob之间在被动窃听前夕的情况下，Alice和Bob之间的2组弦弦传递（OT）的问题。不允许Everopper前夕获得有关爱丽丝或鲍勃的私人数据的任何信息。当爱丽丝（Alice）和鲍勃（Bob）是诚实但热情的用户时，我们提出了一项协议，该协议满足$ 1美元的私有化（爱丽丝（Alice）和鲍勃（Bob）都与夏娃（Eve）同行）对二进制擦除对称性广播渠道的要求，在该频道中，该频道为鲍勃和eve提供了依赖的擦除模式。我们发现，当擦除概率满足某些条件时，窃听的OT容量符合的下限和上限满足。我们的结果概括并改善了Mishra等人对OT能力的结果。最后，我们为较大的窃听通道提出了一个协议，并在窃听的OT容量上得出了下限。
In this paper, we study the problem of the 1-of-2 string oblivious transfer (OT) between Alice and Bob in the presence of a passive eavesdropper Eve. The eavesdropper Eve is not allowed to get any information about the private data of Alice or Bob. When Alice and Bob are honest-but-curious users, we propose a protocol that satisfies $1$-private (neither Alice nor Bob colludes with Eve) OT requirements for the binary erasure symmetric broadcast channel, in which the channel provides dependent erasure patterns to Bob and Eve. We find that when the erasure probabilities satisfy certain conditions, the derived lower and upper bounds on the wiretapped OT capacity meet. Our results generalize and improve upon the results on wiretapped OT capacity by Mishra et al. Finally, we propose a protocol for a larger class of wiretapped channels and derive a lower bound on the wiretapped OT capacity.
