Reducing complexity assumptions for oblivious transfer

K. Y. Cheong, Takeshi Koshiba

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationAdvances in Information and Computer Security - 4th International Workshop on Security, IWSEC 2009, Proceedings
Pages110-124
Number of pages15
DOIs
Publication statusPublished - 2009 Dec 1
Event4th International Workshop on Security, IWSEC 2009 - Toyama, Japan
Duration: 2009 Oct 282009 Oct 30

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5824 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Workshop on Security, IWSEC 2009
CountryJapan
CityToyama
Period09/10/2809/10/30

    Fingerprint

Keywords

  • oblivious transfer
  • trapdoor one-way functions

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Cheong, K. Y., & Koshiba, T. (2009). Reducing complexity assumptions for oblivious transfer. In Advances in Information and Computer Security - 4th International Workshop on Security, IWSEC 2009, Proceedings (pp. 110-124). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5824 LNCS). https://doi.org/10.1007/978-3-642-04846-3_8