On Fair Ordering and Differential Privacy

• URL: http://arxiv.org/abs/2501.05535v1
• Date: Thu, 09 Jan 2025 19:17:43 GMT
• Title: On Fair Ordering and Differential Privacy
• Authors: Shir Cohen, Neel Basu, Soumya Basu, Lorenzo Alvisi,
• Abstract summary: In blockchain systems, fair transaction ordering is crucial for a trusted and regulation-compliant ecosystem. This paper examines these properties and aims to eliminate algorithmic bias in transaction ordering services. We characterize transactions in terms of relevant and irrelevant features, requiring that the order be determined solely by the relevant ones.
• Score: 2.839269856680852
• License:
• Abstract: 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.

Related papers

• Balancing Confidentiality and Transparency for Blockchain-based Process-Aware Information Systems [46.404531555921906]
  We propose an architecture for blockchain-based PAISs aimed at preserving both confidentiality and transparency. Smart contracts enact, enforce and store public interactions, while attribute-based encryption techniques are adopted to specify access grants to confidential information.
  arXiv  Detail & Related papers  (2024-12-07T20:18:36Z)
• Collaborative Inference over Wireless Channels with Feature Differential Privacy [57.68286389879283]
  Collaborative inference among multiple wireless edge devices has the potential to significantly enhance Artificial Intelligence (AI) applications. transmitting extracted features poses a significant privacy risk, as sensitive personal data can be exposed during the process. We propose a novel privacy-preserving collaborative inference mechanism, wherein each edge device in the network secures the privacy of extracted features before transmitting them to a central server for inference.
  arXiv  Detail & Related papers  (2024-10-25T18:11:02Z)
• Generative Blockchain: Transforming Blockchain from Transaction Recording to Transaction Generation through Proof-of-Merit [5.801684954657074]
  generative blockchain aims to transform conventional blockchain technology by combining transaction generation and recording. Central to our design is a novel consensus mechanism, Proof-of-Merit (PoM) We demonstrate PoM on a ride service on-demand platform, where the task of solving complex transaction-generating problems is delegated to a pool of independent problem solvers.
  arXiv  Detail & Related papers  (2024-08-23T20:51:10Z)
• Unified Mechanism-Specific Amplification by Subsampling and Group Privacy Amplification [54.1447806347273]
  Amplification by subsampling is one of the main primitives in machine learning with differential privacy. We propose the first general framework for deriving mechanism-specific guarantees. We analyze how subsampling affects the privacy of groups of multiple users.
  arXiv  Detail & Related papers  (2024-03-07T19:36:05Z)
• Privacy-Preserving Federated Learning over Vertically and Horizontally Partitioned Data for Financial Anomaly Detection [11.167661320589488]
  In real-world financial anomaly detection scenarios, the data is partitioned both vertically and horizontally. Our solution combines fully homomorphic encryption (HE), secure multi-party computation (SMPC), differential privacy (DP) Our solution won second prize in the first phase of the U.S. Privacy Enhancing Technologies (PETs) Prize Challenge.
  arXiv  Detail & Related papers  (2023-10-30T06:51:33Z)
• Towards a Theory of Maximal Extractable Value II: Uncertainty [4.07926531936425]
  Maximal Extractable Value (MEV) is value extractable by temporary monopoly power commonly found in decentralized systems. This extraction stems from a lack of user privacy upon transaction submission and the ability of a monopolist validator to reorder, add, and/or censor transactions. We show that neither fair ordering techniques nor economic mechanisms can individually mitigate MEV for arbitrary payoff functions.
  arXiv  Detail & Related papers  (2023-09-25T15:01:11Z)
• Fairness in Matching under Uncertainty [78.39459690570531]
  algorithmic two-sided marketplaces have drawn attention to the issue of fairness in such settings. We axiomatize a notion of individual fairness in the two-sided marketplace setting which respects the uncertainty in the merits. We design a linear programming framework to find fair utility-maximizing distributions over allocations.
  arXiv  Detail & Related papers  (2023-02-08T00:30:32Z)
• Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive Privacy Analysis and Beyond [57.10914865054868]
  We consider vertical logistic regression (VLR) trained with mini-batch descent gradient. We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
  arXiv  Detail & Related papers  (2022-07-19T05:47:30Z)
• Faithful Edge Federated Learning: Scalability and Privacy [4.8534377897519105]
  Federated learning enables machine learning algorithms to be trained over a network of decentralized edge devices without requiring the exchange of local datasets. We analyze how the key feature of federated learning, unbalanced and non-i.i.d. data, affects agents' incentives to voluntarily participate. We design two faithful federated learning mechanisms which satisfy economic properties, scalability, and privacy.
  arXiv  Detail & Related papers  (2021-06-30T08:46:40Z)
• VCG Mechanism Design with Unknown Agent Values under Stochastic Bandit Feedback [104.06766271716774]
  We study a multi-round welfare-maximising mechanism design problem in instances where agents do not know their values. We first define three notions of regret for the welfare, the individual utilities of each agent and that of the mechanism. Our framework also provides flexibility to control the pricing scheme so as to trade-off between the agent and seller regrets.
  arXiv  Detail & Related papers  (2020-04-19T18:00:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.