Cryptology ePrint Archive: Report 2012/538

Private Top-k Aggregation Protocols

Myungsun Kim and Abedelaziz Mohaisen and Jung Hee Cheon and Yongdae Kim

Abstract: In this paper, we revisit the private top-κ data aggregation problem. First we formally define the problemís security requirements as both data and user privacy goals. To achieve both goals, and to strike a balance between efficiency and functionality, we devise a novel cryptographic construction that comes in two schemes; a fully decentralized simple construction and its practical and semi-decentralized variant. Both schemes are provably secure in the semi-honest model. We analyze the computational and communi- cation complexities of our construction, and show that it is much more efficient than the existing protocols in the literature.

Category / Keywords: Privacy-preservation, Top-k items, Data aggregation, User privacy

Date: received 11 Sep 2012, last revised 24 Oct 2012

Contact author: msunkim at suwon ac kr

Available format(s): PDF | BibTeX Citation

Note: This paper will be appeared at ICISC 2012.

Version: 20121024:104732 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]