Public randomness in cryptography

Amir Herzberg, Michael Luby

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations


The main contribution of this paper is the introduction of a formal notion of public randomness in the context of cryptography. We show how this notion affects the definition of the security of a crypto­graphic primitive and the definition of how much security is preserved when one cryptographic primitive is reduced to another. Previous works considered the public random bits as a part of the input, and security was parameterized in terms of the total length of the input. We parame­terize security solely in terms of the length of the private input, and treat the public random bits as a separate resource. This separation allows us to independently address the important Issues of how much security is preserved by a reduction and how many public random bits are used in the reduction. To exemplify these new definitions, we present, reductions from weak one­way permutations to one-way permutations with strong security preserv­ing properties that are simpler than previously known reductions.

Original languageEnglish
Title of host publicationAdvances in Cryptology — CRYPTO 1992 - 12th Annual International Cryptology Conference, Proceedings
EditorsErnest F. Brickell
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540573401
StatePublished - 1993
Externally publishedYes
Event12th Annual International Cryptology Conference, CRYPTO 1992 - Santa Barbara, United States
Duration: 16 Aug 199220 Aug 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume740 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference12th Annual International Cryptology Conference, CRYPTO 1992
Country/TerritoryUnited States
CitySanta Barbara

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1993.


Dive into the research topics of 'Public randomness in cryptography'. Together they form a unique fingerprint.

Cite this