Secure Peer Sampling Service: The Mosquito Attack

Jesi, Gian Paolo; Montresor, Alberto

doi:10.1109/wetice.2009.15

Cited by 2 publications

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Surprisingly, this intrinsic weak integrity constraint complies to reality; in real-world P2P file-sharing systems (see [9,10,13]), when a peer receives an advertisement for an item, it does not usually verify its validity. Another kind of malicious cache attack have been proposed [7] but, in this work, we restrict to this one; however, the presented SPSS approach is also suited for this other cache attack.…”

Section: Gossip and Attack Modelmentioning

confidence: 99%

Prestige-based peer sampling service

Jesi

Mollona

Nair

et al. 2009

Proceedings of the 2009 ACM Symposium on Applied Computing

Self Cite

View full text Add to dashboard Cite

The Peer Sampling Service (PSS) has been proposed as a method to initiate and maintain the set of connections between nodes in unstructured peer to peer (P2P) networks. The PSS usually relies on gossip-style communication where participants exchange their links in a randomized way. However, the PSS network organization can be easily modified by malicious nodes running a "hub attack", in which they achieve a leading structural position. From this prestigious status, the malicious nodes can severely affect the overlay and achieve several application dependent advantages. We present a novel method to overcome this attack and provide results from simulation experiments that validate our claim. This method is inspired by a simple technique used to detect social leaders in firm's organizations that is based on the social (structural) "prestige" of actors.

show abstract

Section: Gossip and Attack Modelmentioning

confidence: 99%

Prestige-based peer sampling service

Jesi

Mollona

Nair

et al. 2009

Proceedings of the 2009 ACM Symposium on Applied Computing

Self Cite

View full text Add to dashboard Cite

show abstract

SecureCyclon: Dependable Peer Sampling

Antonov,

Voulgaris

2023

2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)

View full text Add to dashboard Cite

Overlay management is the cornerstone of building robust and dependable Peer-to-Peer systems. A key component for building such overlays is the peer-sampling service, a mechanism that continuously supplies each node with a set of up-to-date peers randomly selected across all alive nodes. Arguably, the most pernicious malicious action against such mechanisms is the provision of arbitrarily created links that point at malicious nodes. This paper proposes SECURECYCLON, a peer-sampling protocol that deterministically eliminates the ability of malicious nodes to overrepresent themselves in Peerto-Peer overlays. To the best of our knowledge, this is the first protocol to offer this property, as previous works were able to only bound the proportion of excessive links to malicious nodes, without completely eliminating them. SECURECYCLON redefines the concept of node descriptors from just being containers of information that enable communication with specific nodes, to being communication certificates that traverse the network and enable nodes to provably discover malicious nodes. We evaluate our solution with the conduction of extended simulations, and we demonstrate that it provides resilience even at the extreme condition of 40% malicious node participation.

show abstract

Secure Peer Sampling Service: The Mosquito Attack

Abstract: Abstract

Cited by 2 publications

References 15 publications

Prestige-based peer sampling service

Prestige-based peer sampling service

SecureCyclon: Dependable Peer Sampling

Contact Info

Product

Resources

About