pith. sign in

arxiv: 2210.08723 · v3 · pith:OG4TTBKCnew · submitted 2022-10-17 · 💻 cs.CR

Private Data Valuation and Fair Payment in Data Marketplaces

classification 💻 cs.CR
keywords datafairshapleyvalueperformancealgorithmdesignmarketplace
0
0 comments X
read the original abstract

Data valuation is an essential task in a data marketplace. It aims at fairly compensating data owners for their contribution. There is increasing recognition in the machine learning community that the Shapley value -- a foundational profit-sharing scheme in cooperative game theory -- has major potential to value data, because it uniquely satisfies basic properties for fair credit allocation and has been shown to be able to identify data sources that are useful or harmful to model performance. However, calculating the Shapley value requires accessing original data sources. It still remains an open question how to design a real-world data marketplace that takes advantage of the Shapley value-based data pricing while protecting privacy and allowing fair payments. In this paper, we propose the {\em first} prototype of a data marketplace that values data sources based on the Shapley value in a privacy-preserving manner and at the same time ensures fair payments. Our approach is enabled by a suite of innovations on both algorithm and system design. We firstly propose a Shapley value calculation algorithm that can be efficiently implemented via multiparty computation (MPC) circuits. The key idea is to learn a performance predictor that can directly predict model performance corresponding to an input dataset without performing actual training. We further optimize the MPC circuit design based on the structure of the performance predictor. We further incorporate fair payment into the MPC circuit to guarantee that the data that the buyer pays for is exactly the same as the one that has been valuated. Our experimental results show that the proposed new data valuation algorithm is as effective as the original expensive one. Furthermore, the customized MPC protocol is efficient and scalable.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. How Much Is a Dataset Worth? Scaling Laws, the Vendi Score, and Matrix Spectral Functions

    cs.LG 2026-05 unverdicted novelty 7.0

    Vendi Score and scaling-law objectives belong to the class of matrix spectral functions, which are submodular, enabling efficient greedy selection of training data that outperforms random subsets in predicting held-ou...

  2. ZK-Value: A Practical Zero-Knowledge System for Verifiable Data Valuation

    cs.CR 2026-05 unverdicted novelty 6.0

    ZK-Value is a practical ZK system for verifiable Shapley-value data valuation using LSH approximations and optimized proofs that matches baseline quality while generating proofs in seconds to minutes.

  3. PrivaDE: Privacy-preserving Data Evaluation for Blockchain-based Data Marketplaces

    cs.CR 2025-10 unverdicted novelty 6.0

    PrivaDE is a privacy-preserving protocol for jointly computing data utility scores in ML using secure computation, with optimizations for efficiency and blockchain integration via smart contracts.