论文标题

对抗具有当地差异隐私的恶意对手的线性模型

Linear Model Against Malicious Adversaries with Local Differential Privacy

论文作者

Miao, Guanhong, Ding, A. Adam, Wu, Samuel S.

论文摘要

科学合作受益于分布式来源的协作学习,但在数据敏感时仍然难以实现。近年来,已经广泛研究了隐私保护技术,以分析不同机构的分布数据,同时保护敏感信息。大多数现有的隐私保存技术旨在抵抗半冬季对手,并需要进行密集的计算来执行数据分析。在存在可能偏离安全协议的恶意对手的情况下,安全的协作学习非常困难。另一个挑战是通过隐私保护保持高计算效率。在本文中,将矩阵加密应用于加密数据,以使安全方案反对恶意对手,包括所选的明文攻击,已知的明文攻击和勾结攻击。加密方案还实现了当地的差异隐私。此外,研究交叉验证以防止过度拟合而没有额外的通信成本。对现实世界数据集的经验实验表明,与现有针对恶意对手和半honest模型的现有技术相比,所提出的方案在计算上是有效的。

Scientific collaborations benefit from collaborative learning of distributed sources, but remain difficult to achieve when data are sensitive. In recent years, privacy preserving techniques have been widely studied to analyze distributed data across different agencies while protecting sensitive information. Most existing privacy preserving techniques are designed to resist semi-honest adversaries and require intense computation to perform data analysis. Secure collaborative learning is significantly difficult with the presence of malicious adversaries who may deviates from the secure protocol. Another challenge is to maintain high computation efficiency with privacy protection. In this paper, matrix encryption is applied to encrypt data such that the secure schemes are against malicious adversaries, including chosen plaintext attack, known plaintext attack, and collusion attack. The encryption scheme also achieves local differential privacy. Moreover, cross validation is studied to prevent overfitting without additional communication cost. Empirical experiments on real-world datasets demonstrate that the proposed schemes are computationally efficient compared to existing techniques against malicious adversary and semi-honest model.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源