Cryptology ePrint Archive: Report 2015/562

PUDA – Privacy and Unforgeability for Data Aggregation

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

Abstract: 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.

Category / Keywords: Privacy;Security;Data Analysis

Date: received 8 Jun 2015, last revised 18 Aug 2015

Contact author: leontiad at eurecom fr

Available format(s): PDF | BibTeX Citation

Version: 20150818:131424 (All versions of this report)

Short URL: ia.cr/2015/562

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]