实现严密安全的短线性同态签名

IF 0.9 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2024-07-30 DOI:10.1016/j.tcs.2024.114758

引用次数: 0

摘要

在 2016 年的 ASIACRYPT 会议上，Boyen 和 Li 提出了一种基于伪随机函数和短整数解（SIS）硬度假设的近乎严密安全的短签名方案，并将其同态化作为一个未决问题。在本文中，我们用同样的假设解决了这个问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.