On the Cryptographic Applications of Random Functions (Extended Abstract)

  • Oded Goldreich
  • Shafi Goldwasser
  • Silvio Micali
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 196)


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.



  1. [AL]
    D. Angluin and D. Lichtenstein, Provable Security of Cryptosystems: a Survey, YaleU/DCS/TR-288, 1983Google Scholar
  2. [BBS]
    L. Blum, M. Blum and M. Shub, A simple secure pseudo random number generator, Advances in Cryptology: Proc. of CRYPTO-82, ed. D. Shaum, R. L. Rivest and A.T. Sherman. Plenum press 1983, pp 61–78.Google Scholar
  3. [BG]
    M. Blum and S. Goldwasser, An Efficient Probabilistic Public-Key Encryption Scheme Which Hides all Partial Information, preprint May 1984.Google Scholar
  4. [BM]
    M. Blum and S. Micali, How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. COMPUT., Vol 13, No. 4, Nov. 1984.Google Scholar
  5. [B]
    G. Brassard, On computationally secure authentication tags requiring short secret shared keys, Advances in Cryptology: Proc. of CRYPTO-82, ed. D. Sham, R.L. Rivest and A.T. Sherman. Plenum press 1983, pp 79–86.Google Scholar
  6. [CG]
    B. Chor and O. Goldreich, RSA Rabin least significant bits are \( \frac{1} {2} + \frac{1} {{poly (\log N)}} \) secure, MIT/LCS/TM-260, May 1984.Google Scholar
  7. [CW]
    J.L. Carter and M.N. Wegman, Universal classes of hash functions, Proc. 9th ACE Symp. on Theory of Computing, 1977, pp 106–112.Google Scholar
  8. [GGM]
    O. Goldreich, S. Coldwasser and S. Micali, How to construc random functions, MIT/LCS/TM-244, November 1983.Google Scholar
  9. [GM]
    O. Goldreich and S. Micali, The weakest CSPRB generator implies the strongest one, in preparation.Google Scholar
  10. [GMT]
    S. Goldwasser, S. Micali and P. Tong. Why and how to establish a private code on a public network, Proc. 23rd IEEE Symp. on Foundations of Computer Science, 1982, pp 134–144.Google Scholar
  11. [RSA]
    R. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public key cryptosystems, Commun. ACM vol. 21, Feb. 1978, pp 120–126.MATHCrossRefMathSciNetGoogle Scholar
  12. [S]
    A. Shamir, On the Generation of Cryptographically Strong Pseudorandom Sequences, 8th International Colloquiun on Automata, Languages, and Programming, Lect. Notes in Comp. Sci. 62, Springer Verlag, 1981.Google Scholar
  13. [Y]
    A.C. Yao, Theory and applications of trapdoor functions, Proc. 23rd IEEE Symp. on Foundations of Computer Science, 1982, pp 80–91Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Oded Goldreich
    • 1
  • Shafi Goldwasser
    • 1
  • Silvio Micali
    • 1
  1. 1.Laboratory for Computer ScienceM.I.T.CambridgeUSA

Personalised recommendations