How to use pseudorandom generators in unconditional security settings

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationProvable Security - 8th International Conference, ProvSec 2014, Proceedings
EditorsSherman S.M. Chow, Joseph K. Liu, Lucas C.K. Hui, Siu Ming Yiu
PublisherSpringer Verlag
Pages291-299
Number of pages9
ISBN (Electronic)9783319124742
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event21st International Conference on Neural Information Processing, ICONIP 2014 - Kuching, Malaysia
Duration: Nov 3 2014Nov 6 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8782
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other21st International Conference on Neural Information Processing, ICONIP 2014
CountryMalaysia
CityKuching
Period11/3/1411/6/14

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'How to use pseudorandom generators in unconditional security settings'. Together they form a unique fingerprint.

Cite this