## CryptoDB

### Paper: Relationships between quantum IND-CPA notions

Authors: Tore V. Carstens Ehsan Ebrahimi Gelo N. Tabia Dominique Unruh DOI: 10.1007/978-3-030-90459-3_9 Search ePrint Search Google Slides An encryption scheme is called indistinguishable under chosen plaintext attack (short IND-CPA) if an attacker cannot distinguish the encryptions of two messages of his choice. There are other variants of this definition but they all turn out to be equivalent in the classical case. In this paper, we give a comprehensive overview of these different variants of IND-CPA for symmetric encryption schemes in the quantum setting. We investigate the relationships between these notions and prove various equivalences, implications, non-equivalences, and non-implications between these variants.
##### BibTeX
@article{tcc-2021-31561,
title={Relationships between quantum IND-CPA notions},
booktitle={Theory of Cryptography;19th International Conference},
publisher={Springer},
doi={10.1007/978-3-030-90459-3_9},
author={Tore V. Carstens and Ehsan Ebrahimi and Gelo N. Tabia and Dominique Unruh},
year=2021
}