Paper 2020/596

Relationships between quantum IND-CPA notions

Tore Vincent Carstens, Ehsan Ebrahimi, Gelo Tabia, and 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.

Note: Full Version

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. MAJOR revision.TCC 2021
Keywords
Symmetric encryptionQuantum securityIND-CPA
Contact author(s)
ehsan ebrahimi @ uni lu
unruh @ ut ee
History
2021-10-13: last of 2 revisions
2020-05-22: received
See all versions
Short URL
https://ia.cr/2020/596
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2020/596,
      author = {Tore Vincent Carstens and Ehsan Ebrahimi and Gelo Tabia and Dominique Unruh},
      title = {Relationships between quantum IND-CPA notions},
      howpublished = {Cryptology ePrint Archive, Paper 2020/596},
      year = {2020},
      note = {\url{https://eprint.iacr.org/2020/596}},
      url = {https://eprint.iacr.org/2020/596}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.