From unpredictability to indistinguishability: A simple construction of pseudo-random functions from MACs
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 267-282
- https://doi.org/10.1007/bfb0055734
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- The Security of Cipher Block ChainingPublished by Springer Nature ,2001
- New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge ProofsPublished by Springer Nature ,2001
- On the Cryptographic Applications of Random Functions (Extended Abstract)Published by Springer Nature ,2000
- MMH: Software message authentication in the Gbit/second ratesPublished by Springer Nature ,1997
- Bucket Hashing and its Application to Fast Message AuthenticationPublished by Springer Nature ,1995
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, 1988
- How to construct random functionsJournal of the ACM, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- On the generation of cryptographically strong pseudorandom sequencesACM Transactions on Computer Systems, 1983
- New hash functions and their use in authentication and set equalityJournal of Computer and System Sciences, 1981