Generalized Oblivious Transfer Protocols Based on Noisy Channels
Generalized Oblivious Transfer Protocols Based on Noisy Channels
复制标题
基于噪声通道的广义不经意传输协议
DOI：
--
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
Kirill Morozov
中科院分区：
文献类型：
--
作者：
V. Korjik;Kirill Morozov
基于噪声通道的主要加密原语（比特承诺 (BC) 和不经意传输 (OT) 协议）已在 [1] 中针对渐近情况进行了考虑。 BC 协议的非渐近行为已在[2]中得到证明。当前的论文为二进制对称信道（BSC）提供了更严格的渐近条件，使其成为[1]中提出的可行的OT协议。我们还使用需要重新获得 Renyi 熵公式的不同编码和解码方法来推广该协议。还提出了非渐近情况（各方之间传输的块的有限长度）。给出了一些例子来证明这些协议实际上是可靠的并且信息理论上是安全的。我们还讨论了如何将(2 1)-OT协议扩展为(L 1)-OT协议以及如何安排BSC连接方的问题。 BC 和 OT 协议都可以用作更复杂、更重要的实践协议的组件，例如“数字现金”、“安全选举”或“距离限制”。
The main cryptographic primitives (Bit Commitment (BC) and Oblivious Transfer (OT) protocols) based on noisy channels have been considered in [1] for asymptotic case. Non-asymptotic behavior of BC protocol has been demonstrated in [2]. The current paper provides stricter asymptotic conditions on Binary Symmetric Channel (BSC) to be feasible OT protocol proposed in [1]. We also generalize this protocol using different encoding and decoding methods that require to regain formulas for Renyi entropy. Nonasymptotic case (finite length of blocks transmitted between parties) is also presented. Some examples are given to demonstrate that these protocols are in fact reliable and information-theoretically secure. We also discuss the problem - how to extend (2 1)-OT protocol to (L 1)-OT protocol and how to arrange BSC connecting parties. Both BC and OT protocols can be used as components of more complex and more important for practice protocols like "Digital cash", "Secure election" or "Distance bounding".