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

Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba

研究成果: Article査読

4 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)2566-2571
ページ数6
ジャーナルIEEE Transactions on Information Theory
54
6
DOI
出版ステータスPublished - 2008 6 1
外部発表はい

ASJC Scopus subject areas

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

フィンガープリント 「A combinatorial approach to deriving lower bounds for perfectly secure oblivious transfer reductions」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル