Advances in Cryptology

Volume 196 of the series Lecture Notes in Computer Science pp 276-288


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.


Now that “random functions” can be efficiently constructed([GGM]), we discuss some of their possible applications to cryptography:
  1. 1)

    Distributing unforgable ID numbers which can be locally verified by stations which contain only a small amount of storage.

  2. 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. 3)

    Constructing deterministic, memoryless authentication schemes which are provably secure against chosen message attack.

  4. 4)

    Construction Identity Friend or Foe systems.