Chosen-Ciphertext Secure Key Encapsulation Mechanism in the Standard Model
| Autor: | Xiangxue Li, Shengfeng Xu |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: |
Key encapsulation mechanism
FO-like transformations Theoretical computer science General Computer Science Computer science business.industry Hash function standard model General Engineering Cryptography Adversary Random oracle Public-key cryptography Ciphertext Key (cryptography) General Materials Science Key encapsulation lcsh:Electrical engineering. Electronics. Nuclear engineering business Security level learning parity with noise lcsh:TK1-9971 Standard model (cryptography) |
| Zdroj: | IEEE Access, Vol 9, Pp 13683-13690 (2021) |
| ISSN: | 2169-3536 |
| Popis: | Key Encapsulation Mechanism (KEM) is a foundational cryptography primitive, which can provide secure symmetric cryptographic key material for transmission by using public key algorithms. Until now, many Chosen-Ciphertext (IND-CCA) secure KEM schemes are constructed from Chosen-Plaintext (IND-CPA) or One-Way (OW-CPA) secure PKE via the generic Fujisaki-Okamoto (FO) transformations (TCC 2017). However, the security relies on the Random Oracle Model (ROM). To the best of our knowledge, there are no IND-CCA secure KEM schemes based on Learning Parity with Noise (LPN) assumption that can against post quantum attacks in the standard model. In this work, we propose the first direct construction of LPN-based KEM, which is secure in the standard model. In particular, we use double-trapdoor technique to answer adversary's decryption queries correctly and a Target Collision Resistant (TCR) hash function to check the validity of the ciphertext. The encapsulated key is determined by a special LPN problem (with no random oracle required). The scheme is IND-CCA secure against post-quantum attacks under the low-noise LPN assumptions by a series of games and the security reduction is tight. Compared with previous schemes on 128-bit security level, our CCA-secure scheme only holds 50.78MB public keys, 62.50MB secret keys and 4.54KB ciphertexts, which is more efficient than the schemes of Döttling et al. (ASIACRYPT 2012), Kiltz et al. (PKC 2014) and Yu et al. (CRYPTO 2016) ((7.27GB, 7.24GB, 7.03KB), (80.89MB, 46.23MB, 6.80KB) and (70.95MB, 70.65MB, 86.50KB) respectively). |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|