Collusion-Tolerable Privacy-Preserving Sum and Product Calculation without Secure Channel

被引:78
|
作者
Jung, Taeho [1 ]
Li, Xiang-Yang [1 ]
Wan, Meng [2 ]
机构
[1] IIT, Dept Comp Sci, Chicago, IL 60616 USA
[2] Minist Educ, Ctr Sci & Technol Dev, Beijing, Peoples R China
基金
中国国家自然科学基金;
关键词
Privacy; data aggregation; secure channels; SMC; homomorphic; BOOLEAN FUNCTIONS; DATA AGGREGATION; POLYNOMIAL FORM;
D O I
10.1109/TDSC.2014.2309134
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Much research has been conducted to securely outsource multiple parties' data aggregation to an untrusted aggregator without disclosing each individual's privately owned data, or to enable multiple parties to jointly aggregate their data while preserving privacy. However, those works either require secure pair-wise communication channels or suffer from high complexity. In this paper, we consider how an external aggregator or multiple parties can learn some algebraic statistics (e.g., sum, product) over participants' privately owned data while preserving the data privacy. We assume all channels are subject to eavesdropping attacks, and all the communications throughout the aggregation are open to others. We first propose several protocols that successfully guarantee data privacy under semi-honest model, and then present advanced protocols which tolerate up to k passive adversaries who do not try to tamper the computation. Under this weak assumption, we limit both the communication and computation complexity of each participant to a small constant. At the end, we present applications which solve several interesting problems via our protocols.
引用
收藏
页码:45 / 57
页数:13
相关论文
共 50 条
  • [1] Collusion-Tolerable cand Efficient Privacy-Preserving Time-Series Data Aggregation Protocol
    Li, Yongkai
    Liu, Shubo
    Wang, Jun
    Liu, Mengjun
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2016, 12 (07):
  • [2] Efficient Collusion-Tolerable Secure Multiparty Computation of Weighted Average
    Duan, Hongwei
    Du, Runmeng
    Wei, Qiong
    Wang, Wenli
    Liu, Xin
    2018 14TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2018, : 412 - 415
  • [3] On the Security of A Privacy-Preserving Product Calculation Scheme
    Zhu, Youwen
    Huang, Zhiqiu
    Huang, Liusheng
    Takagi, Tsuyoshi
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2015, 12 (03) : 373 - 374
  • [4] Privacy-Preserving Data Aggregation without Secure Channel: Multivariate Polynomial Evaluation
    Jung, Taeho
    Mao, Xufei
    Li, Xiang-Yang
    Tang, Shao-Jie
    Gong, Wei
    Zhang, Lan
    2013 PROCEEDINGS IEEE INFOCOM, 2013, : 2634 - 2642
  • [5] CryptoSPN: Privacy-Preserving Sum-Product Network Inference
    Treiber, Amos
    Molina, Alejandro
    Weinert, Christian
    Schneider, Thomas
    Kersting, Kristian
    ECAI 2020: 24TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, 325 : 1946 - 1953
  • [6] Secure and Privacy-Preserving Consensus
    Ruan, Minghao
    Gao, Huan
    Wang, Yongqiang
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2019, 64 (10) : 4035 - 4049
  • [7] A Privacy Preserving Collusion Secure DCOP Algorithm
    Tassa, Tamir
    Grinshpoun, Tal
    Yanai, Avishay
    PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 4774 - 4780
  • [8] Collusion-Resilient Privacy-Preserving Database Fingerprinting
    Zhang, Shunsheng
    Zhu, Youwen
    Zeng, Ao
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2024, 19 : 8306 - 8321
  • [9] A Secure Sum Protocol and Its Application to Privacy-preserving Multi-party Analytics
    Mehnaz, Shagufta
    Bellala, Gowtham
    Bertino, Elisa
    PROCEEDINGS OF THE 22ND ACM SYMPOSIUM ON ACCESS CONTROL MODELS AND TECHNOLOGIES (SACMAT'17), 2017, : 219 - 230
  • [10] A Collusion-Resistant Distributed Scalar Product Protocol With Application To Privacy-Preserving Computation of Trust
    Melchor, Carlos Aguilar
    Ait-Salem, Boussad
    Gaborit, Philippe
    2009 8TH IEEE INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS, 2009, : 140 - 147