You are looking at a specific version 20090530:160722 of this paper. See the latest version.

Paper 2009/249

Pseudo-randomness and partial information in symbolic security analysis

Daniele Micciancio

Abstract

We prove computational soundness results for cryptographic expressions with pseudo-random keys, as used, for example, in the design and analysis of secure multicast key distribution protocols. In particular, we establish a symbolic notion of independence (for pseudo-random keys) that exactly matches the standard computational security definition (namely, indistinguishability from the uniform distribution) for pseudo-random generators. As a conceptual contribution, we initiate the study of partial information in the context of computationally sound symbolic security analysis. Specifically, we show that (within our admittedly simple, but hopefully evocative setting) partial information can be taken into account in the symbolic model, in a computationally sound way, by simply annotating each key with a label which specifies that the key is either known, unknown, or partially known, without further details about the amount and type of partial information.

Metadata
Available format(s)
PDF PS
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
Computational soundnessformal methods for securitypseudo-random generatorspartial informationgreatest fix-points
Contact author(s)
daniele @ cs ucsd edu
History
2018-02-23: revised
2009-05-30: received
See all versions
Short URL
https://ia.cr/2009/249
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.