• DocumentCode
    2134072
  • Title

    One-way functions are essential for complexity based cryptography

  • Author

    Impagliazzo, Russell ; Luby, Michael

  • Author_Institution
    Dept. of Math., California Univ., Berkeley, CA, USA
  • fYear
    1989
  • fDate
    30 Oct-1 Nov 1989
  • Firstpage
    230
  • Lastpage
    235
  • Abstract
    It is shown that many of the standard cryptographic tasks are equivalent to the usual definition of a one-way function. In particular, it is shown that for some of the standard cryptographic tasks any secure protocol for the task can be converted into a one-way function in the usual sense, and thus the security of any proposed protocol for these tasks is implicitly based on a function being `one-way.´ Thus, the usual definition of a one-way function is robust; any one-way function with respect to another definition on which a secure cryptographic protocol can be based can be used to construct a one-way function in the usual sense. The authors focus on private-key encryption, identification/authentication, bit commitment, and coin flipping by telephone. However, the proof techniques presented here can be easily adopted to prove analogous results for other cryptographic tasks
  • Keywords
    computational complexity; cryptography; authentication; bit commitment; coin flipping; complexity based cryptography; identification; one-way functions; protocol; Authentication; Computer graphics; Computer science; Computer security; Cryptographic protocols; Cryptography; Mathematics; Polynomials; Robustness; Telephony;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Foundations of Computer Science, 1989., 30th Annual Symposium on
  • Conference_Location
    Research Triangle Park, NC
  • Print_ISBN
    0-8186-1982-1
  • Type

    conf

  • DOI
    10.1109/SFCS.1989.63483
  • Filename
    63483