A new scalable distributed authentication for P2P network and its performance evaluation

Authors:
Atushi Takeda;Debasish Chakraborty;Gen Kitagata;Kazuo Hashimoto;Norio Shiratori
Affiliations:
Tohoku University, Graduate School of Information Science, Aoba-ku, Sendai, Japan;Tohoku University, Research Institute of Electrical Communication, Aoba-ku, Sendai, Japan;Tohoku University, Research Institute of Electrical Communication, Aoba-ku, Sendai, Japan;Tohoku University, Graduate School of Information Science, Aoba-ku, Sendai, Japan;Tohoku University, Research Institute of Electrical Communication, Aoba-ku, Sendai, Japan
Venue:
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Year:
2008

Citing 5
Cited 1

PGP: Pretty Good Privacy

PGP: Pretty Good Privacy
Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
Self-Organized Public-Key Management for Mobile Ad Hoc Networks

IEEE Transactions on Mobile Computing
Improving Routing Security Using a Decentralized Public Key Distribution Algorithm

ICIMP '07 Proceedings of the Second International Conference on Internet Monitoring and Protection
A New Authentication Method with Distributed Hash Table for P2P Network

AINAW '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops

Implementation of real-time video conference system using high speed multimedia communication

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently P2P networks become more and more popular. Though they have many advantages, P2P networks suffer from authentication of nodes. To overcome this problem, a new authentication method called Hash-based Distributed Authentication Method (HDAM) is proposed. 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 proposed scheme significantly reduces both the memory size requirement and the overhead of communication data sent by the nodes. Additionally, the results also show that required resource size of HDAM is O(logN) and HDAM is more scalable than the conventional method.