基于格密码的高效无证书签名方案  

Efficient lattice-based certificateless signature scheme

作　　者：王艳 江明明 郭宇燕 余磊[2] 魏仕民[2] Wang Yan;Jiang Mingming;Guo Yuyan;Yu Lei;Wei Shimin(School of Mathematical Science,Huaibei Normal University,Huaibei 235000,Anhui,China;School of Computer Science & Technology,Huaibei Normal University,Huaibei 235000,Anhui,China)

机构地区：[1]淮北师范大学数学科学学院,安徽淮北235000 [2]淮北师范大学计算机科学与技术学院,安徽淮北235000

出　　处：《江苏师范大学学报（自然科学版）》2019年第2期63-66,共4页Journal of Jiangsu Normal University：Natural Science Edition

基　　金：国家自然科学基金资助项目(60573026);安徽省自然科学基金资助项目(1708085QF154);安徽省高校自然科学基金资助项目(KJ2016A627,KJ2019A0605,KJ2019B18)

摘　　要：针对标准模型下基于格的无证书签名算法效率较低的问题,本文基于小整数解困难问题,利用混合与消失陷门技术,提出了高效的无证书签名方案.该方案将身份映射到一个矩阵,将消息映射到一个向量,从而提高了签名算法的效率.最后,证明了该方案在小整数解困难问题下是不可伪造的.Since the efficiency of lattice based certificateless signature in the standard model is low,the technology of mixing and vanishing trapdoors are used to construct an efficient certificateless signatures scheme based on small integer solution(SIS)problem.In this scheme,the identity string is just mapped to one matrix and the messages mapped to one vector,therefore,the efficiency of signature algorithm is improved.Finally,the scheme is proved unforgeable based on SIS problem.

关 键 词：格密码 无证书密码 数字签名 小整数解问题 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]