On the security of pseudorandomized information-theoretically secure schemes

Koji Nuida, Goichiro Hanaoka

研究成果: Contribution to journalArticle査読

4 被引用数 (Scopus)

抄録

In this paper, we discuss a naive method of randomness reduction for cryptographic schemes, which replaces the required perfect randomness with output distribution of a computationally secure pseudorandom generator (PRG). We propose novel ideas and techniques for evaluating the indistinguishability between the random and pseudorandom cases, even against an adversary with computationally unbounded attack algorithm. Hence, the PRG-based randomness reduction can be effective even for information-theoretically secure cryptographic schemes, especially when the amount of information received by the adversary is small. In comparison to a preceding result of Dubrov and Ishai (STOC 2006), our result removes the requirement of generalized notion of 'nb-PRGs' and is effective for more general kinds of protocols. We give some numerical examples to show the effectiveness of our result in practical situations, and we also propose a further idea for improving the effect of the PRG-based randomness reduction.

本文言語英語
論文番号6293892
ページ(範囲)635-652
ページ数18
ジャーナルIEEE Transactions on Information Theory
59
1
DOI
出版ステータス出版済み - 2013
外部発表はい

All Science Journal Classification (ASJC) codes

  • 情報システム
  • コンピュータ サイエンスの応用
  • 図書館情報学

フィンガープリント

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

引用スタイル