Relations between semantic security and indistinguishability against cpa, non-adaptive cca and adaptive cca in comparison based framework
Ali Bagherzandi, Kooshiar Azimian, Javad Mohajeri, Mahmoud, Salmasizadeh

TL;DR
This paper unifies various cryptographic security notions within a comparison-based framework, simplifying the understanding of their relationships and proving their equivalence without intermediate assumptions.
Contribution
It introduces a unified framework for semantic security, indistinguishability, and non-malleability, and provides a straightforward proof of their equivalence.
Findings
Semantic security and indistinguishability are equivalent in the comparison-based framework.
The proof of equivalence is simplified and does not require intermediate goals.
The framework facilitates studying security goals against different attack models.
Abstract
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. Besides, our proof of the equivalence of semantic security and indistinguishability does not need any intermediate goals such as non devidability to change the definition framework.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSecurity and Verification in Computing · Access Control and Trust · Cryptography and Data Security
