CryptoDB
Impossibility of Post-Quantum Shielding Black-Box Constructions of CCA from CPA
| Authors: |
|
|---|---|
| Download: | |
| Abstract: | Proving whether it is possible to build IND-CCA public-key encryption (PKE) from IND-CPA PKE in a black-box manner is a major open problem in theoretical cryptography. In a significant breakthrough, Gertner, Malkin and Myers showed in 2007 that shielding black-box reductions from IND-CCA to IND-CPA do not exist in the standard model. Shielding means that the decryption algorithm of the IND-CCA scheme does not call the encryption algorithm of the underlying IND-CPA scheme. In other words, it implies that every tentative construction of IND-CCA from IND-CPA must have a re-encryption step when decrypting. This result was only proven with respect to classical algorithms. In this work we show that it stands in a post-quantum setting. That is, we prove that there is no post-quantum shielding black-box construction of IND-CCA PKE from IND-CPA PKE. In the type of reductions we consider, i.e. post-quantum ones, the constructions are still classical in the sense that the schemes must be computable on classical computers, but the adversaries and the reduction algorithm can be quantum. This suggests that considering quantum notions, which are stronger than their classical counterparts, and allowing for quantum reductions does not make building IND-CCA public-key encryption easier. |
BibTeX
@article{cic-2024-34105,
title={Impossibility of Post-Quantum Shielding Black-Box Constructions of CCA from CPA},
journal={cic},
publisher={International Association for Cryptologic Research},
volume={1, Issue 1},
url={https://cic.iacr.org//p/1/1/4},
doi={10.62056/akp2fhbmo},
author={Loïs Huguenin-Dumittan and Serge Vaudenay},
year=2024
}