Paper 2015/562

PUDA – Privacy and Unforgeability for Data Aggregation

Iraklis Leontiadis, Kaoutar Elkhiyaoui, Melek Önen, and Refik Molva


Existing work on data collection and analysis for aggregation is mainly focused on confidentiality issues. That is, the untrusted Aggregator learns only the aggregation result without divulging individual data inputs. In this paper we extend the existing models with stronger security requirements. Apart from the privacy requirements with respect to the individual inputs, we ask for unforge- ability for the aggregate result. We first define the new security requirements of the model. We also instantiate a protocol for private and unforgeable aggregation for multiple independent users. I.e, multiple unsynchronized users owing to per- sonal sensitive information without interacting with each other, contribute their values in a secure way: The Aggregator learns the result of a function without learning individual values, and moreover, it constructs a proof that is forwarded to a verifier that will convince the latter for the correctness of the computation. Our protocol is provably secure in the random oracle model.

Available format(s)
Publication info
Preprint. MINOR revision.
PrivacySecurityData Analysis
Contact author(s)
leontiad @ eurecom fr
2015-08-18: last of 11 revisions
2015-06-17: received
See all versions
Short URL
Creative Commons Attribution


      author = {Iraklis Leontiadis and Kaoutar Elkhiyaoui and Melek Önen and Refik Molva},
      title = {PUDA – Privacy and Unforgeability for Data Aggregation},
      howpublished = {Cryptology ePrint Archive, Paper 2015/562},
      year = {2015},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.