Reliable and Private Utility Signaling for Data Markets

• URL: http://arxiv.org/abs/2511.07975v1
• Date: Wed, 12 Nov 2025 01:31:58 GMT
• Title: Reliable and Private Utility Signaling for Data Markets
• Authors: Li Peng, Jiayao Zhang, Yihang Wu, Weiran Liu, Jinfei Liu, Zheng Yan, Kui Ren, Lei Zhang, Lin Qu,
• Abstract summary: This paper explores the benefits and develops a non- TCP-based construction for a desirable signaling mechanism.<n>We propose leveraging maliciously secure multi-party computation (MPC) to ensure the privacy and robustness of signal robustness.<n>In multi-seller scenarios requiring fair data valuation, we explore the design and optimization of the MPC-based KNN-Shapley method with improved efficiency.
• Score: 26.484324420593953
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The explosive growth of data has highlighted its critical role in driving economic growth through data marketplaces, which enable extensive data sharing and access to high-quality datasets. To support effective trading, signaling mechanisms provide participants with information about data products before transactions, enabling informed decisions and facilitating trading. However, due to the inherent free-duplication nature of data, commonly practiced signaling methods face a dilemma between privacy and reliability, undermining the effectiveness of signals in guiding decision-making. To address this, this paper explores the benefits and develops a non-TCP-based construction for a desirable signaling mechanism that simultaneously ensures privacy and reliability. We begin by formally defining the desirable utility signaling mechanism and proving its ability to prevent suboptimal decisions for both participants and facilitate informed data trading. To design a protocol to realize its functionality, we propose leveraging maliciously secure multi-party computation (MPC) to ensure the privacy and robustness of signal computation and introduce an MPC-based hash verification scheme to ensure input reliability. In multi-seller scenarios requiring fair data valuation, we further explore the design and optimization of the MPC-based KNN-Shapley method with improved efficiency. Rigorous experiments demonstrate the efficiency and practicality of our approach.

Related papers

• DEXO: A Secure and Fair Exchange Mechanism for Decentralized IoT Data Markets [9.728274895536789]
  We propose DEXO, a decentralized data exchange mechanism that facilitates secure and fair data exchange between data consumers and distributed IoT/mobile data providers at scale.<n>For the first time, DEXO ensures end-to-end data confidentiality, source verifiability, and fairness of the exchange process with strong resilience against participant collusion.<n>The evaluation shows a moderate deployment cost and significantly improved blockchain operation efficiency compared to a popular data exchange mechanism.
  arXiv  Detail & Related papers  (2025-11-23T15:29:24Z)
• Data Valuation and Selection in a Federated Model Marketplace [28.369108318258753]
  This paper introduces a comprehensive framework centered on a Wasserstein-based estimator tailored for Federated Learning (FL)<n>To ensure privacy, we propose a distributed method to approximate Wasserstein distance without requiring access to raw data.<n>Our approach consistently identifies high-performing data combinations, paving the way for more reliable FL-based model marketplaces.
  arXiv  Detail & Related papers  (2025-09-09T06:45:30Z)
• Blockchain Powered Edge Intelligence for U-Healthcare in Privacy Critical and Time Sensitive Environment [0.559239450391449]
  We propose an autonomous computing model for privacy-critical and time-sensitive health applications.<n>The system supports continuous monitoring, real-time alert notifications, disease detection, and robust data processing and aggregation.<n>A secure access scheme is defined to manage both off-chain and on-chain data sharing and storage.
  arXiv  Detail & Related papers  (2025-05-31T06:58:52Z)
• Communication-Efficient and Privacy-Adaptable Mechanism for Federated Learning [54.20871516148981]
  We introduce the Communication-Efficient and Privacy-Adaptable Mechanism (CEPAM)<n>CEPAM achieves communication efficiency and privacy protection simultaneously.<n>We theoretically analyze the privacy guarantee of CEPAM and investigate the trade-offs among user privacy and accuracy of CEPAM.
  arXiv  Detail & Related papers  (2025-01-21T11:16:05Z)
• ZK-DPPS: A Zero-Knowledge Decentralised Data Sharing and Processing Middleware [3.2995127573095484]
  We propose ZK-DPPS, a framework that ensures zero-knowledge communications without the need for traditional ZKPs. Privacy is preserved through a combination of Fully Homomorphic Encryption (FHE) for computations and Secure Multi-Party Computations (SMPC) for key reconstruction. We demonstrate the efficacy of ZK-DPPS through a simulated supply chain scenario.
  arXiv  Detail & Related papers  (2024-10-21T01:23:37Z)
• Decentralized Multimedia Data Sharing in IoV: A Learning-based Equilibrium of Supply and Demand [57.82021900505197]
  Internet of Vehicles (IoV) has great potential to transform transportation systems by enhancing road safety, reducing traffic congestion, and improving user experience through onboard infotainment applications. Decentralized data sharing can improve security, privacy, reliability, and facilitate infotainment data sharing in IoVs. We propose a decentralized data-sharing incentive mechanism based on multi-intelligent reinforcement learning to learn the supply-demand balance in markets.
  arXiv  Detail & Related papers  (2024-03-29T14:58:28Z)
• Breaking the Communication-Privacy-Accuracy Tradeoff with $f$-Differential Privacy [51.11280118806893]
  We consider a federated data analytics problem in which a server coordinates the collaborative data analysis of multiple users with privacy concerns and limited communication capability. We study the local differential privacy guarantees of discrete-valued mechanisms with finite output space through the lens of $f$-differential privacy (DP) More specifically, we advance the existing literature by deriving tight $f$-DP guarantees for a variety of discrete-valued mechanisms.
  arXiv  Detail & Related papers  (2023-02-19T16:58:53Z)
• Privacy-Preserving Joint Edge Association and Power Optimization for the Internet of Vehicles via Federated Multi-Agent Reinforcement Learning [74.53077322713548]
  We investigate the privacy-preserving joint edge association and power allocation problem. The proposed solution strikes a compelling trade-off, while preserving a higher privacy level than the state-of-the-art solutions.
  arXiv  Detail & Related papers  (2023-01-26T10:09:23Z)
• Strategic Coalition for Data Pricing in IoT Data Markets [32.38170282930876]
  This paper considers a market for trading Internet of Things (IoT) data that is used to train machine learning models. The data is supplied to the market platform through a network and the price of such data is controlled based on the value it brings to the machine learning model.
  arXiv  Detail & Related papers  (2022-06-15T19:48:10Z)
• Decentralized Stochastic Optimization with Inherent Privacy Protection [103.62463469366557]
  Decentralized optimization is the basic building block of modern collaborative machine learning, distributed estimation and control, and large-scale sensing. Since involved data, privacy protection has become an increasingly pressing need in the implementation of decentralized optimization algorithms.
  arXiv  Detail & Related papers  (2022-05-08T14:38:23Z)
• Distributed Machine Learning and the Semblance of Trust [66.1227776348216]
  Federated Learning (FL) allows the data owner to maintain data governance and perform model training locally without having to share their data. FL and related techniques are often described as privacy-preserving. We explain why this term is not appropriate and outline the risks associated with over-reliance on protocols that were not designed with formal definitions of privacy in mind.
  arXiv  Detail & Related papers  (2021-12-21T08:44:05Z)

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.