Efficient and Privacy-Preserving Min and $k$ th Min Computations in Mobile Sensing Systems
Efficient and Privacy-Preserving Min and $k$ th Min Computations in Mobile Sensing Systems
复制标题
DOI：
10.1109/tdsc.2015.2432814
复制
发表时间：
2017
影响因子：
7.3
通讯作者：
Yuan Zhang;Qingjun Chen;Sheng Zhong
中科院分区：
文献类型：
--
作者：
Yuan Zhang;Qingjun Chen;Sheng Zhong
保护移动的电话用户参与者的隐私对于移动的电话感测应用是极其重要的。在本文中，我们研究如何聚合器可以迅速计算的最小值或$k$ th最小值的所有用户的数据，而不知道他们。我们构造了两个安全的协议，使用概率编码方案和密码系统，允许同态逐位XOR计算我们的问题。根据半诚实模型下的标准密码安全性定义，我们形式化地证明了协议的安全性。我们提出的协议可以支持时间序列数据，不需要假设聚合器是可信的。此外，与现有的基于安全算术和计算的协议不同，我们的协议基于安全的逐位XOR计算，因此更有效。
Protecting the privacy of mobile phone user participants is extremely important for mobile phone sensing applications. In this paper, we study how an aggregator can expeditiously compute the minimum value or the $k$ th minimum value of all users’ data without knowing them. We construct two secure protocols using probabilistic coding schemes and a cipher system that allows homomorphic bitwise XOR computations for our problems. Following the standard cryptographic security definition in the semi-honest model, we formally prove our protocols’ security. The protocols proposed by us can support time-series data and need not to assume the aggregator is trusted. Moreover, different from existing protocols that are based on secure arithmetic sum computations, our protocols are based on secure bitwise XOR computations, thus are more efficient.