Simple direct reduction of string (1,2)-OT to Rabin's OT without privacy amplification

Kaoru Kurosawa*, Takeshi Koshiba

*この研究の対応する著者

研究成果: Conference contribution

抄録

It is known that string (1,2)-OT and Rabin's OT are equivalent. Actually, there have been many reductions between them. Many of them use the privacy amplification technique as a basic tool. The privacy amplification technique essentially involves some post-processing of sending random objects (e.g., random indices of pairwise independent hash functions) per each invocation of Rabin's OT is necessary. In this paper, we show a simple direct reduction of string (1,2)-OT to Rabin's OT by using a deterministic randomness extractor for bit-fixing sources. Our reduction can be realized without privacy amplification and thus our protocol is simpler and more efficient with respect to the communication complexity than the previous reductions.

本文言語English
ホスト出版物のタイトルInformation Theoretic Security - Third International Conference, ICITS 2008, Proceedings
ページ199-209
ページ数11
DOI
出版ステータスPublished - 2008 10 27
外部発表はい
イベント3rd International Conference on Information Theoretic Security, ICITS 2008 - Calgary, AB, Canada
継続期間: 2008 8 102008 8 13

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5155 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other3rd International Conference on Information Theoretic Security, ICITS 2008
国/地域Canada
CityCalgary, AB
Period08/8/1008/8/13

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Simple direct reduction of string (1,2)-OT to Rabin's OT without privacy amplification」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル