SIT:基于超奇异等根树的组密钥交换

2020 15th Asia Joint Conference on Information Security (AsiaJCIS) Pub Date : 2020-08-01 DOI:10.1109/AsiaJCIS50894.2020.00019

Hector B. Hougaard, A. Miyaji

{"title":"SIT:基于超奇异等根树的组密钥交换","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":"{\"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}","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

摘要

我们提出了第一个基于SIDH的恒轮、基于树的组密钥交换协议，该协议具有对数通信和内存复杂度，而之前唯一基于等基因的组密钥交换具有线性通信和内存复杂度。我们通过简化G-CK(+)安全模型中的超奇异决策Diffie-Hellman (SSDDH)问题证明了我们的协议满足后量子安全。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

SIT: Supersingular Isogeny Tree-based Group Key Exchange

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2020 15th Asia Joint Conference on Information Security (AsiaJCIS)

自引率

0.00%

发文量