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
5155 LNCS
DOI
出版物ステータスPublished - 2008
外部発表Yes
イベント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
Calgary, AB
期間08/8/1008/8/13

Fingerprint

Amplification
Privacy
Strings
Randomness Extractors
Hash functions
Communication Complexity
Hash Function
Post-processing
Pairwise
Necessary
Communication
Processing

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

これを引用

Kurosawa, K., & Koshiba, T. (2008). Simple direct reduction of string (1,2)-OT to Rabin's OT without privacy amplification. : Information Theoretic Security - Third International Conference, ICITS 2008, Proceedings (巻 5155 LNCS, pp. 199-209). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 5155 LNCS). https://doi.org/10.1007/978-3-540-85093-9_19

Simple direct reduction of string (1,2)-OT to Rabin's OT without privacy amplification. / Kurosawa, Kaoru; Koshiba, Takeshi.

Information Theoretic Security - Third International Conference, ICITS 2008, Proceedings. 巻 5155 LNCS 2008. p. 199-209 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻 5155 LNCS).

研究成果: Conference contribution

Kurosawa, K & Koshiba, T 2008, Simple direct reduction of string (1,2)-OT to Rabin's OT without privacy amplification. : Information Theoretic Security - Third International Conference, ICITS 2008, Proceedings. 巻. 5155 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 巻. 5155 LNCS, pp. 199-209, 3rd International Conference on Information Theoretic Security, ICITS 2008, Calgary, AB, Canada, 08/8/10. https://doi.org/10.1007/978-3-540-85093-9_19
Kurosawa K, Koshiba T. Simple direct reduction of string (1,2)-OT to Rabin's OT without privacy amplification. : Information Theoretic Security - Third International Conference, ICITS 2008, Proceedings. 巻 5155 LNCS. 2008. p. 199-209. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-85093-9_19
Kurosawa, Kaoru ; Koshiba, Takeshi. / Simple direct reduction of string (1,2)-OT to Rabin's OT without privacy amplification. Information Theoretic Security - Third International Conference, ICITS 2008, Proceedings. 巻 5155 LNCS 2008. pp. 199-209 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{a82df702efd842788f32b5c8f2b12668,
title = "Simple direct reduction of string (1,2)-OT to Rabin's OT without privacy amplification",
abstract = "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.",
keywords = "Deterministic randomness extractor, Oblivious transfer, Privacy amplification, Reduction",
author = "Kaoru Kurosawa and Takeshi Koshiba",
year = "2008",
doi = "10.1007/978-3-540-85093-9_19",
language = "English",
isbn = "3540850929",
volume = "5155 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "199--209",
booktitle = "Information Theoretic Security - Third International Conference, ICITS 2008, Proceedings",

}

TY - GEN

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

AU - Kurosawa, Kaoru

AU - Koshiba, Takeshi

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Deterministic randomness extractor

KW - Oblivious transfer

KW - Privacy amplification

KW - Reduction

UR - http://www.scopus.com/inward/record.url?scp=54249091238&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=54249091238&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-85093-9_19

DO - 10.1007/978-3-540-85093-9_19

M3 - Conference contribution

AN - SCOPUS:54249091238

SN - 3540850929

SN - 9783540850922

VL - 5155 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 199

EP - 209

BT - Information Theoretic Security - Third International Conference, ICITS 2008, Proceedings

ER -