## Cryptology ePrint Archive: Report 2015/860

Carmit Hazay and Arpita Patra and Bogdan Warinschi

Abstract: In a selective opening (SO) attack an adversary breaks into a subset of honestly created ciphertexts and tries to learn information on the plaintexts of some untouched (but potentially related) ciphertexts. Contrary to intuition, standard security notions do not always imply security against this type of adversary, making SO security an important standalone goal. In this paper we study {\em receiver security}, where the attacker is allowed to obtain the decryption keys corresponding to some of the ciphertexts.

First we study the relation between two existing security definitions, one based on simulation and the other based on indistinguishability, and show that the former is strictly stronger. We continue with feasibility results for both notions which we show can be achieved from (variants of) non-committing encryption schemes. In particular, we show that indistinguishability-based SO security can be achieved from a tweaked variant of non-committing encryption which, in turn, can be instantiated from a variety of basic, well-established, assumptions. We conclude our study by showing that SO security is however strictly weaker than all variants of non-committing encryption that we consider, leaving potentially more efficient constructions as an interesting open problem.

Category / Keywords: public-key cryptography / Selective Opening Attacks, Encryption Schemes, Non-committing Encryption

Original Publication (with major differences): IACR-ASIACRYPT-2015

Date: received 5 Sep 2015, last revised 14 Sep 2015

Contact author: arpitapatra10 at gmail com, carmit hazay at gmail com, bogdan at compsci bristol ac uk

Available format(s): PDF | BibTeX Citation

Short URL: ia.cr/2015/860

[ Cryptology ePrint archive ]