A Quantum Public-Key Encryption Scheme and Its Improvement

Khashayar Barooti, Alex B. Grilo, Loïs Huguenin-Dumittan +4 more

Li Yang, Min Liang

This paper investigates a quantum version of McEliece public-key encryption (PKE) scheme, and analyzes its security. As is well known, the security of classical McEliece PKE is not stronger than the onewayness of related classical one-way function. We prove the security of quantum McEliece PKE ranks between them. Moreover, we propose the double-encryption technique to improve its security, and the security of the improved scheme is proved to be between the original scheme and the quantum one-time pad.

Xianmin Wang, Jing Li, Hongyang Yan

Series of public key encryption (PKE) schemes have been proposed for remote sensing image encryption; however, most of these schemes are not secure against quantum attacks in the new era of quantum computing. In this paper, we present an improved anti-quantum MST3 PKE scheme for remote sensing images. Using the MST3 cryptosystem, the proposed scheme can effectively resist the current quantum attacks. Moreover, with the help of a collision-resistant hash function, the proposed method achieves a nonmalleable property with respect to possible malleable attacks. Compared with the previous MST series encryption schemes, our scheme has a slightly higher efficiency.

Giulio Malavolta, Michael Walter

Min Liang, Li Yang

Xiang Xie, Rui Xue, Rui Zhang

Abstract. Deterministic public key encryption (D-PKE) provides an alternative to randomized public key encryption in various scenarios (e.g. search on encrypted data) where the latter exhibits inherent drawbacks. In CRYPTO’11, Brakerski and Segev formalized a framework for studying the security of deterministic public key encryption schemes with respect to auxiliary inputs. A trivial requirement is that the plaintext should not be efficiently recoverable from the auxiliary inputs. In this paper, we present an efficient deterministic public key encryption scheme in the auxiliary-input setting from lattices. The public key size, ciphertext size and ciphertext expansion factor are improved compared with the scheme proposed by Brakerski and Segev. Our scheme is also secure even in the multi-user setting where related messages may be encrypted under multiple public keys. In addition, the security of our scheme is based on the hardness of the learning with errors (LWE) problem which remains hard even for quantum algorithms. Furthermore, we consider deterministic identity-based public key encryption (D-IBE) in the auxiliaryinput setting. The only known D-IBE scheme (without considering auxiliary inputs) in the standard model was proposed by Bellare et al. in EUROCRYPT’12. However, this scheme is only secure in the selective security setting, and Bellare et al. identified it as an open problem to construct adaptively secure D-IBE schemes. The second contribution of this work is to propose a D-IBE scheme from lattices that is adaptively secure.