A combinatorial approach to deriving lower bounds for perfectly secure oblivious transfer reductions

Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Consider the scenario where we are given an ideal functionality of oblivious transfer (OT), and we wish to construct a larger OT by invoking the above functionality as a black box. How many invocations of an ideal OT functionality are necessary? In tackling this problem, some lower bounds were derived using entropy previously. In this paper, we manage to achieve tighter lower bounds by employing a combinatorial approach. This new approach yields lower bounds which are two times larger than the existing bounds.

Original languageEnglish
Pages (from-to)2566-2571
Number of pages6
JournalIEEE Transactions on Information Theory
Volume54
Issue number6
DOIs
Publication statusPublished - 2008 Jun 1
Externally publishedYes

Keywords

  • Combinatorial approach
  • Lower bound
  • Oblivious transfer
  • Reduction

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'A combinatorial approach to deriving lower bounds for perfectly secure oblivious transfer reductions'. Together they form a unique fingerprint.

  • Cite this