A Full Homomorphic Message Authenticator with Improved Efficiency
Wenbin Chen, Hao Chuan Lei · International Journal of Computer and Communication Engineering · 2014
In the system of a fully homomorphic message authenticator, anyone can make any computations based on authenticated data. At the same time, a short tag is produced to authenticate the result of the computation. Without the underlying data, the user can use his private key to verify this tag for ensuring that the claimed result is correct. Recent, Gennaro and Wichs use a fully homomorphic encryption to construct a fully homomorphic message authenticator. In this paper, we propose a fully homomorphic message authenticator with improve efficiency than Gennaro and Wichs's construction. Our fully homomorphic message authenticator is of less verification complexity than Gennaro and Wichs's construction.