Welcome to the resource topic for 2020/596
Title:
Relationships between quantum IND-CPA notions
Authors: Tore Vincent Carstens, Ehsan Ebrahimi, Gelo Tabia, Dominique Unruh
Abstract: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.
ePrint: https://eprint.iacr.org/2020/596
Talk: https://www.youtube.com/watch?v=x4FsJOegDRo
Slides: https://iacr.org/submit/files/slides/2021/tcc/tcc2021/249/slides.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .