Sciweavers

IWSEC
2009
Springer

Reducing Complexity Assumptions for Oblivious Transfer

14 years 26 days ago
Reducing Complexity Assumptions for Oblivious Transfer
Reducing the minimum assumptions needed to construct various cryptographic primitives is an important and interesting task in theoretical cryptography. Oblivious Transfer, one of the most basic cryptographic building blocks, is also studied under this scenario. Reducing the minimum assumptions for Oblivious Transfer seems not an easy task, as there are a few impossibility results under black-box reductions. Until recently, it is widely believed that Oblivious Transfer can be constructed with trapdoor permutations but not trapdoor functions in general. In this paper, we enhance previous results and show one Oblivious Transfer protocol based on a collection of trapdoor functions with some extra properties. We also provide reasons for adding the extra properties and argue that the assumptions in the protocol are nearly minimum.
K. Y. Cheong, Takeshi Koshiba
Added 27 May 2010
Updated 27 May 2010
Type Conference
Year 2009
Where IWSEC
Authors K. Y. Cheong, Takeshi Koshiba
Comments (0)