Paper 2013/661

Private aggregation on untrusted servers with customizable thresholds

Constantinos Patsakis, Michael Clear, and Paul Laird

Abstract

While multiparty computations are becoming more and more efficient, their performance has not yet reached the level needed to be widely deployed for many applications. Nevertheless, the heterogeneous environment of modern computing needs this functionality in order to provide users their right to privacy. For a wide range of applications there is no need for complex computations; operations such as multiplication or addition might be sufficient. In this work we introduce a new multiparty computation protocol (MPC) for multi-round summation whose security is based on DDH in the semihonest model. We also introduce the concept of an anonymous aggregation system that combines MPC with ``blinded'' aggregation so that the aggregate values may remain hidden from the aggregator, and show how to achieve this with our MPC protocol. We give results on the performance of our solution and discuss suitable applications.

Note: Formalization and language improvements

Metadata
Available format(s)
PDF
Publication info
Preprint. MINOR revision.
Keywords
cryptographic protocolsprivacyanonymitymultiparty computationaggregation
Contact author(s)
patsakik @ scss tcd ie
History
2014-02-28: last of 2 revisions
2013-10-24: received
See all versions
Short URL
https://ia.cr/2013/661
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/661,
      author = {Constantinos Patsakis and Michael Clear and Paul Laird},
      title = {Private aggregation on untrusted servers with customizable thresholds},
      howpublished = {Cryptology ePrint Archive, Paper 2013/661},
      year = {2013},
      note = {\url{https://eprint.iacr.org/2013/661}},
      url = {https://eprint.iacr.org/2013/661}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.