Cryptology ePrint Archive: Report 2020/806

Toward Comparable Homomorphic Encryption for Crowd-sensing Network

Daxin Huang and Qingqing Gan and Xiaoming Wang and Chengpeng Huang and Yijian Lin

Abstract: As a popular paradigm, crowd-sensing network emerges to achieve sensory data collection and task allocation to mobile users. On one hand these sensory data could be private and sensitive, and on the other hand, data transmission separately could incur heavy communication overhead. Fortunately, the technique of homomorphic encryption (HE) allows the addictive and/or multiplicative operations over the encrypted data as well as privacy protection. Therefore, several data aggregation schemes based on HE are proposed for crowd-sensing network. However, most of the existing schemes do not support ciphertext comparison efficiently, thus data center cannot process ciphertexts with flexibility. To address this challenge, we propose a comparable homomorphic encryption (CompHE) scheme based on Lagrange’s interpolation theorem, which enables ciphertext comparison between multiple users in crowdsensing network. Based on the Partial Discrete Logarithm and Decisional Diffie-Hellman assumption, the proposed CompHE scheme is provably secure in the random oracle model. Performance analysis confirms that the proposed scheme have improved the computational efficiency compared with existing schemes.

Category / Keywords: cryptographic protocols / homomorphic encryption, ciphertext comparison, provable security, crowd-sensing network

Date: received 29 Jun 2020

Contact author: knightdax at 163 com,gan_qingqing@foxmail com,twxm@jnu edu cn,524826025@qq com,657808804@qq com

Available format(s): PDF | BibTeX Citation

Version: 20200630:130206 (All versions of this report)

Short URL: ia.cr/2020/806


[ Cryptology ePrint archive ]