A Decentralized Private Data Marketplace using Blockchain and Secure Multi-Party Computation
Open Access
- 31 May 2024
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Privacy and Security
- Vol. 27 (2) , 1-29
Abstract
Big data has proven to be a very useful tool for companies and users, but companies with larger datasets have ended being more competitive than the others thanks to machine learning or artificial intelligence. Secure multi-party computation (SMPC) allows the smaller companies to jointly train arbitrary models on their private data while assuring privacy, and thus gives data owners the ability to perform what are currently known as federated learning algorithms. Besides, with a blockchain it is possible to coordinate and audit those computations in a decentralized way. In this document, we consider a private data marketplace as a space where researchers and data owners meet to agree the use of private data for statistics or more complex model trainings. This document presents a candidate architecure for a private data marketplace by combining SMPC and a public, general-purpose blockchain. Such a marketplace is proposed as a smart contract deployed in the blockchain, while the privacy preserving computation is held by SMPC.Keywords
Funding Information
- ERC (PCG-336983)
- Basque Government (IT974-16)
- Ministry of Economy, Industry and Competitiveness of the Spanish Government (MTM2017-86802-P)
- Basque Government through the BERC (2018-2021)
- Ministry of Science, Innovation and Universities: BCAM Severo Ochoa accreditation (SEV-2017-0718)
This publication has 29 references indexed in Scilit:
- Multi-Key Homomorphic Encryption from TFHE2019
- SecureML: A System for Scalable Privacy-Preserving Machine Learning2017
- MASCOT2016
- Model Inversion Attacks that Exploit Confidence Information and Basic Countermeasures2015
- Secure multi-party computation made simpleDiscrete Applied Mathematics, 2006
- Multiparty Computation from Threshold Homomorphic Encryption2001
- On a dual version of the one-dimensional bin packing problemJournal of Algorithms, 1984
- How to share a secretCommunications of the ACM, 1979
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMSAnnals of Eugenics, 1936
- The Species Problem in IrisAnnals of the Missouri Botanical Garden, 1936