Multi-key homomorphic authenticators
Journal
IET Information Security
Type
journal article
Date Issued
2019-11-01
Author(s)
Abstract (De)
Homomorphic authenticators (HAs) enable a client to authenticate a large collection of data elements m1, ...mt and outsource them, along with the corresponding authenticators, to an untrusted server. At any later point, the server can generate a short authenticator sigma_f,y vouching for the correctness of the output y of a function f computed on the outsourced data, i.e. f(m1,...,mt). The notion of HAs studied so far, however, only supports executions of computations over data authenticated by a single user. Motivated by realistic scenarios in which large datasets include data provided by multiple users, we study the concept of multi‐key homomorphic authenticators. In a nutshell, multi‐key HAs are like HAs with the extra feature of allowing the holder of public evaluation keys to compute on data authenticated under different secret keys. In this paper, we introduce and formally define multi‐key HAs. Secondly, we propose a construction of a multi‐key homomorphic signature based on standard lattices and supporting the evaluation of circuits of bounded polynomial depth. Thirdly, we provide a construction of multi‐key homomorphic MACs based only on pseudorandom functions and supporting the evaluation of low‐degree arithmetic circuits.
Language
English
HSG Classification
contribution to scientific community
Refereed
Yes
Publisher
IET The Institution of Engineering and Technology
Volume
13
Number
6
Start page
618
End page
638
Pages
20
Subject(s)
Division(s)
Eprints ID
262150
File(s)![Thumbnail Image]()
Loading...
open.access
Name
iet-ifs.2018.5341.pdf
Size
1.11 MB
Format
Adobe PDF
Checksum (MD5)
e41b7ac35b11f281a50711b32c8843b4