SIT: Supersingular Isogeny Tree-based Group Key Exchange
Hector B. Hougaard, Atsuko Miyaji
Abstract
Hector B. Hougaard, Atsuko Miyaji
Abstract
We present the first constant-round, tree-based, group key exchange protocol based on SIDH with logarithmic communication and memory complexity, where the only previous isogeny-based group key exchanges have linear communication and memory complexity. We show that our protocol satisfies post-quantum security through a reduction to the Supersingular Decisional Diffie-Hellman (SSDDH) problem in the G-CK(plus) security model.
OpenAlex reports 5 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We present the first constant-round, tree-based, group key exchange protocol based on SIDH with logarithmic communication and memory complexity, where the only previous isogeny-based group key exchanges have linear communication and memory complexity. We show that our protocol satisfies post-quantum security through a reduction to the Supersingular Decisional Diffie-Hellman (SSDDH) problem in the G-CK(plus) security model.
Key concepts: Isogeny, Key exchange, Computer science, Group key, Key (lock), Cryptography, Tree (set theory), Reduction (mathematics)