Paper 2012/538

Private Top-k Aggregation Protocols

Myungsun Kim, Abedelaziz Mohaisen, 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.

Note: This paper will be appeared at ICISC 2012.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
Privacy-preservationTop-k itemsData aggregationUser privacy
Contact author(s)
msunkim @ suwon ac kr
History
2012-10-24: revised
2012-09-20: received
See all versions
Short URL
https://ia.cr/2012/538
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2012/538,
      author = {Myungsun Kim and Abedelaziz Mohaisen and Jung Hee Cheon and Yongdae Kim},
      title = {Private Top-k Aggregation Protocols},
      howpublished = {Cryptology ePrint Archive, Paper 2012/538},
      year = {2012},
      note = {\url{https://eprint.iacr.org/2012/538}},
      url = {https://eprint.iacr.org/2012/538}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.