Atsushi Takeda, K. Hashimoto, G. Kitagata, S. Zabir, Tetsuo Kinoshita, N. Shiratori
{"title":"基于分布式哈希表的P2P网络认证新方法","authors":"Atsushi Takeda, K. Hashimoto, G. Kitagata, S. Zabir, Tetsuo Kinoshita, N. Shiratori","doi":"10.1109/WAINA.2008.203","DOIUrl":null,"url":null,"abstract":"In recent years, P2P networks have been evolving at a rapid pace. Authentication of nodes in P2P networks, however, remains a difficult task to conduct efficiently. In this paper, we therefore propose a new authentication method called hash-based distributed authentication method (HDAM). HDAM realizes a decentralized efficient mutual authentication mechanism for each pair of nodes in the P2P network. It performs a distributed management of public keys by using Web of trust and distributed hash table. Our proposal significantly reduces both the memory size requirement and the overhead of communication data sent by the nodes.","PeriodicalId":170418,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"A New Authentication Method with Distributed Hash Table for P2P Network\",\"authors\":\"Atsushi Takeda, K. Hashimoto, G. Kitagata, S. Zabir, Tetsuo Kinoshita, N. Shiratori\",\"doi\":\"10.1109/WAINA.2008.203\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, P2P networks have been evolving at a rapid pace. Authentication of nodes in P2P networks, however, remains a difficult task to conduct efficiently. In this paper, we therefore propose a new authentication method called hash-based distributed authentication method (HDAM). HDAM realizes a decentralized efficient mutual authentication mechanism for each pair of nodes in the P2P network. It performs a distributed management of public keys by using Web of trust and distributed hash table. Our proposal significantly reduces both the memory size requirement and the overhead of communication data sent by the nodes.\",\"PeriodicalId\":170418,\"journal\":{\"name\":\"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WAINA.2008.203\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WAINA.2008.203","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A New Authentication Method with Distributed Hash Table for P2P Network
In recent years, P2P networks have been evolving at a rapid pace. Authentication of nodes in P2P networks, however, remains a difficult task to conduct efficiently. In this paper, we therefore propose a new authentication method called hash-based distributed authentication method (HDAM). HDAM realizes a decentralized efficient mutual authentication mechanism for each pair of nodes in the P2P network. It performs a distributed management of public keys by using Web of trust and distributed hash table. Our proposal significantly reduces both the memory size requirement and the overhead of communication data sent by the nodes.