Programmable Hash Functions go Private: constructions and applications to (Homomorphic) signatures with shorter public keys

Catalano, Dario and Fiore, Dario and Nizzardo, Luca (2015). Programmable Hash Functions go Private: constructions and applications to (Homomorphic) signatures with shorter public keys. In: "35th Annual Cryptology Conference, CRYPTO 2015", 16-20 Aug 2015, Santa Barbara, CA, Estados Unidos. ISBN 978-3-662-47989-6. pp. 254-274. https://doi.org/10.1007/978-3-662-48000-7_13.

Description

Title: Programmable Hash Functions go Private: constructions and applications to (Homomorphic) signatures with shorter public keys
Author/s:
  • Catalano, Dario
  • Fiore, Dario
  • Nizzardo, Luca
Item Type: Presentation at Congress or Conference (Article)
Event Title: 35th Annual Cryptology Conference, CRYPTO 2015
Event Dates: 16-20 Aug 2015
Event Location: Santa Barbara, CA, Estados Unidos
Title of Book: Advances in Cryptology -- CRYPTO 2015
Date: 2015
ISBN: 978-3-662-47989-6
Volume: 9215
Subjects:
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 (611kB) | Preview

Abstract

We introduce the notion of asymmetric programmable hash functions (APHFs, for short), which adapts Programmable Hash Functions, introduced by Hofheinz and Kiltz at Crypto 2008, with two main differences. First, an APHF works over bilinear groups, and it is asymmetric in the sense that, while only {em 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 from Asiacrypt 2011, and essentially the same as those by Yamada, Hannoka, Kunihiro, (CT-RSA 2012).

More information

Item ID: 49538
DC Identifier: http://oa.upm.es/49538/
OAI Identifier: oai:oa.upm.es:49538
DOI: 10.1007/978-3-662-48000-7_13
Official URL: https://link.springer.com/chapter/10.1007/978-3-662-48000-7_13
Deposited by: Memoria Investigacion
Deposited on: 21 Mar 2018 18:18
Last Modified: 21 Mar 2018 18:18
  • 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