Linearly Homomorphic Signature with Tight Security on Lattice

Autor:	Guo, Heng, Tian, Kun, Liu, Fengxia, Zheng, Zhiyong
Rok vydání:	2024
Předmět:	Computer Science - Cryptography and Security Computer Science - Information Theory 14J60 (Primary) 14F05 14J26 (Secondary) F.2.2 I.2.7
Druh dokumentu:	Working Paper
Popis:	At present, in lattice-based linearly homomorphic signature schemes, especially under the standard model, there are very few schemes with tight security. This paper constructs the first lattice-based linearly homomorphic signature scheme that achieves tight security against existential unforgeability under chosen-message attacks (EUF-CMA) in the standard model. Furthermore, among existing schemes, the scheme proposed in this paper also offers certain advantages in terms of public key size, signature length, and computational cost. Comment: 24pages, research article
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2412.01641 Zobrazit plný text záznamu View this record from Arxiv