Proposal and performance evaluation of Hash-based authentication for P2P network

Atushi Takeda, Debasish Chakraborty, Gen Kitagata, Kazuo Hashimoto, Norio Shiratori

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Recently, P2P networks have been evolving rapidly. Efficient authentication of P2P network nodes remains a difficult task. As described herein, we propose an authentication method called Hash-based Distributed Authentication Method (HDAM), which realizes a decentralized efficient mutual authentication mechanism for each pair of nodes in a P2P network. It performs distributed management of public keys using Web of Trust and a Distributed Hash Table. The scheme markedly reduces both the memory size requirement and the overhead of communication data sent by the nodes. Simulation results show that HDAM can reduce the required memory size by up to 95%. Furthermore, the results show that HDAM is more scalable than the conventional method: the communication overhead of HDAM is O(log p).

Original languageEnglish
Pages (from-to)59-71
Number of pages13
JournalJournal of Information Processing
Volume17
DOIs
Publication statusPublished - 2009
Externally publishedYes

Fingerprint

Authentication
Data storage equipment
Communication

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Proposal and performance evaluation of Hash-based authentication for P2P network. / Takeda, Atushi; Chakraborty, Debasish; Kitagata, Gen; Hashimoto, Kazuo; Shiratori, Norio.

In: Journal of Information Processing, Vol. 17, 2009, p. 59-71.

Research output: Contribution to journalArticle

Takeda, Atushi ; Chakraborty, Debasish ; Kitagata, Gen ; Hashimoto, Kazuo ; Shiratori, Norio. / Proposal and performance evaluation of Hash-based authentication for P2P network. In: Journal of Information Processing. 2009 ; Vol. 17. pp. 59-71.
@article{5137287864de48e6a491401db775e286,
title = "Proposal and performance evaluation of Hash-based authentication for P2P network",
abstract = "Recently, P2P networks have been evolving rapidly. Efficient authentication of P2P network nodes remains a difficult task. As described herein, we propose an authentication method called Hash-based Distributed Authentication Method (HDAM), which realizes a decentralized efficient mutual authentication mechanism for each pair of nodes in a P2P network. It performs distributed management of public keys using Web of Trust and a Distributed Hash Table. The scheme markedly reduces both the memory size requirement and the overhead of communication data sent by the nodes. Simulation results show that HDAM can reduce the required memory size by up to 95{\%}. Furthermore, the results show that HDAM is more scalable than the conventional method: the communication overhead of HDAM is O(log p).",
author = "Atushi Takeda and Debasish Chakraborty and Gen Kitagata and Kazuo Hashimoto and Norio Shiratori",
year = "2009",
doi = "10.2197/ipsjjip.17.59",
language = "English",
volume = "17",
pages = "59--71",
journal = "Journal of Information Processing",
issn = "0387-5806",
publisher = "Information Processing Society of Japan",

}

TY - JOUR

T1 - Proposal and performance evaluation of Hash-based authentication for P2P network

AU - Takeda, Atushi

AU - Chakraborty, Debasish

AU - Kitagata, Gen

AU - Hashimoto, Kazuo

AU - Shiratori, Norio

PY - 2009

Y1 - 2009

N2 - Recently, P2P networks have been evolving rapidly. Efficient authentication of P2P network nodes remains a difficult task. As described herein, we propose an authentication method called Hash-based Distributed Authentication Method (HDAM), which realizes a decentralized efficient mutual authentication mechanism for each pair of nodes in a P2P network. It performs distributed management of public keys using Web of Trust and a Distributed Hash Table. The scheme markedly reduces both the memory size requirement and the overhead of communication data sent by the nodes. Simulation results show that HDAM can reduce the required memory size by up to 95%. Furthermore, the results show that HDAM is more scalable than the conventional method: the communication overhead of HDAM is O(log p).

AB - Recently, P2P networks have been evolving rapidly. Efficient authentication of P2P network nodes remains a difficult task. As described herein, we propose an authentication method called Hash-based Distributed Authentication Method (HDAM), which realizes a decentralized efficient mutual authentication mechanism for each pair of nodes in a P2P network. It performs distributed management of public keys using Web of Trust and a Distributed Hash Table. The scheme markedly reduces both the memory size requirement and the overhead of communication data sent by the nodes. Simulation results show that HDAM can reduce the required memory size by up to 95%. Furthermore, the results show that HDAM is more scalable than the conventional method: the communication overhead of HDAM is O(log p).

UR - http://www.scopus.com/inward/record.url?scp=79955739952&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79955739952&partnerID=8YFLogxK

U2 - 10.2197/ipsjjip.17.59

DO - 10.2197/ipsjjip.17.59

M3 - Article

VL - 17

SP - 59

EP - 71

JO - Journal of Information Processing

JF - Journal of Information Processing

SN - 0387-5806

ER -