Ecole d'ingénieur et centre de recherche en Sciences du numérique

PUDA - Privacy and Unforgeability for Data Aggregation

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

Cryptology ePrint Archive: Report 2015/562

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 unforgeability 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 personal 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. 

Document Bibtex

Titre:PUDA - Privacy and Unforgeability for Data Aggregation
Mots Clés:Privacy;Security;Data Analysis
Type:Rapport
Langue:English
Ville:
Date:
Département:Sécurité numérique
Eurecom ref:4615
Copyright: © EURECOM. Personal use of this material is permitted. The definitive version of this paper was published in Cryptology ePrint Archive: Report 2015/562 and is available at :
Bibtex: @techreport{EURECOM+4615, year = {2015}, title = {{PUDA} - {P}rivacy and {U}nforgeability for {D}ata {A}ggregation}, author = {{L}eontiadis, {I}raklis and {E}lkhiyaoui, {K}aoutar and {\"{O}}nen, {M}elek and {M}olva, {R}efik }, number = {EURECOM+4615}, month = {06}, institution = {Eurecom}, url = {http://www.eurecom.fr/publication/4615},, }
Voir aussi: