摘要
基于格上SIS(the Small Integer Solutions problem)最小整数解问题提出了一个新的线性同态签名方案,该方案可以抵抗量子计算的攻击.与之前的线性同态签名方案相比较,摆脱了对同态哈希的依赖性,提高了计算效率,但安全级别仍然不变,并且证明了该方案满足正确性、不可伪造性和私有性.
A new linearly Homomorphic signature algorithm based on SIS（the Small Integer Solutions problem） difficulty problem on lattice is given in this paper. It can resist the quantum computing attack. Compared with the previous schemes,it gets rid of the dependence on homomorphic hash,and improves the computatinal efficiency. While the security level remains unchanged,and proved to be satisfied correction,unforgeability and privacy.
出处
《河南科学》
2015年第8期1346-1351,共6页
Henan Science
基金
国家自然基金项目(61402015)
宝鸡文理学院硕士科研启动项目(ZK14061)
关键词
格
线性同态
签名
lattice
linearly homomorphic
signature
