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

Yevgeniy Dodis; Joel Spencer

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

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Annual Symposium on Foundations of Computer Science - Proceedings
Editors	D.C. Martin
Pages	376-385
Number of pages	10
State	Published - 2002
Event	The 34rd Annual IEEE Symposium on Foundations of Computer Science - Vancouver, BC, Canada Duration: Nov 16 2002 → Nov 19 2002

Other

Other	The 34rd Annual IEEE Symposium on Foundations of Computer Science
Country/Territory	Canada
City	Vancouver, BC
Period	11/16/02 → 11/19/02

ASJC Scopus subject areas

Hardware and Architecture

Cite this

@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",

note = "The 34rd Annual IEEE Symposium on Foundations of Computer Science ; Conference date: 16-11-2002 Through 19-11-2002",

}

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.

T2 - The 34rd Annual IEEE Symposium on Foundations of Computer Science

Y2 - 16 November 2002 through 19 November 2002

ER -

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

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this