Now that “random functions” can be efficiently constructed([GGM]), we discuss some of their possible applications to cryptography:1)Distributing unforgable ID numbers which can be locally verified by stations which contain only a small amount of storage.2)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.3)Constructing deterministic, memoryless authentication schemes which are provably secure against chosen message attack.4)Construction Identity Friend or Foe systems.
CITATION STYLE
Goldreich, O., Goldwasser, S., & Micali, S. (1985). On the Cryptographic Applications of Random Functions (Extended Abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 196 LNCS, pp. 276–288). Springer Verlag. https://doi.org/10.1007/3-540-39568-7_22
Mendeley helps you to discover research relevant for your work.