Cryptology ePrint Archive: Report 2012/290

Fully Homomorphic Message Authenticators

Rosario Gennaro and Daniel Wichs

Abstract: We define and construct fully homomorphic message authenticators. In such a scheme, anybody can perform arbitrary computations over authenticated data and produce a short tag that authenticates the result of the computation. The user verifies this tag with her private key to ensure that the claimed result is indeed the correct output of the specified computation over previously authenticated data, without needing to know the underlying data itself. For example, a user can outsource the storage of large amounts of authenticated data to a remote server, and the server can later non-interactively certify the outputs of various computations over this data with only a short tag. Our construction uses fully homomorphic encryption in a novel way.

Category / Keywords: foundations / verifiable computing, homomorphic signatures, homomorphic encryption

Original Publication (with minor differences): IACR-ASIACRYPT-2013

Date: received 23 May 2012, last revised 26 Aug 2013

Contact author: wichs at cs nyu edu

Available format(s): PDF | BibTeX Citation

Version: 20130827:023206 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]