Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security
- 13 September 2002
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 449-464
- https://doi.org/10.1007/3-540-45708-9_29
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A concrete security treatment of symmetric encryptionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Encryption Modes with Almost Free Message IntegrityLecture Notes in Computer Science, 2001
- 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 functionsPublished by Association for Computing Machinery (ACM) ,1989
- How to construct random functionsJournal of the ACM, 1986
- One-way functions and pseudorandom generatorsPublished by Association for Computing Machinery (ACM) ,1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984