• Proceedings of the Korea Information Processing Society Conference
• /
• 2019.05a
• /
• pp.56-59
• /
• 2019

분산 해시 테이블은 {Key-Value} 형태의 해시 테이블을 시스템 내 노드들이 나누어 가지는 분산 시스템이다. 분산 해시 테이블 중 Kademlia는 Binary Tree 구조를 통해 노드 확장성을 가지고 XOR Metric을 이용하여 빠른 노드 탐색으로 다양한 분야에서 활용되고 있다. 하지만 노드 탐색 시 실제 상황을 배제하고 논리적인 거리만을 고려하여 라우팅 경로를 설정한다는 문제점을 가진다. 본 연구에서는 이 문제를 해결하기 위해 노드 탐색 시 노드 간의 대역폭과 물리적 거리를 고려하여 라우팅 테이블을 생성하는 Kademlia의 효율적인 노드 탐색 기법을 제안한다. 기존의 Kademlia와 유사한 수치의 Lookup Success Ratio와 Lookup Overhead Rates를 보이지만, End-to-End Delay가 감소한 것을 시뮬레이션을 통해 확인하였다.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.4
• /
• pp.695-707
• /
• 2013

DHT(Distributed Hash Table) networks such as Kademlia are vulnerable to the ID mapping attack caused by the voluntary DHT mapping structure where the location of a node is solely determined by itself on the network topology. This causes security problems such as eclipse, DRDoS and botnet C&C on DHT networks. To prevent ID mapping attacks, we propose a non-voluntary DHT mapping scheme and perform analysis on NAT compatibility, attack resistance, and network dynamicity. Analysis results show that our approach may have an equivalent level of attack resistance comparing with other defense mechanisms and overcome their limitations including NAT compatibility and network dynamicity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.10
• /
• pp.2731-2749
• /
• 2012

Sybil attack has been proved effective in mitigating the P2P botnet, but the impacts of some important parameters were not studied, and no model to estimate the effectiveness was proposed. In this paper, taking Kademlia-based botnets as the example, the model which has the upper and lower bound to estimate the mitigating performance of the Sybil attack is proposed. Through simulation, how three important factors affect the performance of the Sybil attack is analyzed, which is proved consistent with the model. The simulation results not only confirm that for P2P botnets in large scale, the Sybil attack is an effective countermeasure, but also imply that the model can give suggestions for the deployment of Sybil nodes to get the ideal performance in mitigating the P2P botnet.

• KNOM Review
• /
• v.24 no.2
• /
• pp.48-55
• /
• 2021

Ethereum is an open software platform based on blockchain technology that enables the construction and distribution of distributed applications. Ethereum uses a fully distributed connection method in which all participating nodes participate in the network with equal authority and rights. Ethereum networks use Kademlia-based node discovery protocols to retrieve and store node information. Ethereum is striving to stabilize the entire network topology by implementing node discovery protocols, but systems for monitoring are insufficient. This paper develops a WireShark dissector that can receive packet information in the Ethereum node discovery process and provides network packet measurement results. It can be used as basic data for the research on network performance improvement and vulnerability by analyzing the Ethereum node discovery process.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.20 no.3
• /
• pp.43-52
• /
• 2010

The Kad network is a peer-to-peer (P2P) network which implements the Kademlia P2P overlay protocol. Nowadays, the Kad network has attracted wide concern as a popular architecture for file sharing systems. Meanwhile, many problems have been coming out in these file sharing systems such as freeriding of users, uploading fake files, spreading viruses, and so on. In order to overcome these problems, we propose an incentive mechanism based on game theory, it establishes a more stable and efficient network environment for Kad users. Users who share valuable resources receive rewards by increasing their credits, while others who supply useless or harmful files are punished. This incentive mechanism in Kad network can be used to detect and prevent malicious behaviors of users and encourage honest interaction among users.