Multi‐key homomorphic authenticators
(2019) In IET Information Security- Abstract
- 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 σf , y vouching for the correctness of the output y of a function f computed on the outsourced data, i.e.
y = 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... (More) - 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 σf , y vouching for the correctness of the output y of a function f computed on the outsourced data, i.e.
y = 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. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/24651fee-3a84-4e10-9918-bfc0217eb946
- author
- Fiore, Dario ; Mitrokotsa, Aikaterini ; Nizzardo, Luca and Pagnin, Elena LU
- publishing date
- 2019-11-01
- type
- Contribution to journal
- publication status
- published
- subject
- in
- IET Information Security
- publisher
- Institution of Engineering and Technology
- external identifiers
-
- scopus:85074542743
- ISSN
- 1751-8717
- DOI
- 10.1049/iet-ifs.2018.5341
- language
- English
- LU publication?
- no
- id
- 24651fee-3a84-4e10-9918-bfc0217eb946
- date added to LUP
- 2021-01-26 15:50:32
- date last changed
- 2022-04-27 00:01:17
@article{24651fee-3a84-4e10-9918-bfc0217eb946, abstract = {{Homomorphic authenticators (HAs) enable a client to authenticate a large collection of data elements m1, …,mt and<br/>outsource them, along with the corresponding authenticators, to an untrusted server. At any later point, the server can generate<br/>a short authenticator σf , y vouching for the correctness of the output y of a function f computed on the outsourced data, i.e.<br/>y = f (m1, …,mt). The notion of HAs studied so far, however, only supports executions of computations over data authenticated by<br/>a single user. Motivated by realistic scenarios in which large datasets include data provided by multiple users, we study the<br/>concept of multi-key homomorphic authenticators. In a nutshell, multi-key HAs are like HAs with the extra feature of allowing the<br/>holder of public evaluation keys to compute on data authenticated under different secret keys. In this paper, we introduce and<br/>formally define multi-key HAs. Secondly, we propose a construction of a multi-key homomorphic signature based on standard<br/>lattices and supporting the evaluation of circuits of bounded polynomial depth. Thirdly, we provide a construction of multi-key<br/>homomorphic MACs based only on pseudorandom functions and supporting the evaluation of low-degree arithmetic circuits.}}, author = {{Fiore, Dario and Mitrokotsa, Aikaterini and Nizzardo, Luca and Pagnin, Elena}}, issn = {{1751-8717}}, language = {{eng}}, month = {{11}}, publisher = {{Institution of Engineering and Technology}}, series = {{IET Information Security}}, title = {{Multi‐key homomorphic authenticators}}, url = {{http://dx.doi.org/10.1049/iet-ifs.2018.5341}}, doi = {{10.1049/iet-ifs.2018.5341}}, year = {{2019}}, }