摘要
为了更好地保护用户隐私安全,使签名具有抗量子性,使用拒绝抽样定理以及高低顺序位关系提出了一种理想格上安全高效的盲签名方案。该方案无须复杂的陷门函数,通过简单的计算即可实现盲签名功能。通过分析可知,该方案安全性规约于格上ISIS_(n,m,q,η)(s)困难问题,具有盲性以及one-more(OM)不可伪造性,且公私钥短,签名长度仅为llodq,具有安全高效的优势。
In order to protect users’ privacy better and make signatures resistant to quantum attack,this paper proposed a secure and efficient blind signature scheme on ideal lattice by using the rejection sampling theorem and the relationship between high and low order bits.This blind signature function could be achieved through simple calculations without trapdoor functions.The security of the scheme is based on short integer solution(ISIS_(n,m,q,η)(s)) assumption,and this scheme has the characte-ristics of blindness and one-more(OM) unforgeability.Besides,the public and private keys are short and the signature length is only llodq.In general,the scheme is efficient and safe.
作者
黄秀菊
杜云飞
李子臣
Huang Xiuju;Du Yunfei;Li Zichen(School of Information Engineering,Beijing Institute of Graphic Communication,Beijing 102600,China;School of Basic Education,Beijing Institute of Graphic Communication,Beijing 102600,China)
出处
《计算机应用研究》
CSCD
北大核心
2022年第11期3461-3464,共4页
Application Research of Computers
基金
国家自然科学基金资助项目(61370188)
北京市教委科研计划资助项目(KM202010015009,KM202110015004)
北京印刷学院博士启动金资助项目(27170120003/020)
北京印刷学院科研创新团队项目(Eb202101)
北京印刷学院校内学科建设项目(21090121021)
北京印刷学院重点教改项目(22150121033/009)
北京印刷学院科研基础研究一般项目(Ec202201)
北京市教育委员会科技一般项目(KM202110015001)。
关键词
隐私安全
盲签名
理想格
高低位关系
拒绝抽样定理
privacy security
blind signature
ideal lattice
high and low bit relation
rejection sampling theorem