Masquerade: Verifiable Multi-Party Aggregation with Secure Multiplicative Commitments

被引:0
|
作者
Mouris, Dimitris [1 ]
Tsoutsos, Nektarios Georgios [1 ]
机构
[1] Univ Delaware, Elect & Comp Engn, Newark, DE 19716 USA
关键词
Homomorphic commitments; private data aggregation; public verifiability; IDENTIFICATION; SIGNATURES; FRAMEWORK;
D O I
10.1145/3705315
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In crowd-sourced data aggregation over the Internet, participants share their data points with curators. However, a lack of strong privacy guarantees may discourage participation, which motivates the need for privacy-preserving aggregation protocols. Moreover, existing solutions remain limited with respect to public auditing without revealing the participants' data. In realistic applications, however, there is an increasing need for public verifiability (i.e., verifying the protocol correctness) while preserving the privacy of the participants' inputs, since the participants do not always trust the data curators. At the same time, while publicly distributed ledgers may provide public auditing, these schemes are not designed to protect sensitive information. In this work, we introduce two protocols, dubbed Masquerade and zk-Masquerade, for computing private statistics, such as sum, average, and histograms, without revealing anything about participants' data. We propose a tailored multiplicative commitment scheme to ensure the integrity of data aggregations and publish all the participants' commitments on a ledger to provide public verifiability. zk-Masquerade detects malicious participants who attempt to poison the aggregation results by adopting two zero-knowledge proof protocols that ensure the validity of shared data points before being aggregated and enable a broad range of numerical and categorical studies. In our experiments, we use homomorphic ciphertexts and commitments for a variable number of participants and evaluate the runtime and the communication cost of our protocols.
引用
收藏
页数:31
相关论文
共 50 条
  • [1] Function-Dependent Commitments for Verifiable Multi-party Computation
    Schabhuser, Lucas
    Butin, Denis
    Demirel, Denise
    Buchmann, Johannes
    INFORMATION SECURITY (ISC 2018), 2018, 11060 : 289 - 307
  • [2] Blockchain-assisted Verifiable Secure Multi-Party Data Computing
    Pei, Hongmei
    Yang, Peng
    Du, Miao
    Liang, Zengyu
    Hu, Zhongjian
    COMPUTER NETWORKS, 2024, 253
  • [3] A Verifiable Federated Learning Scheme Based on Secure Multi-party Computation
    Mou, Wenhao
    Fu, Chunlei
    Lei, Yan
    Hu, Chunqiang
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, WASA 2021, PT II, 2021, 12938 : 198 - 209
  • [4] Publicly Verifiable Secure Multi-Party Computation Framework Based on Bulletin Board
    Li, Xiaotong
    Wang, Hao
    Li, Zhi
    Wu, Lei
    Wei, Xiaochao
    Su, Ye
    Lu, Rongxing
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2024, 17 (04) : 1698 - 1711
  • [5] Secure Multi-Party Computation
    Bayatbabolghani, Fattaneh
    Blanton, Marina
    PROCEEDINGS OF THE 2018 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (CCS'18), 2018, : 2157 - 2159
  • [6] Verifiable Multi-Party Business Process Automation
    Simm, Joosep
    Steiner, Jamie
    Truu, Ahto
    BUSINESS PROCESS MANAGEMENT WORKSHOPS, BPM 2020 INTERNATIONAL WORKSHOPS, 2020, 397 : 30 - 41
  • [7] MPCFL: Towards Multi-party Computation for Secure Federated Learning Aggregation
    Kaminaga, Hiroki
    Awaysheh, Feras M.
    Alawadi, Sadi
    Kamm, Liina
    16TH IEEE/ACM INTERNATIONAL CONFERENCE ON UTILITY AND CLOUD COMPUTING, UCC 2023, 2023,
  • [8] An Efficient Multi-Party Secure Aggregation Method Based on Multi-Homomorphic Attributes
    Gao, Qi
    Sun, Yi
    Chen, Xingyuan
    Yang, Fan
    Wang, Youhe
    ELECTRONICS, 2024, 13 (04)
  • [9] Secure Multi-party Differential Privacy
    Kairouz, Peter
    Oh, Sewoong
    Viswanath, Pramod
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 28 (NIPS 2015), 2015, 28
  • [10] Secure multi-party computational geometry
    Atallah, MJ
    Du, WL
    ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 165 - 179