Foiling Sybils with HAPS in Permissionless Systems: An Address-based Peer Sampling Service

Pilet, Amaury Bouchra; Frey, Davide; Taı̈ani, François

doi:10.1109/iscc50000.2020.9219606

Cited by 2 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a real-world deployment, a Sybil-resilient peer discovery service would be necessary. However, this problem is orthogonal to our approach, and existing solutions already exist [13].…”

Section: Methodsmentioning

confidence: 99%

Dandelion: multiplexing Byzantine agreements to unlock blockchain performance

Korkmaz,

Bruneau-Queyreix,

Mokthar

et al. 2021

Preprint

View full text Add to dashboard Cite

Permissionless blockchain protocols are known to consume an outrageous amount of computing power and suffer from a trade-off between latency and confidence in transaction confirmation. The recently proposed Algorand blockchain protocol employs Byzantine agreements and has shown transaction confirmation latency on the order of seconds. Its strong resilience to Denial-of-Service and Sybil attacks and its low computing power footprint make it a strong candidate for the venue of decentralized economies and business ecosystems across industries. Nevertheless, Algorand's throughput is still far from the requirements of such applications. In this paper, we empower Algorand's protocol by multiplexing its byzantine agreements in order to improve performance. Experiments on wide area networks with up to ten thousand nodes show a 4-fold throughput increase compared to the original Algorand protocol.

show abstract

“…In a real-world deployment, a Sybil-resilient peer discovery service would be necessary. However, this problem is orthogonal to our approach, and existing solutions already exist [13].…”

Section: Methodsmentioning

confidence: 99%

Dandelion: multiplexing Byzantine agreements to unlock blockchain performance

Korkmaz,

Bruneau-Queyreix,

Mokthar

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…By categorizing peers based on their IP prefixes, HAPS [27] instructs nodes to pick neighbors with a high diversity of IP prefixes. The underlying rationale behind [27] is based on the notion that the acquisition of IP addresses with diverse IP prefixes entails significant costs, rendering it difficult for a malicious party to consolidate a large number of descriptors in a single node's view.…”

Section: Related Workmentioning

confidence: 99%

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

Foiling Sybils with HAPS in Permissionless Systems: An Address-based Peer Sampling Service

Abstract: This paper has been published in the 2020 IEEE Symposium on Computers and Communications (ISCC), its published version is available on IEEE Xplore.

Cited by 2 publications

References 19 publications

Dandelion: multiplexing Byzantine agreements to unlock blockchain performance

Dandelion: multiplexing Byzantine agreements to unlock blockchain performance

SecureCyclon: Dependable Peer Sampling

Contact Info

Product

Resources

About