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

Kaoru Kurosawa; Takeshi Koshiba

doi:10.1007/978-3-540-85093-9_19

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

Kaoru Kurosawa^*, Takeshi Koshiba

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
Title of host publication	Information Theoretic Security - Third International Conference, ICITS 2008, Proceedings
Pages	199-209
Number of pages	11
DOIs	https://doi.org/10.1007/978-3-540-85093-9_19
Publication status	Published - 2008 Oct 27
Externally published	Yes
Event	3rd International Conference on Information Theoretic Security, ICITS 2008 - Calgary, AB, Canada Duration: 2008 Aug 10 → 2008 Aug 13

Publication series

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

Other

Other	3rd International Conference on Information Theoretic Security, ICITS 2008
Country/Territory	Canada
City	Calgary, AB
Period	08/8/10 → 08/8/13

Keywords

Deterministic randomness extractor
Oblivious transfer
Privacy amplification
Reduction

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

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

Cite this

Kurosawa, K., & Koshiba, T. (2008). Simple direct reduction of string (1,2)-OT to Rabin's OT without privacy amplification. In Information Theoretic Security - Third International Conference, ICITS 2008, Proceedings (pp. 199-209). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 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. 2008. p. 199-209 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5155 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Kurosawa, K & Koshiba, T 2008, Simple direct reduction of string (1,2)-OT to Rabin's OT without privacy amplification. in Information Theoretic Security - Third International Conference, ICITS 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 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. In Information Theoretic Security - Third International Conference, ICITS 2008, Proceedings. 2008. p. 199-209. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-85093-9_19

@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",

month = oct,

day = "27",

doi = "10.1007/978-3-540-85093-9_19",

language = "English",

isbn = "3540850929",

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",

note = "3rd International Conference on Information Theoretic Security, ICITS 2008 ; Conference date: 10-08-2008 Through 13-08-2008",

}

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/10/27

Y1 - 2008/10/27

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

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

T2 - 3rd International Conference on Information Theoretic Security, ICITS 2008

Y2 - 10 August 2008 through 13 August 2008

ER -

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

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this