Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations
Implementing Oblivious Transfer Using Collection of Dense Trapdoor Permutations
复制标题
使用密集陷门排列集合实现不经意传输
DOI：
10.1007/978-3-540-24638-1_22
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
Iftach Haitner
中科院分区：
文献类型：
--
作者：
Iftach Haitner
直到最近，陷门排列集合（TDP）的存在被认为（并声称）暗示了几乎所有主要的加密原语，包括公钥加密（PKE），不经意传输（OT）和非交互式零知识（NIZK）。然而，最近意识到，为了使基于TDP的OT的安全性证明通过，需要稍微加强通常接受的TDP的一般定义。我们提出了一种基于密集陷门排列集合的不经意传输的实现。后者是陷门置换的集合，具有置换域在特定长度的所有字符串的集合中多项式稠密的性质。先前基于TDP的不经意传输的实现假设了（集合的）硬度假设的增强。
Until recently, the existence of collection of trapdoor permutations (TDP) was believed (and claimed) to imply almost all of the major cryptographic primitives, including public-key encryption (PKE), oblivious transfer (OT), and non-interactive zero-knowledge (NIZK). It was recently realized, however, that the commonly accepted general definition of TDP needs to be strengthened slightly in order to make the security proofs of TDP-based OT go through. We present an implementation of oblivious transfer based on collection of dense trapdoor permutations. The latter is a collection of trapdoor permutations, with the property that the permutation domains are polynomially dense in the set of all strings of a particular length. Previous TDP-based implementations of oblivious transfer assumed an enhancement of the hardness assumption (of the collection).