A Semantic Layer for a Peer-to-Peer Based on a Distributed Hash Table

2011 ◽  
pp. 102-114
Author(s):  
Mohammed Ammari ◽  
Dalila Chiadmi ◽  
Laila Benhlima
Keyword(s):  
Hash Table ◽  
Peer To Peer ◽  
Distributed Hash Table ◽  
Semantic Layer

Security Enhancement of Peer-to-Peer Session Initiation

2012 ◽  
pp. 281-308
Author(s):  
Xianghan Zheng ◽  
Vladimir Oleshchuk
Keyword(s):  
Communication System ◽  
Communication Systems ◽  
Hash Table ◽  
Peer To Peer ◽  
Distributed Hash Table ◽  
Peer Communication ◽  
Security Issues ◽  
Security Enhancement ◽  
Advantages And Disadvantages ◽  
The Cost

Today, Peer-to-Peer SIP based communication systems have attracted much attention from both the academia and industry. The decentralized nature of P2P might provide the distributed peer-to-peer communication system without help of the traditional SIP server. However, the decentralization features come to the cost of the reduced manageability and create new concerns. Until now, the main focus of research was on the availability of the network and systems, while few attempts are put on protecting privacy. In this chapter, we investigate on P2PSIP security issues and introduce two enhancement solutions: central based security and distributed trust security, both of which have their own advantages and disadvantages. After that, we study appropriate combination of these two approaches to get optimized protection. Our design is independent of the DHT (Distributed Hash Table) overlay technology. We take the Chord overlay as the example, and then, analyze the system in several aspects: security & privacy, number-of the hops, message flows, etc.

Usage of Broadcast Messaging in a Distributed Hash Table for Intrusion Detection

2011 ◽  
pp. 77-93
Author(s):  
Zoltán Czirkos ◽  
Gábor Hosszú
Keyword(s):  
Intrusion Detection ◽  
Intrusion Detection System ◽  
Detection System ◽  
High Reliability ◽  
Hash Table ◽  
User Interaction ◽  
Overlay Network ◽  
Peer To Peer ◽  
Transport Layer ◽  
Distributed Hash Table

In this chapter, the authors present a novel peer-to-peer based intrusion detection system called Komondor, more specifically, its internals regarding the utilized peer-to-peer transport layer. The novelty of our intrusion detection system is that it is composed of independent software instances running on different hosts and is organized into a peer-to-peer network. The maintenance of this overlay network does not require any user interaction. The applied P2P overlay network model enables the nodes to communicate evenly over an unstable network. The base of our Komondor NIDS is a P2P network similar to Kademlia. To achieve high reliability and availability, we had to modify the Kademlia overlay network in such a way so that it would be resistent to network failures and support broadcast messages. The main purpose of this chapter is to present our modifications and enhancements on Kademlia.

scholarly journals IOTA-BT: A P2P File-Sharing System Based on IOTA

Electronics ◽  
2020 ◽  
Vol 9 (10) ◽  
pp. 1610 ◽  
Author(s):  
Li-Yuan Hou ◽  
Tsung-Yi Tang ◽  
Tyng-Yeu Liang
Keyword(s):  
Single Point ◽  
Hash Table ◽  
File Sharing ◽  
Peer To Peer ◽  
Cyber Attacks ◽  
Distributed Hash Table ◽  
P2p File Sharing ◽  
File Sharing System ◽  
Transaction Fees ◽  
Quantum Resistant Cryptography

BitTorrent (BT) is the most popular peer-to-peer file-sharing system. According to official BT information, more than 100 million active users use BT for file transfers every month. However, BT mainly relies on either a central tracker (tracker) or distributed hash table (DHT) for locating file seeders while it runs a risk of a single point of failure or cyber-attacks such as Sybil and Eclipses. To attack this problem, we proposed a Peer-to-Peer (P2P) file-sharing system called IOTA-BT by integrating BitTorrent with IOTA in this paper. The advantages of IOTA over blockchain include scalability for high throughput, compatibility with Internet of Things (IoT) footprints, zero transaction fees, partition-tolerant, and quantum-resistant cryptography. The autopeering and neighbor selection of the Coordicide of IOTA is aimed at defending a Sybil or Eclipse attack. IOTA-BT inherits these advantages from IOTA. Moreover, our experimental results have shown that the cost of executing BT functions, such as releasing torrent files and retrieving seeder information on IOTA-BT, is acceptable for improving the security of BT. IOTA-BT can indeed efficiently provide users with a P2P file-sharing environment of higher security.

scholarly journals Routing Protocols of Distributed Hash Table Based Peer to Peer Networks

2014 ◽  
Vol 16 (1) ◽  
pp. 70-74
Author(s):  
S. Rajalakshmi ◽  
◽  
S. Balaji ◽  
T.Godwin Selva Raja
Keyword(s):  
Routing Protocols ◽  
Hash Table ◽  
Peer To Peer ◽  
Peer Networks ◽  
Distributed Hash Table ◽  
Peer To Peer Networks

HIERARCHICAL PEER-TO-PEER SYSTEMS

2003 ◽  
Vol 13 (04) ◽  
pp. 643-657 ◽  
Author(s):  
L. GARCÉS-ERICE ◽  
E. W. BIERSACK ◽  
K. W. ROSS ◽  
P. A. FELBER ◽  
G. URVOY-KELLER
Keyword(s):  
Hash Table ◽  
Overlay Network ◽  
Peer To Peer ◽  
Distributed Hash Table ◽  
Hierarchical Design ◽  
P2p Systems ◽  
Lookup Services ◽  
Peer To Peer Systems ◽  
Responsible Group ◽  
Overlay Management

Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.

Token Based Mutual Exclusion in Peer-to-Peer Systems

2012 ◽  
pp. 214-228 ◽  
Author(s):  
Mayank Singh ◽  
Shashikala Tapaswi
Keyword(s):  
Distributed Systems ◽  
Message Passing ◽  
Mutual Exclusion ◽  
Hash Table ◽  
Peer To Peer ◽  
Distributed Hash Table ◽  
Shared Resources ◽  
Peer To Peer Systems ◽  
Mutual Exclusion Algorithm ◽  
Message Overhead

Mutual exclusion is one of the well-studied fundamental primitives in distributed systems, and a number of vital solutions have been proposed to achieve the same. However, the emerging Peer to Peer systems bring forward several challenges to protect consistent and concurrent access to shared resources, as classical peer-to-peer systems, like Napster, Gnutella, et cetera, have been mainly used for sharing files with read only permission. In this chapter, the authors propose a quorum based mutual exclusion algorithm that can be used over any Peer to Peer Distributed Hash Table (DHT). The proposed approach can be seen as extension to traditional Sigma protocol for mutual exclusion in Peer to Peer systems. The basic idea is to reduce message overhead with use of smart nodes present in each quorum set and message passing between the current owners of resource with next resource requester nodes.

scholarly journals Inserção de Infraestrutura de Chave Pública no Projeto OpenDHT

2021 ◽  
Author(s):  
Lucas V. Dias ◽  
Tiago A. Rizzetti ◽  
Wagner S. Brignol ◽  
Luciane N. Canha
Keyword(s):  
Hash Table ◽  
Peer To Peer ◽  
Distributed Hash Table

As redes de sobreposição peer-to-peer (P2P) baseadas em Distributed Hash Table (DHT) tem ganhado atenção na literatura devido as suas características como alta disponibilidade, escalabilidade, entre outras. Uma implementação popularmente conhecida é o projeto OpenDHT, contudo, não é abordada a autenticidade dos nós, nem das mensagens. Dessa forma, ela é suscetível a diversos ataques, entre eles, ataque Sybil. O objetivo do trabalho é apresentar uma proposta para preencher essa lacuna através de uma Infraestrutura de Chave Pública (ICP). Os resultados obtidos através da ferramenta Scyther demonstram a segurança do protocolo de autenticação contra ataques bem conhecidos e os testes práticos demonstram êxito da implementação.

Sign in / Sign up

Export Citation Format

Share Document