Copertina

When Should Selfish Miners Double-Spend?

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Doger, Mustafa, Ulukus, Sennur
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Cryptography and Security Distributed, Parallel, and Cluster Computing Discrete Mathematics Information Theory Probability
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Double Spending Analysis of Nakamoto Consensus for Time-Varying Mining Rates with Ruin Theory
di: Doger, Mustafa, et al.
Pubblicazione: (2024)

An Incentive-Compatible Semi-Parallel Proof-of-Work Protocol
di: Doger, Mustafa, et al.
Pubblicazione: (2025)

Transaction Capacity, Security and Latency in Blockchains
di: Doger, Mustafa, et al.
Pubblicazione: (2024)

Refined Bitcoin Security-Latency Under Network Delay
di: Doger, Mustafa, et al.
Pubblicazione: (2022)

PoW Security-Latency under Random Delays and the Effect of Transaction Fees
di: Doger, Mustafa, et al.
Pubblicazione: (2024)

Temporary Power Adjusting Withholding Attack
di: Doger, Mustafa, et al.
Pubblicazione: (2026)

SEDULity: A Proof-of-Learning Framework for Distributed and Secure Blockchains with Efficient Useful Work
di: Cao, Weihang, et al.
Pubblicazione: (2025)

Effect of Full Common Randomness Replication in Symmetric PIR on Graph-Based Replicated Systems
di: Meel, Shreya, et al.
Pubblicazione: (2025)

Incentive Attacks in BTC: Short-Term Revenue Changes and Long-Term Efficiencies
di: Doger, Mustafa, et al.
Pubblicazione: (2025)

Multi-Agent Distributed Optimization With Feasible Set Privacy
di: Meel, Shreya, et al.
Pubblicazione: (2025)

Optimal Multilevel Slashing for Blockchains
di: Wood, Kenan, et al.
Pubblicazione: (2024)

Variant Codes Based on A Special Polynomial Ring and Their Fast Computations
di: Yu, Leilei, et al.
Pubblicazione: (2023)

Partial Selfish Mining for More Profits
di: Yu, Jiaping, et al.
Pubblicazione: (2022)

Generic Selfish Mining MDP for DAG Protocols
di: Keller, Patrik
Pubblicazione: (2023)

Automated Selfish Mining Analysis for DAG-Based PoW Consensus Protocols
di: Keller, Patrik
Pubblicazione: (2025)

StealthDust: Secret Quorums for Faster Fractional Spending
di: Perion, Maxence, et al.
Pubblicazione: (2024)

COOL Is Optimal in Error-Free Asynchronous Byzantine Agreement
di: Chen, Jinyuan
Pubblicazione: (2025)

OciorABA: Improved Error-Free Asynchronous Byzantine Agreement via Partial Vector Agreement
di: Chen, Jinyuan
Pubblicazione: (2025)

Extending Asynchronous Byzantine Agreement with Crusader Agreement
di: Erbes, Mose Mizrahi, et al.
Pubblicazione: (2025)

OciorMVBA: Near-Optimal Error-Free Asynchronous MVBA
di: Chen, Jinyuan
Pubblicazione: (2024)

Consensus Capacity of Noisy Broadcast Channels
di: Sangwan, Neha, et al.
Pubblicazione: (2022)

A Randomised Approach to Distributed Sorting
di: Olesker-Taylor, Sam
Pubblicazione: (2025)

Undetectable Selfish Mining
di: Bahrani, Maryam, et al.
Pubblicazione: (2023)

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs
di: Döring, Michelle
Pubblicazione: (2025)

SPHERE: Spherical partitioning for large-scale routing optimization
di: Lindermann, Robert Fabian, et al.
Pubblicazione: (2025)

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
di: Bonamy, Marthe, et al.
Pubblicazione: (2025)

Convergence Sans Synchronization
di: Gupta, Arya Tanmay
Pubblicazione: (2025)

Asynchronous Cooperative Optimization of a Capacitated Vehicle Routing Problem Solution
di: Accorsi, Luca, et al.
Pubblicazione: (2025)

3-Majority and 2-Choices with Many Opinions
di: Shimizu, Nobutaka, et al.
Pubblicazione: (2025)

Learning-Based Approaches for Job Shop Scheduling Problems: A Review
di: Rihane, Karima, et al.
Pubblicazione: (2025)

Real-Time Service Subscription and Adaptive Offloading Control in Vehicular Edge Computing
di: Gao, Chuanchao, et al.
Pubblicazione: (2025)

Distance-based certification for leader election in meshed graphs and local recognition of their subclasses
di: Chalopin, Jérémie, et al.
Pubblicazione: (2026)

On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes
di: Li, Xiaorui, et al.
Pubblicazione: (2024)

Improved Distributed Algorithms for Random Colorings
di: Carlson, Charlie, et al.
Pubblicazione: (2023)

Jet: Multilevel Graph Partitioning on Graphics Processing Units
di: Gilbert, Michael S., et al.
Pubblicazione: (2023)

Lower bound for constant-size local certification
di: Martínez, Virgina Ardévol, et al.
Pubblicazione: (2022)

Efficient Computation in Congested Anonymous Dynamic Networks
di: Di Luna, Giuseppe A., et al.
Pubblicazione: (2023)

Optimal Computation in Anonymous Dynamic Networks
di: Di Luna, Giuseppe A., et al.
Pubblicazione: (2022)

Non-trivial automata networks do exist that solve the global majority problem with the local majority rule
di: Balbi, Pedro Paulo, et al.
Pubblicazione: (2026)

Efficient Approximation of Centrality Measures in Uncertain Graphs
di: Ketels, Daniel
Pubblicazione: (2024)