Bankrupting Sybil despite churn

DOI10.1016/j.jcss.2023.02.004OpenAlexW3092853913MaRDI QIDQ2698290

Maxwell Young, Jared Saia, Diksha Gupta

Publication date: 21 April 2023

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.06834

zbMATH Keywords

securitydistributed computingSybil attackalgorithm design and analysisresource burning

Mathematics Subject Classification ID

Computer science (68-XX)

Uses Software

• Chord

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interactive communication with unknown noise rate
• Fast Byzantine leader election in dynamic networks
• Proofs of Work from worst-case assumptions
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• Simple proofs of space-time and rational proofs of storage
• Distributed agreement in dynamic peer-to-peer networks
• A survey of DHT security techniques
• Making evildoers pay
• Conflict on a communication channel
• reCAPTCHA: Human-Based Character Recognition via Web Security Measures
• PoW-Based Distributed Cryptography with No Trusted Setup
• How to spread adversarial nodes?
• How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness
• Resource Burning for Permissionless Systems (Invited Paper)
• Bootstrapping Public Blockchains Without a Trusted Setup
• Analysis of the evolution of peer-to-peer systems
• Highly dynamic distributed computing with byzantine failures
• A Distributed and Oblivious Heap
• Informant: Detecting Sybils Using Incentives
• Automata, Languages and Programming
• Algorithms – ESA 2005
• Modeling Bitcoin Contracts by Timed Automata
• Concentration of Measure for the Analysis of Randomized Algorithms

This page was built for publication: Bankrupting Sybil despite churn