Bankrupting Sybil despite churn
From MaRDI portal
Recommendations
Cites work
- A Distributed and Oblivious Heap
- A survey of DHT security techniques
- Algorithms – ESA 2005
- Analysis of the evolution of peer-to-peer systems
- Automata, Languages and Programming
- Bootstrapping Public Blockchains Without a Trusted Setup
- Concentration of Measure for the Analysis of Randomized Algorithms
- Conflict on a communication channel
- Distributed agreement in dynamic peer-to-peer networks
- Fast Byzantine leader election in dynamic networks
- Highly dynamic distributed computing with Byzantine failures
- How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness
- How to spread adversarial nodes?
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 708802 (Why is no real title available?)
- scientific article; zbMATH DE number 2009963 (Why is no real title available?)
- scientific article; zbMATH DE number 1931792 (Why is no real title available?)
- scientific article; zbMATH DE number 1931811 (Why is no real title available?)
- Informant: Detecting Sybils Using Incentives
- Making evildoers pay, resource-competitive broadcast in sensor networks
- Modeling Bitcoin contracts by timed automata
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- PoW-based distributed cryptography with no trusted setup
- Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
- Proofs of Work from worst-case assumptions
- reCAPTCHA: human-based character recognition via web security measures
- Resource Burning for Permissionless Systems (Invited Paper)
- Simple proofs of space-time and rational proofs of storage
- Towards robust and efficient computation in dynamic peer-to-peer networks
Cited in
(3)
This page was built for publication: Bankrupting Sybil despite churn
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698290)