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 条
  • [31] Secure multi-party computations of geometric intersections
    Li, Shundong
    Dai, Yiqi
    Wang, Daoshun
    Luo, Ping
    Qinghua Daxue Xuebao/Journal of Tsinghua University, 2007, 47 (10): : 1692 - 1695
  • [32] A study of secure multi-party statistical analysis
    Luo, WJ
    Li, X
    2003 INTERNATIONAL CONFERENCE ON COMPUTER NETWORKS AND MOBILE COMPUTING, PROCEEDINGS, 2003, : 377 - 382
  • [33] Quantum protocols for secure multi-party summation
    ZhaoXu Ji
    HuanGuo Zhang
    HouZhen Wang
    FuSheng Wu
    JianWei Jia
    WanQing Wu
    Quantum Information Processing, 2019, 18
  • [34] Research on Secure Multi-party Computational Geometry
    Geng, Tao
    Luo, Shoushan
    Xin, Yang
    Du, Xiaofeng
    Yang, Yixian
    INFORMATION COMPUTING AND APPLICATIONS, 2011, 7030 : 322 - 329
  • [35] Secure multi-party computation made simple
    Maurer, U
    SECURITY IN COMMUNICATION NETWORKS, 2003, 2576 : 14 - 28
  • [36] Quantum protocols for secure multi-party summation
    Ji, ZhaoXu
    Zhang, HuanGuo
    Wang, HouZhen
    Wu, FuSheng
    Jia, JianWei
    Wu, WanQing
    QUANTUM INFORMATION PROCESSING, 2019, 18 (06)
  • [37] A study of secure multi-party ranking problem
    Liu, Wen
    Luo, Shou-Shan
    Chen, Ping
    SNPD 2007: EIGHTH ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING, AND PARALLEL/DISTRIBUTED COMPUTING, VOL 2, PROCEEDINGS, 2007, : 727 - +
  • [38] THE STUDY ON GENERAL SECURE MULTI-PARTY COMPUTATION
    Chung, Yu-Fang
    Chen, Tzer-Long
    Chen, Chih-Sheng
    Chen, Tzer-Shyong
    INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL, 2012, 8 (1B): : 895 - 910
  • [39] Secure multi-party computation in large networks
    Varsha Dani
    Valerie King
    Mahnush Movahedi
    Jared Saia
    Mahdi Zamani
    Distributed Computing, 2017, 30 : 193 - 229
  • [40] Secure Multi-Party Computation without Agreement
    Shafi Goldwasser
    Yehuda Lindell
    Journal of Cryptology, 2005, 18 : 247 - 287