On the (non)universality of the one-time pad

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The extent to which conventional cryptographic primitives such as encryption and authentication can be built based on imperfect sources of randomness was examined. In particular, the class of "cryptographic" sources was compared with the well studied classes of weak and extractable random sources. The results illustrate that the set of sources sufficient for various cryptographic applications seems to be quite different from the well studied classes, and also strongly depends on the cryptographic task at hand.

Original languageEnglish (US)
Title of host publicationAnnual Symposium on Foundations of Computer Science - Proceedings
EditorsD.C. Martin
Pages376-385
Number of pages10
StatePublished - 2002
EventThe 34rd Annual IEEE Symposium on Foundations of Computer Science - Vancouver, BC, Canada
Duration: Nov 16 2002Nov 19 2002

Other

OtherThe 34rd Annual IEEE Symposium on Foundations of Computer Science
CountryCanada
CityVancouver, BC
Period11/16/0211/19/02

ASJC Scopus subject areas

  • Hardware and Architecture

Fingerprint Dive into the research topics of 'On the (non)universality of the one-time pad'. Together they form a unique fingerprint.

  • Cite this

    Dodis, Y., & Spencer, J. (2002). On the (non)universality of the one-time pad. In D. C. Martin (Ed.), Annual Symposium on Foundations of Computer Science - Proceedings (pp. 376-385)