Multi-Key homomorphic authenticators

Fiore, Dario, Mitrokotsa, Aikaterina, Nizzardo, Luca and Pagnin, Elena (2016). Multi-Key homomorphic authenticators. In: "22nd International Conference on the Theory and Application of Cryptology and Information Security", 04-08 Dic 2016, Hanoi, Vietnam. ISBN 978-3-662-53890-6. pp. 499-530.


Title: Multi-Key homomorphic authenticators
  • Fiore, Dario
  • Mitrokotsa, Aikaterina
  • Nizzardo, Luca
  • Pagnin, Elena
Item Type: Presentation at Congress or Conference (Article)
Event Title: 22nd International Conference on the Theory and Application of Cryptology and Information Security
Event Dates: 04-08 Dic 2016
Event Location: Hanoi, Vietnam
Title of Book: Advances in Cryptology -- CRYPTO 2016
Date: 2016
ISBN: 978-3-662-53890-6
Volume: 2
Freetext Keywords: Signature scheme; Homomorphic encryption; Arithmetic circuit; Boolean circuit; Outsource data
Faculty: E.T.S. de Ingenieros Informáticos (UPM)
Department: Otro
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[thumbnail of INVE_MEM_2016_269602.pdf]
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (585kB) | Preview


Homomorphic authenticators (HAs) enable a client to authenticate a large collection of data elements m1,...,mt and outsource them, along with the corresponding authenticators, to an untrusted server. At any later point, the server can generate a short authenticator ?f,y vouching for the correctness of the output y of a function f computed on the outsourced data, i.e., y=f(m1,...,mt). Recently researchers have focused on HAs as a solution, with minimal communication and interaction, to the problem of delegating computation on outsourced data. The notion of HAs studied so far, however, only supports executions (and proofs of correctness) of computations over data authenticated by a single user. Motivated by realistic scenarios (ubiquitous computing, sensor networks, etc.) in which large datasets include data provided by multiple users, we study the concept of multi?key homomorphic authenticators. In a nutshell, multi-key HAs are like HAs with the extra feature of allowing the holder of public evaluation keys to compute on data authenticated under different secret keys. In this paper, we introduce and formally define multi-key HAs. Secondly, we propose a construction of a multi-key homomorphic signature based on standard lattices and supporting the evaluation of circuits of bounded polynomial depth. Thirdly, we provide a construction of multi-key homomorphic MACs based only on pseudorandom functions and supporting the evaluation of low-degree arithmetic circuits. Albeit being less expressive and only secretly verifiable, the latter construction presents interesting efficiency properties.

Funding Projects

Government of Spain
TIN2015- 70713-R
Fundación IMDEA Software
Detección y defensa contra amenazas a la sociedad de la información
Madrid Regional Government
Fundación IMDEA Software
Next-GeneRation Energy-EfficieNt Secure Softw are
People Programme (Marie Curie Actions)
Horizon 2020

More information

Item ID: 49539
DC Identifier:
OAI Identifier:
DOI: 10.1007/978-3-662-53890-6_17
Official URL:
Deposited by: Memoria Investigacion
Deposited on: 04 Apr 2018 08:49
Last Modified: 30 Nov 2022 09:00
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM