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

Kaoru Kurosawa; Wataru Kishimoto; Takeshi Koshiba

doi:10.1109/TIT.2008.921704

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	https://doi.org/10.1109/TIT.2008.921704
出版ステータス	Published - 2008 6 1
外部発表	はい

ASJC Scopus subject areas

Information Systems
Computer Science Applications
Library and Information Sciences

文献へのアクセス

10.1109/TIT.2008.921704

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

引用スタイル

@article{ef06e966688a4a41b73690616e0a6e26,

title = "A combinatorial approach to deriving lower bounds for perfectly secure oblivious transfer reductions",

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

keywords = "Combinatorial approach, Lower bound, Oblivious transfer, Reduction",

author = "Kaoru Kurosawa and Wataru Kishimoto and Takeshi Koshiba",

year = "2008",

month = jun,

day = "1",

doi = "10.1109/TIT.2008.921704",

language = "English",

volume = "54",

pages = "2566--2571",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "6",

}

TY - JOUR

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

AU - Kurosawa, Kaoru

AU - Kishimoto, Wataru

AU - Koshiba, Takeshi

PY - 2008/6/1

Y1 - 2008/6/1

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

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

KW - Combinatorial approach

KW - Lower bound

KW - Oblivious transfer

KW - Reduction

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

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

U2 - 10.1109/TIT.2008.921704

DO - 10.1109/TIT.2008.921704

M3 - Article

AN - SCOPUS:45249091424

VL - 54

SP - 2566

EP - 2571

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

ER -