{"title":"A Time Constraint Three-Party Encrypted Key Exchange Protocol","authors":"Hsing-Chung Chen, Syuan-Zong Lin, Yung-Fa Huang, Hsien-Yun Chuang","doi":"10.1109/BWCCA.2011.86","DOIUrl":null,"url":null,"abstract":"We propose a time constraint three-party encrypted key exchange protocol in which both two parties/clients only act as the roles within the relationship of exchanging secure messages constrained by the intersection time periods. The technique of time constraint, in this paper, is that a trusted server generates a serial of secure exchanging messages, which are used to generate multiple session keys by each party individually. Each session key corresponding to one time period which is belonging to the intersection set from both two parties' requesting time bounds. Only both two authorized parties/clients can communicate to each other within the intersection set of time bounds. It can get better performance on when three parties do many times for traditional 3PEKE protocol. Our approach can improve the performance of traditional 3PEKE scheme via the technique of time constraint. Furthermore, we proof the scheme can also against the password guessing attack as well as replay attack.","PeriodicalId":391671,"journal":{"name":"2011 International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"124 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Broadband and Wireless Computing, Communication and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BWCCA.2011.86","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
We propose a time constraint three-party encrypted key exchange protocol in which both two parties/clients only act as the roles within the relationship of exchanging secure messages constrained by the intersection time periods. The technique of time constraint, in this paper, is that a trusted server generates a serial of secure exchanging messages, which are used to generate multiple session keys by each party individually. Each session key corresponding to one time period which is belonging to the intersection set from both two parties' requesting time bounds. Only both two authorized parties/clients can communicate to each other within the intersection set of time bounds. It can get better performance on when three parties do many times for traditional 3PEKE protocol. Our approach can improve the performance of traditional 3PEKE scheme via the technique of time constraint. Furthermore, we proof the scheme can also against the password guessing attack as well as replay attack.