Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security
- 13 September 2002
- book chapter
- Published by Springer Nature
- p. 449-464
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Number-theoretic constructions of efficient pseudo-random functions2002
- A concrete security treatment of symmetric encryption2002
- Encryption Modes with Almost Free Message Integrity2001
- New Paradigms for Constructing Symmetric Encryption Schemes Secure against Chosen-Ciphertext AttackLecture Notes in Computer Science, 2000
- A hard-core predicate for all one-way functions1989
- How to construct random functionsJournal of the ACM, 1986
- One-way functions and pseudorandom generators1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984