2000 character limit reached
Linearly Homomorphic Signature with Tight Security on Lattice
Published 2 Dec 2024 in cs.CR, cs.IT, and math.IT | (2412.01641v6)
Abstract: Boyen and Li posed an open problem in their ASIACRYPT 2016 conference paper: How to construct a tightly secure homomorphic signature scheme under the Short Integer Solution (SIS) hardness assumption in the standard model. This work provides the first complete resolution of this problem under the same assumption.
Paper Prompts
Sign up for free to create and run prompts on this paper.