实用的容错数据聚合
Practical Fault-Tolerant Data Aggregation
摘要:
在2012年的金融密码学会议上,Chan等人提出了一种新的隐私保护容错数据聚合协议。与以前的工作相比,他们的方案保证了个人的可证明隐私,即使一些用户拒绝参与也可以工作。在我们的论文中,我们证明,尽管其优点,他们的方法提供了不可接受的低精度的聚合数据的范围广泛的假设参数,不能用于大多数现实生活中的系统。为了证明这一点,我们使用精确的分析和实验方法。此外,我们提出了一个精确的数据聚合协议,提供可证明的安全级别,即使面对大规模的节点故障。此外,该协议需要显着更少的计算(有限的利用重型密码)比大多数目前已知的容错聚合协议,并提供更好的安全保证,使其适合于有限资源的系统(包括传感器网络)。为了获得我们的结果,我们放松了模型,允许节点之间进行有限的通信。
英文摘要:
During Financial Cryptography 2012 Chan et al. presented a novel privacy-protection fault-tolerant data aggregation protocol. Comparing to previous work, their scheme guaranteed provable privacy of individuals and could work even if some number of users refused to participate. In our paper we demonstrate that despite its merits, their method provides unacceptably low accuracy of aggregated data for a wide range of assumed parameters and cannot be used in majority of real-life systems. To show this we use both precise analytic and experimental methods. Additionally, we present a precise data aggregation protocol that provides provable level of security even facing massive failures of nodes. Moreover, the protocol requires significantly less computation (limited exploiting of heavy cryptography) than most of currently known fault tolerant aggregation protocols and offers better security guarantees that make it suitable for systems of limited resources (including sensor networks). To obtain our result we relax however the model and allow some limited communication between the nodes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。