欢迎访问中国科学院大学学报,今天是
电子认证专栏

常数签名长度的高效基于属性签名协议设计

  • 张严 ,
  • 张立武 ,
  • 张茉莉
展开
  • 1. 中国科学院软件研究所 可信计算与信息保障实验室, 北京 100190;
    2. 中国联合网络通信集团有限公司, 北京 100033

收稿日期: 2014-08-27

  修回日期: 2015-05-06

  网络出版日期: 2015-09-15

基金资助

国家自然科学基金(61303247)和国家863计划项目(2012AA01A403)资助

Efficient attribute-based signature with constant signature size

  • ZHANG Yan ,
  • ZHANG Liwu ,
  • ZHANG Moli
Expand
  • 1. Trusted Computing and Information Assurance Laboratory, Insitute of Software, Chinese Academy of Sciences, Beijing 100190, China;
    2. China United Network Communications Corporation Limited, Beijing 100033, China

Received date: 2014-08-27

  Revised date: 2015-05-06

  Online published: 2015-09-15

摘要

作为一种新的密码学工具,基于属性的签名方案使得用户可以使用其属性信息作为公钥进行签名而无需证书绑定.该签名随后可被验证满足特定的访问控制结构,同时不会暴露用户的具体身份和属性信息.上述性质使得基于属性的签名在有效保护用户隐私的同时,实现了基于属性的访问控制,因此得到了许多关注.在本文中,我们对当前基于属性签名方案的效率进行了改进,提出了一个可以实现常数签名长度的门限式基于属性签名方案,并在随机预言机模型下对方案的安全性进行了证明.与现有方案相比,本方案在保持其它参数长度可实用的情况下,缩短了签名长度,提高了通信效率.

本文引用格式

张严 , 张立武 , 张茉莉 . 常数签名长度的高效基于属性签名协议设计[J]. 中国科学院大学学报, 2015 , 32(5) : 708 -713 . DOI: 10.7523/j.issn.2095-6134.2015.05.019

Abstract

As a new cryptographic tool, attribute-based signature(ABS) allows user to sign messages using his attributes. The signature could be verified to satisfy some predicate without exposing any particular attributes or identity information of the signer. These properties effectively protect user's privacy while achieving attribute-based access control. In this paper, we propose an efficient threshold attribute-based signature scheme with constant signature size and constant pairing computation during verification. The scheme has been proved to be unforgeable and unconditionally anonymous. Compared with other existing constant-size ABS schemes, our scheme is short in signature size while keeps the secret key size acceptable.

参考文献

[1] Sahai A, Waters B. Fuzzy Identity-based encryption[C]//Eurocrypt 2005, LNCS 3494.Springer-Verlag, 2005:457-473.

[2] Shamir A. Identity-based cryptosystems and signature schemes[C]//Crypto 84, LNCS 196. Springer-Verlag, 1984:47-53.

[3] Maji H, Prabhakaran M, Rosulek M. Attribute based signatures:achieving attribute privacy and collusion-resistance[C/OL]//(2008)[2014-07-20]. http://eprint.iacr.org/2008/328.

[4] Li J, Au M H, Susilo W, et al. Attribute-based signature and its applications[C]//ASIACCS'10, ACM.2010:60-69.

[5] Li J, Kim K. Attribute-based ring signatures[C/OL]//(2008)[2014-07-20]. http://eprint.iacr.org/2008/394.

[6] Escala A, Herranz J, Morillo P. Revocable attribute-based signatures with adaptive security in the standard model[C]//AFIRICACRYPT 2011, LNCS 6737. Springer-Verlag, Berlin, 2011:224-241.

[7] Maji H, Prabhakaran M, Rosulek M. Attribute-based signatures[C]//CT-RSA 2011, LNCS6558. Springer-Verlag, 2011:376-392.

[8] Shahandashti S F, Safavi-Naini R. Threshold attribute-based signatures and their application to anonymous credential systems[C]//AricaCrypt'09, LNCS5580. Springer-Verlag, 2009:198-216.

[9] Herranz J, Laguillaumie F, Libert B, et al. Short attribute-based signatures for threshold predicates[C]//CT-RSA 2012, LNCS7178. Springer-Verlag, 2012:51-67.

[10] Delerablbee C, Pointcheval D. Dynamic threshold public-key encryption[C]//Crypto 2008, LNCS 5157. Springer-Verlag, 2008:317-334.

[11] Shoup V. Lower bounds for discrete logarithms and related problems[C]//Eurocrypt 1997, LNCS 1233. Springer-Verlag, 1997:256-266.

文章导航

/