M. Luby and C. Rackoff, "How to construct pseudorandom permutations from pseudorandom functions," SIAM J. Computation, Vol. 17, No. 2, April 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Appears in the proceedings of the First ACM Conference on.. - Random Oracles Are (Correct)
No context found.
M. Luby and C. Rackoff, "How to construct pseudorandom permutations from pseudorandom functions," SIAM J. Computation, Vol. 17, No. 2, April 1988.
Unknown - The Security Of (Correct)
No context found.
M. Luby and C. Racko , How to construct pseudorandom permutations from pseudorandom functions, SIAM J. Computation, Vol. 17, No. 2, April 1988. 34
An extended appears in Advances in Cryptology --.. - Luby-Rackoff.. (Correct)
No context found.
M. Luby and C. Rackoff, "How to construct pseudorandom permutations from pseudorandom functions." SIAM J. Comput, Vol. 17, No. 2, April 1988.
Deterministic Authenticated-Encryption - Provable-Security Treatment Of (Correct)
No context found.
M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput., vol. 17, no. 2, pp. 373--386, 1988.
On the Role of Definitions in and Beyond Cryptography - Phillip Rogaway Dept (Correct)
No context found.
M. Luby and C. Racko#. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. on Computing, vol. 17, no. 2, April 1988.
A Generic Construction of CCA-Secure Cryptosystems without .. - Goichiro Hanaoka And (Correct)
No context found.
M. Luby and C. Racko#, "How to construct pseudorandom permutations from pseudorandom functions, " SIAM J. Comput., 17(2), pp.373-386, 1988.
Deterministic Authenticated-Encryption - Provable-Security Treatment Of (2006) (Correct)
No context found.
M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput., vol. 17, no. 2, pp. 373--386, 1988.
Private Information Retrieval Using Trusted Hardware - Wang, Ding, Deng, Bao (2006) (Correct)
No context found.
Michael Luby and Charles Racko. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput., 17(2):373386, 1988.
Computational Alternatives to Random Number Generators - Published In Tavares (Correct)
No context found.
M. Luby & C. Racko#, How to construct pseudo-random permutations from pseud-orandom functions, siam journal of computing, vol. 17, 1988, pp. 373--386.
Verifiable Random Permutations - Dodis, Puniya (2006) (Correct)
No context found.
M. Luby and C. Racko#, How to construct pseudo-random permutations from pseudo-random functions, in SIAM Journal on Computing, Vol. 17, No. 2, April 1988.
Feistel Schemes and Bi-Linear Cryptanalysis - Courtois (2005) (Correct)
No context found.
Michael Luby, Charles W. Racko#, How to construct pseudorandom permutations from pseudorandom functions, SIAM Journal on Computing, vol. 17, n. 2, pp. 373-386, April 1988.
Merkle-Damgård Revisited: How to Construct a Hash.. - Coron, Dodis, Malinaud, .. (2005) (Correct)
No context found.
M. Luby and C. Racko#, How to construct pseudo-random permutations from pseudo-random functions, SIAM J. Comput., Vol. 17, No. 2, April 1988.
Computational Alternatives to Random Number Generators - Published In Tavares (Correct)
No context found.
M. Luby & C. Racko#, How to construct pseudo-random permutations from pseud-orandom functions, siam journal of computing, vol. 17, 1988, pp. 373--386.
Benes and Butterfly schemes revisited - Patarin, Montreuil (2005) (Correct)
No context found.
M. Luby and C. Racko#. How to construct pseudorandom permutations from pseudorandom functions, SIAM Journal on Computing, vol. 17, nb 2, pp. 373--386, April 1988.
Concrete Security Characterizations of PRFs and PRPs.. - Desai, Miner (2000) (1 citation) (Correct)
No context found.
M. Luby and C. Rackoff, \How to construct pseudorandom permutations from pseudorandom functions," SIAM J. Computing, Vol. 17, No. 2, April 1988.
Hardware and Binary Modification Support for Code Pointer .. - Tuck, Calder, Varghese (2004) (2 citations) (Correct)
No context found.
M. Luby and C. Racko#. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Computation, 17(2), April 1988.
Design of Near-Optimal Pseudorandom Functions and.. - Patarin, Camion (2005) (Correct)
No context found.
M. Luby and C. Racko#. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, vol. 17, n2, pp. 373--386, April 1988.
Unknown - Proposal To Nist (Correct)
No context found.
M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Computation, vol. 17, no. 2, April 1988.
Comparison of Randomness Provided by Several Schemes for.. - Shiho Moriai And (1999) (Correct)
No context found.
M. Luby, C. Racko#. How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM Journal on Computing, vol. 17, pp. 373--386, 1988.
FOX Specifications Version 1.0 - Junod, Vaudenay (2003) (Correct)
No context found.
M. Luby and C. Racko#. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, 17(2):373--386, 1988.
Plaintext-Simulatability - Fujisaki (2004) (Correct)
No context found.
M. Luby and C. Racko#. How to construct pseudorandom permutations from pseudorandom functions. SIAM. J. Computing, 17(2):373--386, 1988. (Presented in CRYPTO'85).
Comments to NIST concerning AES Modes of Operations: - Suggestion For Handling (Correct)
No context found.
M. LUBY and C. RACKOFF. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput., vol. 17, No. 2, April 1988.
Computational Alternatives to Random Number Generators - M'Raïhi, Naccache, eal. (1999) (Correct)
No context found.
M. Luby & C. Racko#, How to construct pseudo-random permutations from pseud-orandom functions, siam journal of computing, vol. 17, 1988, pp. 373--386.
Designing and Attacking Anonymous Communication Systems - Danezis (2004) (2 citations) (Correct)
No context found.
Michael Luby and Charles Racko#. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, 17(2):373-- 386, 1988.
Encode-then-encipher encryption: How to exploit nonces or.. - Bellare, Rogaway (2000) (12 citations) (Correct)
No context found.
M. Luby and C. Rackoff, \How to construct pseudorandom permutations from pseudorandom functions." SIAM J. Computing, Vol. 17, No. 2, April 1988.
First 50 documents Next 50
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