Data-Dependent Order Fairness in BFT Consensus Heena Nagda

Format:

Book

Thesis/Dissertation

Author/Creator:

Nagda, Heena, author.

Contributor:

University of Pennsylvania. Computer and Information Science., degree granting institution.

Language:

English

Subjects (All):

0459.

0489.

0508.

0537.

0984.

Local Subjects:

0459.

0489.

0508.

0537.

0984.

Physical Description:

1 electronic resource (108 pages)

Contained In:

Dissertations Abstracts International 87-07A

Place of Publication:

Ann Arbor : ProQuest Dissertations and Theses, 2025

Language Note:

English

Summary:

Ensuring order fairness in decentralized systems is critical for mitigating adversarial manipulation of transaction ordering, particularly in scenarios where transaction order significantly impacts outcomes. Byzantine Fault Tolerant (BFT) consensus protocols, while ensuring safety and liveness, inherently lack mechanisms to enforce order fairness, making them susceptible to attacks like front-running and sandwiching. Early attempts to address this issue often led to substantial performance overhead. Our work highlights the evolution of order-fairness solutions, beginning with Rashnu, a data-dependent order-fairness protocol for traditional BFT consensus, and culminating in the DAG of DAGs (DoD) architecture, a high-performance order-fairness protocol designed for DAG-based BFT consensus frameworks. By tracing this progression, we illustrate how the shift towards DAG-based protocols has enabled more efficient and robust order-fairness mechanisms, paving the way for practical order-fairness in decentralized systems

Notes:

Advisors: Thau Loo, Boon; Javad Amiri, Mohammad Committee members: Haeberlen, Andreas; C. Lee, Benjamin; Mishra, Pratyush

Source: Dissertations Abstracts International, Volume: 87-07, Section: A.

Ph.D. University of Pennsylvania 2025

Vendor supplied data

Local Notes:

School code: 0175

ISBN:

9798276001494

Access Restriction:

Restricted for use by site license