On the Cryptographic Applications of Random Functions (Extended Abstract)
- Oded GoldreichAffiliated withLaboratory for Computer Science, M.I.T.
- , Shafi GoldwasserAffiliated withLaboratory for Computer Science, M.I.T.
- , Silvio MicaliAffiliated withLaboratory for Computer Science, M.I.T.
Distributing unforgable ID numbers which can be locally verified by stations which contain only a small amount of storage.
Dynamic Hashing: even if the adversary can change the key-distribution depending on the values the hashing function has assigned to the previous keys, still he can not force collisions.
Constructing deterministic, memoryless authentication schemes which are provably secure against chosen message attack.
Construction Identity Friend or Foe systems.
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- Book Title
- Advances in Cryptology
- Book Subtitle
- Proceedings of CRYPTO 84
- Book Part
- Section III:
- pp 276-288
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 1. Department of Mathematics, Texas A&M University
- 2. Center for Mathematics and Computer Science (CWI)
- Author Affiliations
- 3. Laboratory for Computer Science, M.I.T., Cambridge, MA, 02139, USA
To view the rest of this content please follow the download PDF link above.