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 条
  • [21] Secure multi-party computation without agreement
    Goldwasser, S
    Lindell, Y
    JOURNAL OF CRYPTOLOGY, 2005, 18 (03) : 247 - 287
  • [22] Secure multi-party computation with a quantum manner
    Lu, Changbin
    Miao, Fuyou
    Hou, Junpeng
    Su, Zhaofeng
    Xiong, Yan
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2021, 54 (08)
  • [23] Generic Compiler for Publicly Verifiable Covert Multi-Party Computation
    Faust, Sebastian
    Hazay, Carmit
    Kretzler, David
    Schlosser, Benjamin
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2021, PT II, 2021, 12697 : 782 - 811
  • [24] Verifiable Multi-party Quantum Key Agreement with Cluster State
    Lu D.-J.
    Li Z.-H.
    Yan C.-H.
    Liu L.
    Ruan Jian Xue Bao/Journal of Software, 2022, 33 (12): : 4804 - 4815
  • [25] A New Efficient Secure Multi-party Computation
    Tang Yonglong
    EMERGING SYSTEMS FOR MATERIALS, MECHANICS AND MANUFACTURING, 2012, 109 : 626 - 630
  • [26] FairplayMP - A System for Secure Multi-Party Computation
    Ben-David, Assaf
    Nisan, Noam
    Pinkas, Benny
    CCS'08: PROCEEDINGS OF THE 15TH ACM CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, 2008, : 257 - 266
  • [27] SecureGBM: Secure Multi-Party Gradient Boosting
    Feng, Zhi
    Xiong, Haoyi
    Song, Chuanyuan
    Yang, Sijia
    Zhao, Baoxin
    Wang, Licheng
    Chen, Zeyu
    Yang, Shengwen
    Liu, Liping
    Huan, Jun
    2019 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2019, : 1312 - 1321
  • [28] Secure Multi-party Comparison Protocol and Application
    Zhang, Jing
    Luo, Shoushan
    Yang, Yixian
    DATA SCIENCE, PT 1, 2017, 727 : 292 - 304
  • [29] Secure Multi-Party Computation with Identifiable Abort
    Ishai, Yuval
    Ostrovsky, Rafail
    Zikas, Vassilis
    ADVANCES IN CRYPTOLOGY - CRYPTO 2014, PT II, 2014, 8617 : 369 - 386
  • [30] Wiretap Codes for Secure Multi-Party Computation
    Thobaben, Ragnar
    Dan, Gyorgy
    Sandberg, Henrik
    2014 GLOBECOM WORKSHOPS (GC WKSHPS), 2014, : 1349 - 1354