{"title":"基于密码设置中的多方密钥协议","authors":"Ratna Dutta","doi":"10.1109/AMS.2007.69","DOIUrl":null,"url":null,"abstract":"In this work, we study the problem of designing efficient password-based encrypted key agreement protocol in multi-party scenario. Recently, Dutta-Barua proposed a constant round group key agreement DB, which is a simple variant of Burmester-Desmedt protocol BD. In this paper, we present a simple and elegant contributory group key agreement in password-based setting, derived from the protocol DB. We have made several modifications in the protocol DB and then enhance it to password-based setting. The security of the proposed scheme against dictionary attacks is in the ideal cipher model under decision Diffie-Hellman (DDH) assumption. We analyze our protocol in the security framework formalized by Bellare et al. Our proposed scheme achieves efficiency over the work of Bresson et al. in terms of both computation and communication power","PeriodicalId":198751,"journal":{"name":"First Asia International Conference on Modelling & Simulation (AMS'07)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Multi-Party Key Agreement in Password-Based Setting\",\"authors\":\"Ratna Dutta\",\"doi\":\"10.1109/AMS.2007.69\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work, we study the problem of designing efficient password-based encrypted key agreement protocol in multi-party scenario. Recently, Dutta-Barua proposed a constant round group key agreement DB, which is a simple variant of Burmester-Desmedt protocol BD. In this paper, we present a simple and elegant contributory group key agreement in password-based setting, derived from the protocol DB. We have made several modifications in the protocol DB and then enhance it to password-based setting. The security of the proposed scheme against dictionary attacks is in the ideal cipher model under decision Diffie-Hellman (DDH) assumption. We analyze our protocol in the security framework formalized by Bellare et al. Our proposed scheme achieves efficiency over the work of Bresson et al. in terms of both computation and communication power\",\"PeriodicalId\":198751,\"journal\":{\"name\":\"First Asia International Conference on Modelling & Simulation (AMS'07)\",\"volume\":\"91 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"First Asia International Conference on Modelling & Simulation (AMS'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AMS.2007.69\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"First Asia International Conference on Modelling & Simulation (AMS'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AMS.2007.69","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Multi-Party Key Agreement in Password-Based Setting
In this work, we study the problem of designing efficient password-based encrypted key agreement protocol in multi-party scenario. Recently, Dutta-Barua proposed a constant round group key agreement DB, which is a simple variant of Burmester-Desmedt protocol BD. In this paper, we present a simple and elegant contributory group key agreement in password-based setting, derived from the protocol DB. We have made several modifications in the protocol DB and then enhance it to password-based setting. The security of the proposed scheme against dictionary attacks is in the ideal cipher model under decision Diffie-Hellman (DDH) assumption. We analyze our protocol in the security framework formalized by Bellare et al. Our proposed scheme achieves efficiency over the work of Bresson et al. in terms of both computation and communication power