作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程

• 安全技术 • 上一篇    下一篇

一种基于格的代理签名方案

余 磊   

  1. (淮北师范大学计算机科学与技术学院,安徽 淮北 235000)
  • 收稿日期:2012-10-12 出版日期:2013-10-15 发布日期:2013-10-14
  • 作者简介:余 磊(1978-),男,硕士,主研方向:安全协议,数字签名
  • 基金资助:
    安徽省高校省级自然科学研究基金资助项目(KJ2012B158)

A Lattice-based Proxy Signature Scheme

YU Lei   

  1. (School of Computer Science and Technology, Huaibei Normal University, Huaibei 235000, China)
  • Received:2012-10-12 Online:2013-10-15 Published:2013-10-14

摘要: 由格上基于盆景树原理构造的代理签名,其密钥长度会随代理人所使用格的维数不断变化。为此,提出一种签名长度可控的代理签名方案。根据代理签名长度与格维数的线性递增关系,使用固定维数的格基委托算法生成代理签名密钥,采用原像抽样函数构造代理签名方案,并利用格上小整数解问题和最短向量问题的困难性,对其进行安全性证明。结果表明,该方案在保持代理签名密钥长度不变的同时,可满足代理签名的不可伪造性。

关键词: 格, 代理签名, 盆景树原理, 小整数解问题, 最短路径问题, 原像抽样函数

Abstract: In response to the defects that the length of proxy signature key and signature will increase when the dimension of lattice which proxy uses increase is larger in the proxy signature schemes which are on the principle of bonsai tree over the lattices, a new proxy signature scheme is put forward, in which the length of signature is controllable. According to the linear relationship between the length of proxy signature and the dimension of lattice, using the lattice basis delegation algorithm with fixed dimension to generate proxy signature keys, the proxy signature scheme is constructed on the pre-image sample function. Based on the hardness of the Small Integer Solution(SIS) problem and the Shortest Vector Problem(SVP), it proves the scheme security. The proof results show that the new scheme has non-forgeability in the condition of keeping the length of proxy signature key invariance.

Key words: lattice, proxy signature, bonsai trees principle, Small Integer Solution(SIS) problem, the Shortest Vector Problem(SVP), pre-image sample function

中图分类号: