2025/01/09 by Shir Cohen, Cohen, Shir, Basu, Neel +4
Economics, Econometrics and Finance · Social Sciences · #Cryptography and Security (cs.CR) #Distributed #FOS: Computer and information sciences #Legal and Constitutional Studies #Legal and Policy Issues #Parallel #Privacy, Security, and Data Protection #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.2501.05535
openalex publication_date 2025/01/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In blockchain systems, fair transaction ordering is crucial for a trusted and regulation-compliant economic ecosystem. Unlike traditional State Machine Replication (SMR) systems, which focus solely on liveness and safety, blockchain systems also require a fairness property. This paper examines these properties and aims to eliminate algorithmic bias in transaction ordering services. We build on the notion of equal opportunity. We characterize transactions in terms of relevant and irrelevant features, requiring that the order be determined solely by the relevant ones. Specifically, transactions with identical relevant features should have an equal chance of being ordered before one another. We extend this framework to define a property where the greater the distance in relevant features between transactions, the higher the probability of prioritizing one over the other. We reveal a surprising link between equal opportunity in SMR and Differential Privacy (DP), showing that any DP mechanism can be used to ensure fairness in SMR. This connection not only enhances our understanding of the interplay between privacy and fairness in distributed computing but also opens up new opportunities for designing fair distributed protocols using well-established DP techniques.