{"title":"SIT: Supersingular Isogeny Tree-based Group Key Exchange","authors":"Hector B. Hougaard, A. Miyaji","doi":"10.1109/AsiaJCIS50894.2020.00019","DOIUrl":null,"url":null,"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.","PeriodicalId":247481,"journal":{"name":"2020 15th Asia Joint Conference on Information Security (AsiaJCIS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 15th Asia Joint Conference on Information Security (AsiaJCIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AsiaJCIS50894.2020.00019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
