Preserving receiver's anonymity for circular structured P2P networks

Naghizadeh, Alireza; Berenjian, Samaneh; Razeghi, Behrooz; Shahanggar, Saghi; Pour, Nima Razagh

doi:10.1109/ccnc.2015.7157949

Cited by 10 publications

(4 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Random walk [36] and Flooding are the most commonly used searching techniques in unstructured networks [3,15,12]. Unstructured networks are less scalable, produce high network overhead and have lower search precision (due to queries being directed to irrelevant peers) compared to their structured counterparts [17,35,28,29]. Search precision also depends upon the number of hops a query travels.…”

Section: Related Workmentioning

confidence: 99%

Structuring communities for sharing human digital memories in a social P2P network

Rahman

Merabti

Llewellyn‐Jones

et al. 2020

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

Structuring communities for sharing human digital memories in a social P2P network

Rahman

Merabti

Llewellyn‐Jones

et al. 2020

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

show abstract

“…In this way, no one knows which one of these nodes is the exact one that has requested X . This concept is presented in .…”

Section: Sbt: Structural‐based Tunnelingmentioning

confidence: 99%

Structural‐based tunneling: preserving mutual anonymity for circular P2P networks

Naghizadeh

Berenjian

Meamari

et al. 2015

Int J Communication

View full text Add to dashboard Cite

Summary Many methods are suggested to preserve anonymity of users for peer‐to‐peer (P2P) networks. Most of these methods, by relying on established anonymous solutions on client/server applications, are presented for unstructured P2P networks. However, structured overlays, by using distributed hash tables for their routing, do not resemble traditional paradigms. Therefore, current anonymous methods cannot be implemented for them easily. In this paper, we introduce structural‐based tunneling (SBT) to provide mutual anonymity for circular P2P structures. In this method, we get help from inherited features of network infrastructure to establish a standard way for making tunnels. SBT introduces a flexible design that is able to manage different parts of the tunnels on current infrastructures. For this purpose, we incorporate SBT with Chord to show how such design can be managed for real‐world applications. The results of applied method with simulations show that by managing critical features of SBT, a trade‐off can be made between stronger security and performance of the network. Copyright © 2015 John Wiley & Sons, Ltd.

show abstract

“…In these networks, each node uses the resources of other users and also has the capability to provide resources for other nodes [1], [2]. These networks have many applications, including file sharing, distributed processing and messages passing to other nodes which can cause many security problems [3], [4]. P2P networks are highly dependent on resources of their own users [5].…”

Section: Introductionmentioning

confidence: 99%

An Incentive Security Model to Provide Fairness for Peer-to-Peer Networks

Berenjian¹,

Hajizadeh²,

Atani³

2019

Preprint

Self Cite

View full text Add to dashboard Cite

Peer-to-Peer networks are designed to rely on resources of their own users. Therefore, resource management plays an important role in P2P protocols. Therefore, resource management plays an important role in P2P protocols. Early P2P networks did not use proper mechanisms to manage fairness. However, after seeing difficulties and rise of freeloaders in networks like Gnutella, the importance of providing fairness for users have become apparent. In this paper, we propose an incentive based security model which leads to a network infrastructure that lightens the work of Seeders and makes Leechers to contribute more. This method is able to prevent betrayals in Leecher-to-Leecher transactions and more importantly, helps Seeders to be treated more fairly. This is what other incentive methods such as Bittorrent are incapable of doing. Additionally, by getting help from cryptography and combining it with our method, it is also possible to achieve secure channels, immune to spying, next to a fair network. The simulation results clearly show that how our proposed approach can overcome free-riding issue. In addition, our findings revealed that our approach is able to provide an appropriate level of fairness for the users and can decrease the download time.

show abstract

Preserving receiver's anonymity for circular structured P2P networks

Cited by 10 publications

References 21 publications

Structuring communities for sharing human digital memories in a social P2P network

Structuring communities for sharing human digital memories in a social P2P network

Structural‐based tunneling: preserving mutual anonymity for circular P2P networks

An Incentive Security Model to Provide Fairness for Peer-to-Peer Networks

Contact Info

Product

Resources

About