TY - GEN
T1 - How to use pseudorandom generators in unconditional security settings
AU - Nuida, Koji
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2014.
PY - 2014
Y1 - 2014
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84910009570&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84910009570&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-12475-9_20
DO - 10.1007/978-3-319-12475-9_20
M3 - Conference contribution
AN - SCOPUS:84910009570
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 291
EP - 299
BT - Provable Security - 8th International Conference, ProvSec 2014, Proceedings
A2 - Chow, Sherman S.M.
A2 - Liu, Joseph K.
A2 - Hui, Lucas C.K.
A2 - Yiu, Siu Ming
PB - Springer Verlag
T2 - 21st International Conference on Neural Information Processing, ICONIP 2014
Y2 - 3 November 2014 through 6 November 2014
ER -