An Efficient Hybrid Key Exchange Mechanism
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908350388633600 |
|---|---|
| author | Kim, Benjamin D. Vasudevan, Vipindev Adat Cohen, Alejandro D'Oliveira, Rafael G. L. Stahlbuhk, Thomas Médard, Muriel |
| author_facet | Kim, Benjamin D. Vasudevan, Vipindev Adat Cohen, Alejandro D'Oliveira, Rafael G. L. Stahlbuhk, Thomas Médard, Muriel |
| contents | We present \textsc{CHOKE}, a novel code-based hybrid key-encapsulation mechanism (KEM) designed to securely and efficiently transmit multiple session keys simultaneously. By encoding $n$ independent session keys with an individually secure linear code and encapsulating each resulting coded symbol using a separate KEM, \textsc{CHOKE} achieves computational individual security -- each key remains secure as long as at least one underlying KEM remains unbroken. Compared to traditional serial or combiner-based hybrid schemes, \textsc{CHOKE} reduces computational and communication costs by an $n$-fold factor. Furthermore, we show that the communication cost of our construction is optimal under the requirement that each KEM must be used at least once. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_02499 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | An Efficient Hybrid Key Exchange Mechanism Kim, Benjamin D. Vasudevan, Vipindev Adat Cohen, Alejandro D'Oliveira, Rafael G. L. Stahlbuhk, Thomas Médard, Muriel Cryptography and Security Information Theory We present \textsc{CHOKE}, a novel code-based hybrid key-encapsulation mechanism (KEM) designed to securely and efficiently transmit multiple session keys simultaneously. By encoding $n$ independent session keys with an individually secure linear code and encapsulating each resulting coded symbol using a separate KEM, \textsc{CHOKE} achieves computational individual security -- each key remains secure as long as at least one underlying KEM remains unbroken. Compared to traditional serial or combiner-based hybrid schemes, \textsc{CHOKE} reduces computational and communication costs by an $n$-fold factor. Furthermore, we show that the communication cost of our construction is optimal under the requirement that each KEM must be used at least once. |
| title | An Efficient Hybrid Key Exchange Mechanism |
| topic | Cryptography and Security Information Theory |
| url | https://arxiv.org/abs/2505.02499 |