A Connection between Indistinguishability and Semantic Security
نویسنده
چکیده
Intuitively, if objects are indistinguishable then we cannot determine their personal properties which vary among the population. Indeed, if we could reliably determine wheter an object is green or not then we could easily distinguish green objects from yellow ones. Hence, indistinguishability indirectly implies that one can reliably detect only trivial properties that either hold or do not hold for the entire population. This basic argumentation template forms the cornerstone of contemporary cryptography. In the following, we fill out all details that are needed to convert this informal argumentation to a formal proof. Let S0 be a distribution of secret values s and let supp(S0) be the corresponding support. Then we can define indistinguishability of states supp(S0) w.r.t. a function f : S0 → X . We say that states from supp(S0) are (t, ε)indistinguishable if for any s0, s1 ∈ supp(S0) and for any t-time algorithm A:
منابع مشابه
Equivalence between Semantic Security and Indistinguishability against Chosen Ciphertext Attacks
The aim of this work is to examine the relation between the notions of semantic security and indistinguishability against chosen ciphertext attacks. For this purpose, a new security notion called nondividability is introduced independent of attack models, and is shown to be equivalent to each of the previous two notions. This implies the equivalence between semantic security and indistinguishab...
متن کاملIndistinguishability and semantic security for quantum encryption scheme
We investigate the definition of security for encryption scheme in quantum context. We systematically define the indistinguishability and semantic security for quantum public-key and private-key encryption schemes, and for computational security, physical security and information-theoretic security. Based on our definition, we present a necessary and sufficient condition that leads to informati...
متن کاملRelations between semantic security and indistinguishability against cpa, non-adaptive cca and adaptive cca in comparison based framework
In this paper we try to unify the frameworks of definitions of semantic security, indistinguishability and non-malleability by defining semantic security in comparison based framework. This facilitates the study of relations among these goals against different attack models and makes the proof of the equivalence of semantic security and indistinguishability easier and more understandable. Besid...
متن کاملDefinitional Issues in Functional Encryption
We provide a formalization of the emergent notion of “functional encryption,” as well as introduce various security notions for it, and study relations among the latter. In particular, we show that indistinguishability and semantic security based notions of security are inequivalent for functional encryption in general; in fact, “adaptive” indistinguishability does not even imply “non-adaptive”...
متن کاملComparison Based Semantic Security is Probabilistic Polynomial Time Equivalent to Indistinguishability
In this paper we try to unify the frameworks of definitions of semantic security, indistinguishability and nonmalleability by defining semantic security in comparison based framework. This facilitates the study of relations among these goals against different attack models and makes the proof of the equivalence of semantic security and indistinguishability easier and more understandable. Beside...
متن کامل