{"title":"Blockchain-assisted Verifiable Secure Multi-Party Data Computing","authors":"","doi":"10.1016/j.comnet.2024.110712","DOIUrl":null,"url":null,"abstract":"<div><p>Secure multi-party computation (SMPC) is a crucial technology that supports privacy preservation, enabling multiple users to perform computations on any function without disclosing their private inputs and outputs in a distrustful environment. Existing secure multi-party computation models typically rely on obfuscation circuits and cryptographic protocols to facilitate collaborative computation of tasks. However, the efficiency and privacy leakage of users have not been paid much attention during the computation process. To address these problems, this article proposes a privacy-preserving approach <strong>B</strong>lockchain-assisted <strong>V</strong>erifiable <strong>S</strong>ecure <strong>M</strong>ulti-<strong>P</strong>arty <strong>D</strong>ata <strong>C</strong>omputing (BVS-MPDC). Specifically, to prevent privacy leakage when users and multiple participants share data, BVS-MPDC uses additive homomorphic encryption to encrypt data shares; and verifies the generated Pedersen commitment of all the data. BVS-MPDC utilizes an improved Schnorr aggregation signature to improve computation efficiency between computing nodes and smart contracts by submitting an aggregation signature to the blockchain. Moreover, we design and implement a smart contract for verifying aggregation signature results on Ethereum. The security proof is presented under the UC framework. Finally, simulation experiments of performance evaluations demonstrate that our scheme outperforms existing schemes in computation overhead and verification.</p></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624005449","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
Secure multi-party computation (SMPC) is a crucial technology that supports privacy preservation, enabling multiple users to perform computations on any function without disclosing their private inputs and outputs in a distrustful environment. Existing secure multi-party computation models typically rely on obfuscation circuits and cryptographic protocols to facilitate collaborative computation of tasks. However, the efficiency and privacy leakage of users have not been paid much attention during the computation process. To address these problems, this article proposes a privacy-preserving approach Blockchain-assisted Verifiable Secure Multi-Party Data Computing (BVS-MPDC). Specifically, to prevent privacy leakage when users and multiple participants share data, BVS-MPDC uses additive homomorphic encryption to encrypt data shares; and verifies the generated Pedersen commitment of all the data. BVS-MPDC utilizes an improved Schnorr aggregation signature to improve computation efficiency between computing nodes and smart contracts by submitting an aggregation signature to the blockchain. Moreover, we design and implement a smart contract for verifying aggregation signature results on Ethereum. The security proof is presented under the UC framework. Finally, simulation experiments of performance evaluations demonstrate that our scheme outperforms existing schemes in computation overhead and verification.
期刊介绍:
Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.