Publication Type

Journal Article

Version

publishedVersion

Publication Date

12-2018

Abstract

Homomorphic signature (HS) is a novel primitive that allows an agency to carry out arbitrary (polynomial time) computation f on the signed data (m) over right arrow and accordingly gain a signature sigma(h) for the computation result f ((m) over right arrow) with respect to f on behalf of the data owner (DO). However, since DO lacks control of the agency's behavior, receivers would believe that DO did authenticate the computation result even if the agency misbehaves and applies a function that the DO does not want. To address the problem above, in this paper we introduce a new primitive called authorized function homomorphic signature (AFHS). In AFHS, the agency has to obtain a confidence key sk(f) from DO in order to evaluate a function f on the data (m) over right arrow and to obtain a signature with which one can check whether the agency acts in accordance with DO's instructions. A black-box construction of AFHS based on HS is given in this paper, and we show that if the underlying primitives are secure, so is our construction under the given security model. Moreover, we provide a somewhat concrete construction that offers stronger security guarantee.

Keywords

digital signature, homomorphic signature, functional signature, zk-SNARKs, cloud computing

Discipline

Information Security | OS and Networks

Research Areas

Information Systems and Management

Publication

Computer Journal

Volume

61

Issue

12

First Page

1897

Last Page

1908

ISSN

0010-4620

Identifier

10.1093/comjnl/bxy114

Publisher

Oxford University Press (OUP): Policy B - Oxford Open Option B

Additional URL

http://doi.org/10.1093/comjnl/bxy114

Download

Share

COinS