Reducing complexity assumptions for oblivious transfer

K. Y. Cheong, Takeshi Koshiba

研究成果: Conference contribution


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, could be 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. Goldreich pointed out some flaw in the folklore and introduced some enhancement to cope with the flaw. Haitner then revised the enhancement more properly. As a consequence they showed that some additional properties for trapdoor permutations are necessary to construct oblivious transfers. In this paper, we discuss possibilities of basing not on trapdoor permutations but on trapdoor functions in general. We generalize previous results and give an oblivious transfer protocol based on a collection of trapdoor functions with some extra properties with respect to the length-expansion and the pre-image size. We discuss that our reduced assumption is almost minimal and show the necessity for the extra properties.

ホスト出版物のタイトルAdvances in Information and Computer Security - 4th International Workshop on Security, IWSEC 2009, Proceedings
出版ステータスPublished - 2009 12 1
イベント4th International Workshop on Security, IWSEC 2009 - Toyama, Japan
継続期間: 2009 10 282009 10 30


名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5824 LNCS


Other4th International Workshop on Security, IWSEC 2009

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Reducing complexity assumptions for oblivious transfer」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。