May 29, 2023, 1:10 a.m. | Martin Perešíni, Ivan Homoliak, Federico Matteo Benčić, Martin Hrubý, Kamil Malinka

cs.CR updates on arXiv.org arxiv.org

Several blockchain consensus protocols proposed to use of Directed Acyclic
Graphs (DAGs) to solve the limited processing throughput of traditional
single-chain Proof-of-Work (PoW) blockchains. Many such protocols utilize a
random transaction selection (RTS) strategy (e.g., PHANTOM, GHOSTDAG, SPECTRE,
Inclusive, and Prism) to avoid transaction duplicates across parallel blocks in
DAG and thus maximize the network throughput. However, previous research has
not rigorously examined incentive-oriented greedy behaviors when transaction
selection deviates from the protocol. In this work, we first perform a …

attacks blockchain blockchains graphs pow protocols random single spectre strategy transaction work

SOC 2 Manager, Audit and Certification

@ Deloitte | US and CA Multiple Locations

Director, Cybersecurity - Governance, Risk and Compliance (GRC)

@ Stanley Black & Decker | New Britain CT USA - 1000 Stanley Dr

Information Security Risk Metrics Lead

@ Live Nation Entertainment | Work At Home-Connecticut

IT Product Owner - Enterprise DevSec Platform (d/f/m)

@ Airbus | Hamburg - Finkenwerder

Senior Information Security Specialist

@ Arthur Grand Technologies Inc | Arlington, VA, United States

Information Security Controls SME

@ Sword | Aberdeen, Scotland, United Kingdom