Cryptology ePrint Archive: Report 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.

Category / Keywords: foundations / independence, indistinguishability, computational, encryption

Date: received 20 Dec 2014

Contact author: mail at bfay de

Available format(s): PDF | BibTeX Citation

Version: 20141226:231033 (All versions of this report)

Short URL: ia.cr/2014/1013

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]