Smooth Hash Proof System Based on the Learning With Errors Problem With Multi-Bit Key Output
| Autor: | Yupu Hu, Linming Gong, Momeng Liu, Shanshan Zhang |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Theoretical computer science
General Computer Science Computer science Hash function Modulus Cryptography 02 engineering and technology 0202 electrical engineering electronic engineering information engineering General Materials Science Key encapsulation Key exchange Quantum computer Hash proof system Cryptographic primitive business.industry key encapsulation mechanism Lattice problem key exchange General Engineering lattice-based cryptography 020206 networking & telecommunications 020201 artificial intelligence & image processing Quantum algorithm lcsh:Electrical engineering. Electronics. Nuclear engineering business lcsh:TK1-9971 Learning with errors learning with errors |
| Zdroj: | IEEE Access, Vol 7, Pp 155143-155157 (2019) |
| ISSN: | 2169-3536 |
| DOI: | 10.1109/access.2019.2945569 |
| Popis: | Since hash proof system (HPS) can be utilized to build versatilely cryptographic schemes, the study on realizing this cryptographic primitive has been a very active research area. With the increasing concerns on the huge progress in quantum computing, it urges cryptographers to explore the existence of quantum-resistant HPS schemes, such as the one relying on some lattice-based assumptions. However, most lattice-based HPS proposals are relatively inefficient (e.g., simply outputting one-bit key), even though lattice-based schemes can enjoy many advantageous features: worst-case to average-case reduction, resistance so far to quantum algorithms, and good asymptotic efficiency. Therefore, efficient HPS schemes based on lattice problems are deeply in demand. Through a comprehensive analysis, we found that some lattice-based HPS schemes can be rephrased as their corresponding key encapsulation mechanism (KEM) forms, which generally rely on diverse reconciliation mechanisms and directly imply key exchange protocols under lattice-based assumptions. In this paper, inspired by a novel reconciliation mechanism based on the learning with errors (LWE) problem, we first properly adapt this LWE-based reconciliation mechanism for arbitrary modulus. Then using this improved reconciliation mechanism, we propose an efficient LWE-based HPS scheme which can generate multiple encapsulated key bits and perform better in both computation and storage costs than other related results. Moreover, our proposed lattice-based HPS scheme can be also extended to identity-based and updatable settings for demonstrating its diverse applications. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|