On the security of pseudorandomized information-theoretically secure schemes

Koji Nuida, Goichiro Hanaoka

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

2 被引用数 (Scopus)

抄録

Dubrov and Ishai (STOC 2006) revealed, by generalizing the notion of pseudorandom generators (PRGs), that under a computational assumption, randomness in a protocol can be replaced with pseudorandomness in an indistinguishable way for an adversary even if his algorithm has unbounded complexity. However, their argument was applied only to some special protocols. In this article, we first show that their argument is not effective for a wide class of more general protocols. Then we propose a novel evaluation technique for such indistinguishability that is based on usual PRGs and is effective for those more general protocols. Examples of such protocols include parallel computation over honest-but-curious modules, secret sharing, broadcast encryption, traitor tracing, and collusion-secure codes.

本文言語英語
ホスト出版物のタイトルInformation Theoretic Security - 4th International Conference, ICITS 2009, Revised Selected Papers
ページ56-73
ページ数18
DOI
出版ステータス出版済み - 2010
外部発表はい
イベント4th International Conference on Information Theoretic Security, ICITS 2009 - Shizuoka, 日本
継続期間: 12 3 200912 6 2009

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
5973 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

会議

会議4th International Conference on Information Theoretic Security, ICITS 2009
Country日本
CityShizuoka
Period12/3/0912/6/09

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「On the security of pseudorandomized information-theoretically secure schemes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル