Multi-Key homomorphic authenticators

Fiore, Dario; Mitrokotsa, Aikaterina; Nizzardo, Luca y Pagnin, Elena (2016). Multi-Key homomorphic authenticators. En: "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.


Título: Multi-Key homomorphic authenticators
  • Fiore, Dario
  • Mitrokotsa, Aikaterina
  • Nizzardo, Luca
  • Pagnin, Elena
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: 22nd International Conference on the Theory and Application of Cryptology and Information Security
Fechas del Evento: 04-08 Dic 2016
Lugar del Evento: Hanoi, Vietnam
Título del Libro: Advances in Cryptology -- CRYPTO 2016
Fecha: 2016
ISBN: 978-3-662-53890-6
Volumen: 2
Palabras Clave Informales: Signature scheme; Homomorphic encryption; Arithmetic circuit; Boolean circuit; Outsource data
Escuela: E.T.S. de Ingenieros Informáticos (UPM)
Departamento: Otro
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (585kB) | Vista Previa


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.

Proyectos asociados

Gobierno de EspañaTIN2015- 70713-RSin especificarFundación IMDEA SoftwareDetección y defensa contra amenazas a la sociedad de la información
Comunidad de MadridS2013/ICE-2731N- GREENS SOFTWAREFundación IMDEA SoftwareNext-GeneRation Energy-EfficieNt Secure Softw are
FP7FP7/2007-2013Sin especificarSin especificarPeople Programme (Marie Curie Actions)
Horizonte 2020688722NEXTLEAPSin especificarSin especificar

Más información

ID de Registro: 49539
Identificador DC:
Identificador OAI:
Identificador DOI: 10.1007/978-3-662-53890-6_17
URL Oficial:
Depositado por: Memoria Investigacion
Depositado el: 04 Abr 2018 08:49
Ultima Modificación: 04 Abr 2018 08:49
  • GEO_UP4
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • InvestigaM
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM