Relations Among Notions of Non-malleability for Encryption
نویسندگان
چکیده
Since its introduction in the early 90’s, the notion of nonmalleability for encryption schemes has been formalized using a number of conceptually different definitional approaches—most notably, the “pragmatic” indistinguishability-based approach and the “semantical” simulation-based approach. We provide a full characterization of these approaches and consider their robustness under composition.
منابع مشابه
Non-Malleability vs. CCA-Security: The Case of Commitments
In this work, we settle the relations among a variety of security notions related to non-malleability and CCA-security that have been proposed for commitment schemes in the literature. Interestingly, all our separations follow from two generic transformations. Given two appropriate security notions X and Y from the class of security notions we compare, these transformations take a commitment sc...
متن کاملRelations Among Notions of Security for Public-Key Encryption Schemes
We compare the relative strengths of popular notions of security for public-key encryption schemes. We consider the goals of privacy and non-malleability, each under chosen-plaintext attack and two kinds of chosen-ciphertext attack. For each of the resulting pairs of definitions we prove either an implication (every scheme meeting one notion must meet the other) or a separation (there is a sche...
متن کاملNon-malleability Under Selective Opening Attacks: Implication and Separation
We formalize the security notions of non-malleability under selective opening attacks (NM-SO security) in two approaches: the indistinguishability-based approach and the simulationbased approach. We explore the relations between NM-SO security notions and the known selective opening security notions, and the relations between NM-SO security notions and the standard non-malleability notions.
متن کاملExtended Notions of Security for Multicast Public Key Cryptosystems
In this paper we introduce two notions of security: multi-user indistinguishability and multi-user non-malleability. We believe that they encompass the correct requirements for public key encryption schemes in the context of multicast communications. A precise and non-trivial analysis proves that they are equivalent to the former single-user notions, provided the number of participants is polyn...
متن کاملOn the Security Notions for Public-Key Encryption Schemes
In this paper, we revisit the security notions for public-key encryption, and namely indistinguishability. We indeed achieve the surprising result that no decryption query before receiving the challenge ciphertext can be replaced by queries (whatever the number is) after having received the challenge, and vice-versa. This remark leads to a stricter and more complex hierarchy for security notion...
متن کامل