The Exclusion of Malicious Routing Peers in Structured P2P Systems

Roh, Byeong‐hee; Kwon, O-Hoon; Hong, Sung Je; Kim, Jong

doi:10.1007/978-3-540-79705-0_4

Cited by 4 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If the next hop is too far away from the finger pointer, the source can infer some ongoing malicious activities. Roh et al use the iterative routing to detect suspicious routing [17]. At each hop, the source node checks if the routing message gets closer to the destination; otherwise a suspicious event is reported.…”

Section: Discussionmentioning

confidence: 99%

“…We do not study how to decide the security levels for different servers which should be addressed by application-specific methods orthogonal to CSR, or how to construct the trust model for detection of malicious nodes which has been widely studied in the literature [14], [15], [16], [17], [18], and we assume that there already has been a security hierarchy (e.g., a company's administrative structure). Section 7 will discuss how to incorporate these techniques to CSR.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

CSR: Classified Source Routing in Distributed Networks

Zhang

Sun

et al. 2018

IEEE Trans. Cloud Comput.

View full text Add to dashboard Cite

In recent years cloud computing provides a new way to address the constraints of limited energy, capabilities, and resources. Distributed hash table (DHT) based networks have become increasingly important for efficient communication in large-scale cloud systems. Previous studies mainly focus on improving the performance such as latency, scalability and robustness, but seldom consider the security demands on the routing paths, for example, bypassing untrusted intermediate nodes. Inspired by Internet source routing, in which the source nodes specify the routing paths taken by their packets, this paper presents CSR, a tag-based, Classified Source Routing scheme in DHT-based cloud networks to satisfy the security demands on the routing paths. Different from Internet source routing which requires some map of the overall network, CSR operates in a distributed manner where nodes with certain security level are tagged with a label and routing messages requiring that level of security are forwarded only to the qualified next-hops. We show how this can be achieved efficiently, by simple extensions of the traditional routing structures, and safely, so that the routing is uniformly convergent. The effectiveness of our proposals is demonstrated through theoretical analysis and extensive simulations.Index Terms-CSR (classified source routing), tag, path diversity, distributed hash table (DHT), DLG-de Bruijn (DdB).

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

CSR: Classified Source Routing in Distributed Networks

Zhang

Sun

et al. 2018

IEEE Trans. Cloud Comput.

View full text Add to dashboard Cite

show abstract

“…The P2P routing algorithm is the core of P2P protocol. A robust, efficient and reliable routing algorithm plays a pivotal role in solving problems that P2P network is facing; hence, many research institutions are focused on it Though current attack ways toward the P2P network are numerous (Keith and Minseok, 2009), most of the attacks are against the routing (Stefan and Udo, 2009), which is because the destruction of P2P routing may result in the collapse of the whole P2P network, while the price is very low (BongSoo et al, 2008;Dagon and Zou, 2006). Since the P2P routing mechanism is the key factor to determine the capability of the system against the network attacks, the network stability, the information security and the communication performance.…”

Section: Introductionmentioning

confidence: 99%

A Security Routing Algorithm of P2P Network Based on Multiple Encryption and Positive Detection

Lu¹,

Wu²,

Liu³

2013

RJASET

View full text Add to dashboard Cite

Routing plays a fundamental role in the P2P network. Most attacks are aiming at P2P routing. We proposed a novel security routing algorithm to fight against those attacks. The algorithm adopt the means of multiple encryption and positive detection and periodically detect each node in routing path using encryption packet, which can accurately find malicious or instable nodes in routing path and exclude them from routing table. Simulation experiments also demonstrate the algorithm can effectively enhance the routing security and reliability of P2P network.

show abstract