Computational Independence

Björn Fay

Paper 2014/1013

Computational Independence

Björn Fay

Abstract

We will introduce different notions of independence, especially computational independence (or more precise independence by polynomial-size circuits (PSC)), which is the analog to computational indistinguishability. We will give some first implications and will show that an encryption scheme having PSC independent plaintexts and ciphertexts is equivalent to having indistinguishable encryptions.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint. MINOR revision.
Keywords: independence indistinguishability computational encryption
Contact author(s): mail @ bfay de
History: 2014-12-26: received
Short URL: https://ia.cr/2014/1013
License: CC BY

BibTeX

@misc{cryptoeprint:2014/1013,
      author = {Björn Fay},
      title = {Computational Independence},
      howpublished = {Cryptology {ePrint} Archive, Paper 2014/1013},
      year = {2014},
      url = {https://eprint.iacr.org/2014/1013}
}