How to use pseudorandom generators in unconditional security settings

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

1 被引用数 (Scopus)

抄録

Cryptographic pseudorandom generators (PRGs) can reduce the randomness complexity of computationally secure schemes. Nuida and Hanaoka (IEEE Trans. IT 2013) developed a security proof technique against computationally unbounded adversaries under the use of cryptographic PRGs. However, their proof assumed unproven hardness of the underlying problem for the cryptographic PRG. In the paper, we realize a fully unconditional security proof, by extending the previous result to “non-cryptographic” PRGs such as the one by Impagliazzo, Nisan andWigderson (STOC 1994) based on graph theory rather than one-way functions. In fact, our proof technique is effective only for some restricted class of schemes; then we also propose a “dual-mode” modification of the PRG to prove computational security even for schemes outside the class, while keeping the unconditional security for schemes in the class.

本文言語英語
ホスト出版物のタイトルProvable Security - 8th International Conference, ProvSec 2014, Proceedings
編集者Sherman S.M. Chow, Joseph K. Liu, Lucas C.K. Hui, Siu Ming Yiu
出版社Springer Verlag
ページ291-299
ページ数9
ISBN(電子版)9783319124742
DOI
出版ステータス出版済み - 2014
外部発表はい
イベント21st International Conference on Neural Information Processing, ICONIP 2014 - Kuching, マレーシア
継続期間: 11月 3 201411月 6 2014

出版物シリーズ

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

その他

その他21st International Conference on Neural Information Processing, ICONIP 2014
国/地域マレーシア
CityKuching
Period11/3/1411/6/14

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータサイエンス一般

フィンガープリント

「How to use pseudorandom generators in unconditional security settings」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル