Speaker: Sheng Zhong

Title: Privacy Preserving Computing and Min and k-th Min


Protecting users’ privacy is extremely important in mobile sensing applications. In this work, we study how an aggregator can quickly compute the minimum or the k-th minimum of users’ data, without learning the data. Two protocols are built, based on random coding and an XOR-homomorphic encryption scheme. These protocols are proved to be secure in the semi-honest model. Empirical data demonstrates that our protocols have greatly improved the efficiency compared with previous protocols.