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

Fingerprint

Authentication
Cryptography

ASJC Scopus subject areas

  • Hardware and Architecture

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)

On the (non)universality of the one-time pad. / Dodis, Yevgeniy; Spencer, Joel.

Annual Symposium on Foundations of Computer Science - Proceedings. ed. / D.C. Martin. 2002. p. 376-385.

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

Dodis, Y & Spencer, J 2002, On the (non)universality of the one-time pad. in DC Martin (ed.), Annual Symposium on Foundations of Computer Science - Proceedings. pp. 376-385, The 34rd Annual IEEE Symposium on Foundations of Computer Science, Vancouver, BC, Canada, 11/16/02.
Dodis Y, Spencer J. On the (non)universality of the one-time pad. In Martin DC, editor, Annual Symposium on Foundations of Computer Science - Proceedings. 2002. p. 376-385
Dodis, Yevgeniy ; Spencer, Joel. / On the (non)universality of the one-time pad. Annual Symposium on Foundations of Computer Science - Proceedings. editor / D.C. Martin. 2002. pp. 376-385
@inproceedings{3a98c705989a422e86662f42060c3b5d,
title = "On the (non)universality of the one-time pad",
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.",
author = "Yevgeniy Dodis and Joel Spencer",
year = "2002",
language = "English (US)",
pages = "376--385",
editor = "D.C. Martin",
booktitle = "Annual Symposium on Foundations of Computer Science - Proceedings",

}

TY - GEN

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

AU - Dodis, Yevgeniy

AU - Spencer, Joel

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0036957025&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036957025&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0036957025

SP - 376

EP - 385

BT - Annual Symposium on Foundations of Computer Science - Proceedings

A2 - Martin, D.C.

ER -