Authors
Dario Catalano, Dario Fiore, Rosario Gennaro, Luca Nizzardo
Publication date
2014
Conference
Public-Key Cryptography–PKC 2014: 17th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, March 26-28, 2014. Proceedings 17
Pages
538-555
Publisher
Springer Berlin Heidelberg
Description
Homomorphic MACs, introduced by Gennaro and Wichs in 2013, allow anyone to validate computations on authenticated data without knowledge of the secret key.Moreover, the secret-key owner can verify the validity of the computation without needing to know the original (authenticated) inputs. Beyond security, homomorphic MACs are required to produce short tags (succinctness) and to support composability (i.e., outputs of authenticated computations should be re-usable as inputs for new computations).
At Eurocrypt 2013, Catalano and Fiore proposed two realizations of homomorphic MACs that support a restricted class of computations (arithmetic circuits of polynomial degree), are practically efficient, but fail to achieve both succinctness and composability at the same time.
In this paper, we generalize the work of Catalano and Fiore in several ways. First, we abstract away their results …
Total citations
2014201520162017201820192020202120222023105541132141
Scholar articles
D Catalano, D Fiore, R Gennaro, L Nizzardo - Public-Key Cryptography–PKC 2014: 17th International …, 2014