[Resource Topic] 2014/916: Adaptively Secure Fully Homomorphic Signatures Based on Lattices

Welcome to the resource topic for 2014/916

Adaptively Secure Fully Homomorphic Signatures Based on Lattices

Authors: Xavier Boyen, Xiong Fan, Elaine Shi


In a homomorphic signature scheme, given the public key and a vector of signatures \vec{\sigma}:= (\sigma_1, \ldots, \sigma_l) over l messages \vec{\mu}:= (\mu_1, \ldots, \mu_l), there exists an efficient algorithm to produce a signature \sigma' for \mu = f(\vec{\mu}). Given the tuple (\sigma', \mu, f), anyone can then publicly verify the validity of the signature \sigma'. Inspired by the recent (selectively secure) key-homomorphic functional encryption for circuits, recent works propose fully homomorphic signature schemes in the selective security model. However, in order to gain adaptive security, one must rely on generic complexity leveraging, which is not only very inefficient but also leads to reductions that are ``unfalsifiable’'. In this paper, we construct the first \emph{adaptively secure} homomorphic signature scheme that can evaluate any circuit over signed data. For {\it poly-logarithmic depth} circuits, our scheme achieves adaptive security under the standard {\it Small Integer Solution} (SIS) assumption. For {\it polynomial depth} circuits, the security of our scheme relies on sub-exponential SIS — but unlike complexity leveraging, the security loss in our reduction depends only on circuit depth and on neither message length nor dataset size.

ePrint: https://eprint.iacr.org/2014/916

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .