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
相关论文
empty
未找到相关数据