Resource Burning for Permissionless Systems (Invited Paper)

DOI10.1007/978-3-030-54921-3_2OpenAlexW3046646835MaRDI QIDQ5100943

Diksha Gupta, Jared Saia, Maxwell Young

Publication date: 1 September 2022

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Related Items (1)

Bankrupting Sybil despite churn

Uses Software

• Chord
• BATON
• Pastry
• SpEagle
• FRAUDAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards a scalable and robust DHT
• Reducing communication costs in robust peer-to-peer networks
• Robust random number generation for peer-to-peer systems
• Fast Byzantine leader election in dynamic networks
• Proofs of Work from worst-case assumptions
• Ouroboros: a provably secure proof-of-stake blockchain protocol
• A theoretical and empirical evaluation of an algorithm for self-healing computation
• Simple proofs of space-time and rational proofs of storage
• D2B: A de Bruijn based content-addressable network
• Who are you? Secure identities in single hop ad hoc networks
• Burning money and (pseudo) first-mover advantages: an experimental study on forward induction
• A survey of DHT security techniques
• Proofs of Space: When Space Is of the Essence
• The Bitcoin Backbone Protocol: Analysis and Applications
• reCAPTCHA: Human-Based Character Recognition via Web Security Measures
• PoW-Based Distributed Cryptography with No Trusted Setup
• Proofs of Space
• Novel architectures for P2P applications
• Communities, Random Walks, and Social Sybil Defense
• Bootstrapping Public Blockchains Without a Trusted Setup
• Fast byzantine agreement in dynamic networks
• Highly dynamic distributed computing with byzantine failures
• On the establishment of distinct identities in overlay networks
• A Distributed and Oblivious Heap
• Advances in Cryptology - CRYPTO 2003
• Algorithms – ESA 2005
• Distributed Computing

This page was built for publication: Resource Burning for Permissionless Systems (Invited Paper)