In this paper, we propose the first secure federated $\chi^2$-test protocol Fed-$\chi^2$. To minimize both the privacy leakage and the communication cost, we recast $\chi^2$-test to the second moment estimation problem and thus can take advantage of stable projection to encode the local information in a short vector. As such encodings can be aggregated with only summation, secure aggregation can be naturally applied to hide the individual updates. We formally prove the security guarantee of Fed-$\chi^2$ that the joint distribution is hidden in a subspace with exponential possible distributions. Our evaluation results show that Fed-$\chi^2$ achieves negligible accuracy drops with small client-side computation overhead. In several real-world case studies, the performance of Fed-$\chi^2$ is comparable to the centralized $\chi^2$-test.
翻译:在本文中,我们提出第一个安全的联邦协议 $ chi ⁇ 2美元测试协议 Fed - $ chi ⁇ 2美元。为了尽量减少隐私泄漏和通信成本,我们将2美元测试重新排入第二刻的估计问题,从而利用稳定的预测将本地信息编码成一个短矢量。由于这种编码可以仅仅以总和来汇总,因此可以自然地应用安全汇总来隐藏个人更新信息。我们正式证明Fed - $\ chi ⁇ 2美元的安全保证,即联合分配被隐藏在一个有指数分布的子空间中。我们的评估结果显示,在小客户方计算间接费用中,2美元达到微不足道的精确下降。在几个实际案例研究中,2美元Fed - $ chi%2美元的绩效与集中的2美元测试相当。