Efficient Amplification of the Security of Weak Pseudo-random Function Generators

Authors:
Steven Myers
Affiliations:
-
Venue:
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Year:
2001

Citing 9
Cited 1

How to construct random functions

Journal of the ACM (JACM)
Pseudo-random permutation generators and cryptographic composition

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
One-way functions and Pseudorandom generators

Combinatorica - Theory of Computing
How to construct pseudorandom permutations from pseudorandom functions

SIAM Journal on Computing - Special issue on cryptography
Randomized algorithms

Randomized algorithms
A Pseudorandom Generator from any One-way Function

SIAM Journal on Computing
How to Protect DES Against Exhaustive Key Search

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Security Amplification by Composition: The Case of Doubly-Iterated, Ideal Ciphers

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Theory and application of trapdoor functions

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science

Hardness amplification of weakly verifiable puzzles

TCC'05 Proceedings of the Second international conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that given a PRFG (pseudo-random function generator) G which is 1/c -partially secure, the construction g1(x ⊕ r1) ⊕ ... ⊕ glog2 n(x ⊕ rlog2 n) produces a strongly secure PRFG, where gi ∈ G and ri are strings of random bits. Thus we present the first "natural" construction of a (totally secure) PRFG from a partially secure PRFG. Using results of Luby and Rackoff, this result also demonstrates how to "naturally" construct a PRPG from partially secure PRPG.