Michael Luby, Pseudorandomness and cryptographic applications, Princeton Computer Science Notes, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Survey of Computational Assumptions Used in Cryptography Broken or.. - Zhu (2001) (Correct)
....a short random bit string (a seed ) and expands it into a much longer random looking bit string. In other words, although the output of a PRBG is not really random, it is infeasible to tell the di#erence. A PRBG can be constructed from any OWF. In fact, PRBG exists if and only if OWF exists [Lub96] It turns out that PRBG plays a central role in the construction of others primitives, such as symmetric key cryptosystems, digital signatures, zero knowledge proofs, and bit commitment. A proof refers to a process by which the validity to an assertion is established. Proofs in cryptographic ....
Michael Luby. Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes. Princeton University Press, Princeton, NJ, 1996.
Initiator-Resilient Universally Composable Key Exchange - Hofheinz, Müller-Quade.. (2003) (4 citations) (Correct)
....(g ) where x; y 2 f1; jhgij 1g: as the ideal functionality F KE chooses the key as a random bitstring , we follow the approach in [Sho99, Section 5.3. 2] and assume the parameters to be chosen such that the decisional Die Hellman problem and the entropy smoothing theorem (cf. e.g. Lub96, Chapter 8] imply the computational indistinguishability of the distributions f(g; g ; H hgi; g ) g k and f(g; g ; g k with a random bitstring of length equal to the output length of H hgi and k the security parameter. We assume that for a group G 2 G that is associated ....
Michael Luby. Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes. Princeton University Press, 1996.
A Future-Adaptable Password Scheme - Provos, Mazieres (1999) (2 citations) (Correct)
....Eksblowfish is designed to take user chosen passwords as keys and resist attacks on those keys. As its base we use the blowfish [15] block cipher by Schneier, which is wellestablished and has been fairly well analyzed. Blowfish is a 64 bit block cipher, structured as a 16round Feistel network [14]. It uses 18 32 bit subkeys, P 1 ; P 18 , which it derives from the encryption key. The subkeys are known collectively as the PArray. Blowfish encrypts by splitting a 64 bit input block Ciphertext P1 P2 P16 P17 P18 Plaintext 32 bit 32 bit 32 bit 32 bit 64 bit 64 bit 32 bit 32 ....
Michael Ruby. Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes, 1996.
Towards a Theory of Variable Privacy - Vora (2003) (Correct)
No context found.
Michael Luby, Pseudorandomness and cryptographic applications, Princeton Computer Science Notes, 1996.
Survey of Computational Assumptions Used in Cryptography Broken or.. - Zhu (2001) (Correct)
No context found.
Michael Luby. Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes. Princeton University Press, Princeton, NJ, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC