MODRED: A code-based non-interactive key exchange protocol
How to construct a non-interactive key exchange (NIKE) protocol based on coding theory is an opening problem. In this paper, we propose the first code-based NIKE protocol MODRED, whose security relies on the hardness of the Restricted Syndrome Decoding (R-SD) problem and its variant. A non-interacti...
Uložené v:
| Vydané v: | Theoretical computer science Ročník 1021; s. 114943 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier B.V
21.12.2024
|
| Predmet: | |
| ISSN: | 0304-3975 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | How to construct a non-interactive key exchange (NIKE) protocol based on coding theory is an opening problem. In this paper, we propose the first code-based NIKE protocol MODRED, whose security relies on the hardness of the Restricted Syndrome Decoding (R-SD) problem and its variant. A non-interactive error reconciliation mechanism is presented and applied to MODRED, which enables the two sides of communication to “approximately agree” on the shared key. This is of great significance because it may lead to a more generic framework construction. Furthermore, our proposal is competitive and practical. We provide an initial choice of parameters for MODRED, tailored to 120-bit post-quantum security level, yielding the public keys of less than 1.2 MBs.
•This is the first code-based non-interactive key exchange protocol.•A non-interactive reconciliation mechanism is proposed to enable both parties to “approximately agree” on the shared key.•We find the most efficient algorithm to solve the R-SD instances with some special parameters is the lattice-based algorithm.•Our proposal is suitable for most applications. |
|---|---|
| ISSN: | 0304-3975 |
| DOI: | 10.1016/j.tcs.2024.114943 |