期刊文献+

格上基于身份的单向代理重签名 被引量:3

Identity-based Unidirectional Proxy Re-signature over Lattice
下载PDF
导出
摘要 代理重签名是简化密钥管理的重要工具,能够提供路径证明和简化证书管理等。目前的代理重签名方案都是基于整数分解与离散对数的,其在量子环境下都不安全。针对这个问题,该文利用原像抽样技术与固定维数的格基委派技术,基于格上的小整数解问题(Small Integer Solution,SIS)的困难性,构造了格上基于身份的代理重签名方案。该方案具有单向性,多次使用性等性质。与其它具有相同性质的基于身份的代理重签名相比,该方案具有验证开销小,渐近复杂度低等优点。 Proxy re-signature is an important tool for simplifying key management, and can be used to prove a proof for a path, manage group signatures, simplify certificate management and so on. Currently, proxy re-signature schemes are based on large integer factorization and discrete logarithm which are not security in quantum setting. For this problem, the first identity-based proxy re-signature scheme over lattices is constructed in this paper, which uses preimage sampleable technology and lattice basis delegation in fixed dimension technology. Its security is based on the hardness of Small Integer Solution (SIS) problem. This scheme possesses the properties of unidirectional, multi-use and so on. Compared with the previous schemes which have the same properties, the proposed scheme has the advantage of low verification cost and low asymptotic computational complexity.
出处 《电子与信息学报》 EI CSCD 北大核心 2014年第3期645-649,共5页 Journal of Electronics & Information Technology
基金 国家自然科学基金(61173151 61173152 61100229)资助课题
关键词 代理重签名 高斯抽样 小整数解问题 Proxy re-signature Lattice Gaussian sampling Small Integer Solution (SIS) problem
  • 相关文献

参考文献16

  • 1Blaze M, Bleumer G, and Strauss M. Divertible protocols and atomic proxy cryptography[J]. Lecture Notes in Computer Science (LNCS), 1998, 1403: 127-144.
  • 2Ateniese G and Hohenberger S. Proxy re-signatures: new definitions, algorithms, and applications[C]. ACMConference on Computer and Communications Security 2005, Alexandria, VA, USA, 2005: 310-319.
  • 3Libert B and Vergnaud D. Multi-use unidirectional proxy re-signatures[C]. ACM Conference on Computer and Communications Security 2008, Alexandria, Virginia, USA, 2008: 511-520.
  • 4Sbao Jun, Feng Min, Zhu Bin, et al.. The security model of unidirectional proxy re-signature with private re-signature key[J]. Lecture Notes in Computer Science (LNCS), 2010, 6168: 216-232.
  • 5Schnorr C P. Efficient identification and signatures for smart cards[J]. Lecture Notes in Computer Science (LNCb-, 1990, 435: 688-689.
  • 6Gentry C, Peikert C hard lattices and and Vaikuntanathan V. Trapdoors for new cryptographic Symposium on Theory of Computing 2008 Columbia, Canada, 2008: 197-206. constructions[C]. Victoria. British.
  • 7Cash D, Hofheinz D, Kiltz E, et al.. Bonsai trees, or how to delegate a lattice basis[J]. Lecture Notes in Computer Science (LNCb, 2010, 6110: 523-552.
  • 8AgrawM S, Boneh D, and Boyen X. Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE[J]. Lecture Notes in Computer Science (LNCS), 2010, 6223: 98-115.
  • 9王凤和,胡予濮,王春晓.格上基于盆景树模型的环签名[J].电子与信息学报,2010,32(10):2400-2403. 被引量:19
  • 10Boneh D and Freeman D. Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures[J]. Lecture Notes in Computer Science (LNCS), 2011, 6571: 1-16.

二级参考文献16

  • 1Rivest R,Shamir A,and Tauman Y.How to leak a secret[C].AsiaCrypt2001.Berlin,Springer-Verlag,2001,Vol.2248:552-565.
  • 2Zhang Fang-guo and Kim K.ID-based blind signature and ring signature from pairings[C].ASIACRYPT 2002,Queenstown,New Zealand,2002:533-547.
  • 3Chow S.M,Yiu S-M,and Hui L C K.Efficient identity based ring signature[C].ACNS 2005,LNCS,2005,Vol.3531:499-512.
  • 4Herranz J and S′aez G.New identity-based ring signature schemes[C].ICICS2004,LNCS,2004,Vol.3269:27-39.
  • 5Dodis Y,Kiayias A,Nicolosi A,and Shoup V.Anonymous identification in Ad Hoc groups[C].Eurocrypt'2004,LNCS,2004,Vol.3027:609-626.
  • 6Wei Gao,Wang Gui-lin,Wang Xue-li,and Xie Dong-qing.Controllable ring signatures[C].WISA 2006,LNCS,2007,Vol.4298:1-14.
  • 7Li Jin,Chen Xiao-feng,Yuen Tsz-hon,and Wang Yan-ming.Proxy ring signature:formal definitions,efficient construction and new variant[C].CIS2006,LNAI,2007,Vol.4456:545-555.
  • 8Shor P W.Polynomial-time algorithm for prime factorizeation and discrete logarithm on a quantum computer[J].SIAM Journal on Computing,1997,26(5):1484-1509.
  • 9Lyubashevsky V and Micciancio D.Asymptotically Efficient Lattice-Based Digital Signature[C].TCC2008,LNCS,2008,Vol.4948:37-54.
  • 10Regev O.On Lattice,learning with errors,random linear codes,and cryptography[C].STOC'05,Baltimore,MD 2005:84-93.

共引文献18

同被引文献7

引证文献3

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部