{"title":"一个简单的密钥协议协议","authors":"Eun-Kyung Ryu, Kee-Won Kim, K. Yoo","doi":"10.1109/CCST.2003.1297548","DOIUrl":null,"url":null,"abstract":"We propose a simple key agreement protocol(SKA) that provides key establishment with authentication over an insecure channel using only a human memorable password. The SKA is based on Diffie-Hellman scheme and has many of desirable security attributes: it resists off-line dictionary attacks mounted by either passive or active adversaries over network, allowing low-entropy passwords to be used safely. It also offers perfect forward secrecy, which protects past sessions and passwords against future compromise. Besides, it is secure against an adversary who captured a host's password file. Since user passwords are stored in a verifier form, the adversary cannot use it directly to compromise security. The proposed scheme here shows that it is more efficient in computational time and communication overhead over the existing schemes.","PeriodicalId":344868,"journal":{"name":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","volume":"174 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A simple key agreement protocol\",\"authors\":\"Eun-Kyung Ryu, Kee-Won Kim, K. Yoo\",\"doi\":\"10.1109/CCST.2003.1297548\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a simple key agreement protocol(SKA) that provides key establishment with authentication over an insecure channel using only a human memorable password. The SKA is based on Diffie-Hellman scheme and has many of desirable security attributes: it resists off-line dictionary attacks mounted by either passive or active adversaries over network, allowing low-entropy passwords to be used safely. It also offers perfect forward secrecy, which protects past sessions and passwords against future compromise. Besides, it is secure against an adversary who captured a host's password file. Since user passwords are stored in a verifier form, the adversary cannot use it directly to compromise security. The proposed scheme here shows that it is more efficient in computational time and communication overhead over the existing schemes.\",\"PeriodicalId\":344868,\"journal\":{\"name\":\"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.\",\"volume\":\"174 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCST.2003.1297548\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCST.2003.1297548","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We propose a simple key agreement protocol(SKA) that provides key establishment with authentication over an insecure channel using only a human memorable password. The SKA is based on Diffie-Hellman scheme and has many of desirable security attributes: it resists off-line dictionary attacks mounted by either passive or active adversaries over network, allowing low-entropy passwords to be used safely. It also offers perfect forward secrecy, which protects past sessions and passwords against future compromise. Besides, it is secure against an adversary who captured a host's password file. Since user passwords are stored in a verifier form, the adversary cannot use it directly to compromise security. The proposed scheme here shows that it is more efficient in computational time and communication overhead over the existing schemes.