Towards tightly secure short linearly homomorphic signatures

In ASIACRYPT 2016, Boyen and Li proposed an almost tightly secure short signature scheme based on pseudorandom function and the hardness assumption of short integer solution (SIS), and left it as an open problem to make it homomorphic. In this paper, we solve this problem with the same assumptions.

Saved in:
Bibliographic Details
Published in:Theoretical computer science 2024-10, Vol.1014, p.114758, Article 114758
Main Authors: Chen, Wenbin, Huang, Zhengan
Format: Article
Language:English
Subjects:
Lattice
Linearly homomorphic signature
Standard model
Tight security
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In ASIACRYPT 2016, Boyen and Li proposed an almost tightly secure short signature scheme based on pseudorandom function and the hardness assumption of short integer solution (SIS), and left it as an open problem to make it homomorphic. In this paper, we solve this problem with the same assumptions.
ISSN:0304-3975
DOI:10.1016/j.tcs.2024.114758