Cryptology ePrint Archive: Report 2018/035

A Linearly Homomorphic Signature Scheme From Weaker Assumptions

Lucas Schabhüser and Johannes Buchmann and Patrick Struck

Abstract: In delegated computing, prominent in the context of cloud computing, guaranteeing both the correctness and authenticity of computations is of critical importance. Homomorphic signatures can be used as cryptographic solutions to this problem. In this paper we solve the open problem of constructing a linearly homomorphic signature scheme that is secure against an active adversary under standard assumptions. We provide a construction based on the DL and CDH assumption. Furthermore we show how our scheme can be combined with homomorphic encryption under the framework of Linearly Homomorphic Authenticated Encryption with Public Verifiability. This way we can provide the first such scheme that is context hiding. Furthermore our solution even allows verification in constant time (in an amortized sense).

Category / Keywords: public-key cryptography / homomorphic signatures, homomorphic encryption, delegated computation, cloud computing

Original Publication (with minor differences): IMACC 2017

Date: received 8 Jan 2018

Contact author: lschabhueser at cdc tu-darmstadt de

Available format(s): PDF | BibTeX Citation

Version: 20180108:123639 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]