| 講演抄録/キーワード |
| 講演名 |
2009-05-26 10:40
Strengthening the Security of Distributed Oblivious Transfer ○Kai Yuen Cheong・Takeshi Koshiba・Shohei Nishiyama(Saitama Univ.) COMP2009-11 |
| 抄録 |
(和) |
(まだ登録されていません) |
| (英) |
We study the distributed oblivious transfer first proposed by Naor and Pinkas in ASIACRYPT 2000, and generalized by Blundo et al. originally in SAC 2002 and Nikov et al. in INDOCRYPT 2002. One major objective of distributed oblivious transfer is to achieve information theoretic security under specified conditions through the distribution of the functions of traditional oblivious transfer to a set of neutral parties. In this paper we revise the definition of distributed oblivious transfer in order to deal with stronger adversaries and clarify possible ambiguities. Under the new definition, we observe some impossibility results and derive the upper bounds for the system parameters (with respect to the size of coalition). The weak points of previously proposed schemes based on threshold secret sharing schemes using polynomial interpolation are reviewed and resolved. We generalize the results and prove that, by adjusting some technical details, a previous scheme proposed by Nikov et al. is unconditionally secure. This protocol is efficient and achieves the parameter bounds at the same time. |
| キーワード |
(和) |
/ / / / / / / |
| (英) |
oblivious transfer / secret sharing scheme / information theoretic security / / / / / |
| 文献情報 |
信学技報, vol. 109, no. 54, COMP2009-11, pp. 13-19, 2009年5月. |
| 資料番号 |
COMP2009-11 |
| 発行日 |
2009-05-19 (COMP) |
| ISSN |
Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380 |
著作権に ついて |
技術研究報告に掲載された論文の著作権は電子情報通信学会に帰属します.(許諾番号:10GA0019/12GB0052/13GB0056/17GB0034/18GB0034) |
| PDFダウンロード |
COMP2009-11 |