Pseudorandom Generators Imply One-Way Functions
On Constructing Parallel Pseudorandom Generators from One-Way Functions
... and U t 0 and answers 1 if and only if C(U t ρ ) 6= C(U t 0 ρ ). It is easy to see that such a C 0 can be implemented in constant depth. Combining C 0 with our constant depth circuit W that given random bits generates a ...
28
Saving Private Randomness in One-Way Functions and Pseudorandom Generators
... whether one can save on secret random bits at the expense of more public random ...to one-way ...hash functions results in a new one-way function that uses only k secret ...
25
Monotone Circuits: One-Way Functions versus Pseudorandom Generators
... of one-way functions and pseudorandom generators by monotone circuits, showing a substantial gap between the two: On one hand, there exist one-way functions ...
8
Pseudorandom Generators from One-Way Functions: A Simple Construction for Any Hardness
... The reader might think that it would be more natural if we used the best advantage for computationally unbounded algorithms (i.e., the information the- oretic advantage), instead of 1 − H(P (W )|g(W )). Then φ would be ...
19
Pseudorandom Generators for Low Sensitivity Functions
... a pseudorandom generator fooling AC 0 circuits with poly-logarithmic ...low-sensitivity functions can be ε-approximated by real polynomials of degree O(s · log(1/ε)), which implies that the parity function ...
13
A mathematical problem for security analysis of hash functions and pseudorandom generators
... a way that each C i ′ (i = 1, 2) consists of some hash functions for which collision pairs can be found in reasonable computational time by using some known ...least one hash function H for which the ...
19
Robust Pseudorandom Generators
... We turn to the question of constructing robust PRGs, starting with some simple observations. First, if k = n, the set S can include the entire PRG seed, conditioned on which the entire output is fixed. We thus restrict ...
31
Pseudorandom Functions and Lattices
... any one-way function, and hence from lattices, these generic constructions are usually very inefficient, which puts them at odds with the high performance demands of most ...(e.g., one-way ...
25
Efficient Pseudorandom Generators Based on the DDH Assumption
... hash functions if the size of the subgroup is at least p/2 160 ...but one gets this randomness back in the sense that the extractor outputs not only the integer from Z q but also an element of Z l ...
12
On Cryptographic Properties of LFSR-based Pseudorandom Generators
... between one output bit and the corresponding seed ...this way, he ends up with a system of linear equations which can be solved using standard techniques like the Gaussian eliminiation ...
122
Pseudorandom Generators from Polarizing Random Walks
... to functions which are XOR of at most 2 bits (for which s = 2) the seed length required is Ω(log logn + log(1/ε ...layer, one labeled with a 1 and the other labeled with a − ...
26
Functional Signatures and Pseudorandom Functions
... of one-way functions, the GGM pseudorandom function family to- gether with algorithms KeyGen and Eval defined as above, is a selectively secure functional PRF for the class of functions ...
34
Adaptive One-way Functions and Applications
... preposterous. One cri- terion in determining the acceptability of a cryptographic assumption A is to consider (1) what the assumption is used for (for instance, to construct a primi- tive P , say) and (2) how much ...
18
Publicly Evaluable Pseudorandom Functions and Their Applications
... of one set of algorithms, which is used to fulfill some functionality and is expected to satisfy some desired ...include one-way (trapdoor) functions/permutations and pseudorandom ...
38
Constrained Pseudorandom Functions: Verifiable and Delegatable
... a way to generate a proof π along with the PRF output y enabling the receiver to check whether y is the correct PRF output or ...and one can just use the public parameters to distinguish this from a ...
18
Algebraic (Trapdoor) One Way Functions and their Applications
... Finally, we observe that in the subgroup of quadratic residues QR N where N is the product of two safe primes, the DDH assumption is assumed to hold (even if the factorization is revealed [30]). 2.2 Closed Form Efficient ...
39
Efficient RFID authentication protocols based on pseudorandom sequence generators
... problems. One is to provide S-protocol with untraceability, as required in many RFID ...explicit way, but a reader identifies the tag in a back-end data base by using the keystream block transmitted in ...
18
Lecture 5 - CPA security, Pseudorandom functions
... exist pseudorandom functions. Proving Theorem 3 The best way to think about the construction is the ...each one of them with a string in {0, 1} n in the natural way (the string depicts ...
5
PSEUDORANDOM NUMBER GENERATORS
... NUMBER GENERATORS P ¨ AR KURLBERG AND CARL POMERANCE ...dard pseudorandom number generators from number theory—the linear con- gruential generator, first introduced by ...
9
Neural Networks as Pseudorandom Number Generators
... networks with a single random neuron described above, make N copies of the network, initialize each copy with a random seed, and run each of the N networks in parallel. Thus we take N networks, each with 1 visible ...
121