抄録
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