Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions

Catalano, Dario and Fiore, Dario and Nizzardo, Luca (2017). Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions. "Design Codes and Cryptography" ; pp. 1-50. ISSN 0925-1022. https://doi.org/10.1007/s10623-017-0444-3.

Description

Title: Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
Author/s:
  • Catalano, Dario
  • Fiore, Dario
  • Nizzardo, Luca
Item Type: Article
Título de Revista/Publicación: Design Codes and Cryptography
Date: December 2017
ISSN: 0925-1022
Subjects:
Freetext Keywords: Public-Key Cryptography; Programmable Hash Functions; Digital Signatures; Homomorphic Signatures
Faculty: E.T.S. de Ingenieros Informáticos (UPM)
Department: Otro
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (909kB) | Preview

Abstract

We introduce the notion of asymmetric programmable hash functions (APHFs, for short), which adapts Programmable hash functions, introduced by Hofheinz and Kiltz (Crypto 2008, Springer, 2008), with two main differences. First, an APHF works over bilinear groups, and it is asymmetric in the sense that, while only secretly computable, it admits an isomorphic copy which is publicly computable. Second, in addition to the usual programmability, APHFs may have an alternative property that we call programmable pseudorandomness. In a nutshell, this property states that it is possible to embed a pseudorandom value as part of the function?s output, akin to a random oracle. In spite of the apparent limitation of being only secretly computable, APHFs turn out to be surprisingly powerful objects. We show that they can be used to generically implement both regular and linearly-homomorphic signature schemes in a simple and elegant way. More importantly, when instantiating these generic constructions with our concrete realizations of APHFs, we obtain: (1) the first linearly-homomorphic signature (in the standard model) whose public key is sub-linear in both the dataset size and the dimension of the signed vectors; (2) short signatures (in the standard model) whose public key is shorter than those by Hofheinz?Jager?Kiltz (Asiacrypt 2011, Springer, 2011) and essentially the same as those by Yamada et al. (CT-RSA 2012, Springer, 2012).

Funding Projects

TypeCodeAcronymLeaderTitle
Government of SpainTIN2015-70713-RDEDETISUnspecifiedUnspecified
Government of SpainRTC-2016-4930-7DataMantiumUnspecifiedUnspecified
Madrid Regional GovernmentS2013/ICE-2731N-GreensUnspecifiedUnspecified

More information

Item ID: 49519
DC Identifier: http://oa.upm.es/49519/
OAI Identifier: oai:oa.upm.es:49519
DOI: 10.1007/s10623-017-0444-3
Official URL: https://link.springer.com/article/10.1007/s10623-017-0444-3
Deposited by: Memoria Investigacion
Deposited on: 16 Mar 2018 09:38
Last Modified: 31 May 2019 07:02
  • 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