Ridhwan Dewoprabowo, Muhammad Arzaki, Yanti Rusmawati
{"title":"群密钥分发的广义分治法:正确性和复杂性","authors":"Ridhwan Dewoprabowo, Muhammad Arzaki, Yanti Rusmawati","doi":"10.1109/ICOICT.2018.8528749","DOIUrl":null,"url":null,"abstract":"In this article we present a generalized version of divide and conquer approach for contributory group Diffie-Hellman key exchange (DHKE) scheme. In particular, we devise an efficient way to establish a mutual secret key for multiple participants that uses a quasilinear amount of exponentiations with respect to the number of participants. The correctness of our protocol is proven using mathematical induction. We also compute its complexity in terms of total exponentiations within the protocol, analyze several important computational characteristics, and analyze the security of the protocol against passive attack. Moreover, we provide a comprehensive comparison of our protocol with other existing contributory schemes. Finally, we present an adaptation of our protocol for Megrelishvili group key agreement as a variant of DHKE procedure.","PeriodicalId":266335,"journal":{"name":"2018 6th International Conference on Information and Communication Technology (ICoICT)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"On Generalized Divide and Conquer Approach for Group Key Distribution: Correctness and Complexity\",\"authors\":\"Ridhwan Dewoprabowo, Muhammad Arzaki, Yanti Rusmawati\",\"doi\":\"10.1109/ICOICT.2018.8528749\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article we present a generalized version of divide and conquer approach for contributory group Diffie-Hellman key exchange (DHKE) scheme. In particular, we devise an efficient way to establish a mutual secret key for multiple participants that uses a quasilinear amount of exponentiations with respect to the number of participants. The correctness of our protocol is proven using mathematical induction. We also compute its complexity in terms of total exponentiations within the protocol, analyze several important computational characteristics, and analyze the security of the protocol against passive attack. Moreover, we provide a comprehensive comparison of our protocol with other existing contributory schemes. Finally, we present an adaptation of our protocol for Megrelishvili group key agreement as a variant of DHKE procedure.\",\"PeriodicalId\":266335,\"journal\":{\"name\":\"2018 6th International Conference on Information and Communication Technology (ICoICT)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 6th International Conference on Information and Communication Technology (ICoICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOICT.2018.8528749\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 6th International Conference on Information and Communication Technology (ICoICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOICT.2018.8528749","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On Generalized Divide and Conquer Approach for Group Key Distribution: Correctness and Complexity
In this article we present a generalized version of divide and conquer approach for contributory group Diffie-Hellman key exchange (DHKE) scheme. In particular, we devise an efficient way to establish a mutual secret key for multiple participants that uses a quasilinear amount of exponentiations with respect to the number of participants. The correctness of our protocol is proven using mathematical induction. We also compute its complexity in terms of total exponentiations within the protocol, analyze several important computational characteristics, and analyze the security of the protocol against passive attack. Moreover, we provide a comprehensive comparison of our protocol with other existing contributory schemes. Finally, we present an adaptation of our protocol for Megrelishvili group key agreement as a variant of DHKE procedure.