# Linearly Homomorphic Signature with Tight Security on Lattice Source: [Linearly Homomorphic Signature with Tight Security on Lattice]() Collection index: [llms.txt]() Data updated: 2026-03-20T05:00:04.947Z Authors: Heng Guo, Fengxia Liu, Kun Tian, Zhiyong Zheng Published: 2024-12-02T15:51:57.000Z ## Abstract Constructing cryptographic schemes with tight or almost-tight security has long been one of the central problems in theoretical cryptography. At ASIACRYPT 2016, Boyen and Li posed an open problem: whether it is possible to construct a homomorphic signature scheme with tight or almost-tight security under the Short Integer Solution (SIS) assumption in the standard model. In 2024, Chen achieved the first construction with almost-tight security under a weaker security model. To further achieve tight security in the standard model, this paper introduces a new security model whose security requirements are weaker than those of the standard adaptive model but stronger than the model adopted by Chen. Under this model, we construct a linearly homomorphic signature scheme with tight security. ## Recorded benchmark results A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage. - [Linearly Homomorphic Signature on Lattice-based linearly homomorphic signatures](): Linearly Homomorphic Signature; Lattice-based linearly homomorphic signatures; Signature Size: 1. ## Original sources and implementation [Original paper]() [PDF]()