Moving peers in distributed, location-based peer-to-peer overlays

Amft, Tobias; Graffi, Kálmán

doi:10.1109/iccnc.2017.7876253

Cited by 5 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several theories have been taken into consideration for the systematic development of overlays with desired properties such as locality awareness, anonymity, mobility and other features [77]. Examples include Geodemlia [78] and LobSter [79] which are location-aware overlays, FRoDO [80] which supports anonymous communications.…”

Section: Other Overlay Considerationsmentioning

confidence: 99%

Peer-to-Peer-Based Social Networks: A Comprehensive Survey

Masinde

Graffi

2020

SN COMPUT. SCI.

Self Cite

View full text Add to dashboard Cite

The use of online social networks, such as Facebook and Twitter, has grown at a phenomenal rate. These platforms offer services that support interactions via messaging, chatting or audio/video conferencing, and also sharing of content. Most, if not all, of these platforms use centralized computing systems; therefore, the control and management of the systems lies entirely in the hands of one provider, who must be trusted to treat the data and communication traces securely. As a zero-trust alternative, peer-to-peer (P2P) technologies promise to support end-to-end communication, uncompromising access control, anonymity and resilience against censorship and massive data leaks through misused trust. The goals of this survey are threefold. First, the survey elaborates the properties of P2P-based online social networks and defines the requirements for such (zero-trust) platforms. Second, it gives an exposition of the building blocks for P2P frameworks that allow the creation of such sophisticated and demanding applications, such as user/identity management, reliable data storage, secure communication, access control and general-purpose extensibility, which are not properly addressed in other P2P surveys. As a third point, it gives a comprehensive analysis of proposed P2P-based online social network applications, frameworks and architectures by exploring the technical details, inter-dependencies and maturity of these solutions.

show abstract

Section: Other Overlay Considerationsmentioning

confidence: 99%

Peer-to-Peer-Based Social Networks: A Comprehensive Survey

Masinde

Graffi

2020

SN COMPUT. SCI.

Self Cite

View full text Add to dashboard Cite

show abstract

“…4) Other overlay considerations: Several theories have been taken into consideration for the systematic development of overlays with desired properties such as locality awareness, anonymity, mobility and other features [103]. Examples include Geodemlia [104] and LobSter [105] which are location-aware overlays, FRoDO [106] which supports anonymous communications.…”

Section: A Overlay Structuresmentioning

confidence: 99%

Peer-to-Peer based Social Networks: A Comprehensive Survey

Masinde¹,

Graffi²

2020

Preprint

Self Cite

View full text Add to dashboard Cite

Online social networks, such as Facebook and twitter, are a growing phenomenon in today's world, with various platforms providing capabilities for individuals to collaborate through messaging and chatting as well as sharing of content such as videos and photos. Most, if not all, of these platforms are based on centralized computing systems, meaning that the control and management of the systems lies in the hand of one provider, which must be trusted to treat the data and communication traces securely. While users aim for privacy and data sovereignty, often the providers aim to monetize the data they store. Even, federated privately run social networks require a few enthusiasts that serve the community and have, through that, access to the data they manage. As a zero-trust alternative, peer-to-peer (P2P) technologies promise networks that are self organizing and secure-by-design, in which the final data sovereignty lies at the corresponding user. Such networks support endto-end communication, uncompromising access control, anonymity and resilience against censorship and massive data leaks through misused trust. The goals of this survey are three-fold. Firstly, the survey elaborates the properties of P2P-based online social networks and defines the requirements for such (zero-trust) platforms. Secondly, it elaborates on the building blocks for P2P frameworks that allow the creation of such sophisticated and demanding applications, such as user/identity management, reliable data storage, secure communication, access control and general-purpose extensibility, features that are not addressed in other P2P surveys. As a third point, it gives an overview of proposed P2P-based online social network applications, frameworks and architectures. In specific, it explores the technical details, inter-dependencies and maturity of the available solutions.

show abstract

“…This is, for example, shown by the following: a recent work that uses Chord in large scaled P2P networks in conjunction with a dynamic trust computing model [19], as well as recent studies on the further improvement of Chord inherent efficiency [20] and correctness [21], or on the joining time of Chord nodes through the usage of anchor peers in an educational scenario [22]. Further recent contributions have concerned the usage of Chord in mobile networks [23] and for location-based services [24]; therefore, Chord's security and reliability are still important aspects to be carefully assessed and studied. Some solutions for improving Chord's security are already present in the relevant literature, such as [25] where the authors deploy certificates and signatures.…”

Section: Background and Related Workmentioning

confidence: 99%

A Balanced Trust-Based Method to Counter Sybil and Spartacus Attacks in Chord

Pecori

Veltri

2018

Security and Communication Networks

View full text Add to dashboard Cite

A Sybil attack is one of the main challenges to be addressed when securing peer-to-peer networks, especially those based on Distributed Hash Tables (DHTs). Tampering routing tables by means of multiple fake identities can make routing, storing, and retrieving operations significantly more difficult and time-consuming. Countermeasures based on trust and reputation have already proven to be effective in some contexts, but one variant of the Sybil attack, the Spartacus attack, is emerging as a new threat and its effects are even riskier and more difficult to stymie. In this paper, we first improve a well-known and deployed DHT (Chord) through a solution mixing trust with standard operations, for facing a Sybil attack affecting either routing or storage and retrieval operations. This is done by maintaining the least possible overhead for peers. Moreover, we extend the solution we propose in order for it to be resilient also against a Spartacus attack, both for an iterative and for a recursive lookup procedure. Finally, we validate our findings by showing that the proposed techniques outperform other trust-based solutions already known in the literature as well.

show abstract

Moving peers in distributed, location-based peer-to-peer overlays

Cited by 5 publications

References 20 publications

Peer-to-Peer-Based Social Networks: A Comprehensive Survey

Peer-to-Peer-Based Social Networks: A Comprehensive Survey

Peer-to-Peer based Social Networks: A Comprehensive Survey

A Balanced Trust-Based Method to Counter Sybil and Spartacus Attacks in Chord

Contact Info

Product

Resources

About