An efficient identity-based short signature scheme from bilinear pairings

被引：21

作者：

Du, Hongzhen ^{[1
,2
]}

Wen, Qiaoyan ^{[1
]}

机构：

[1] Beijing Univ Posts & Telecommun, Sch Sci, Beijing, Peoples R China

[2] Baoji Univ Arts & Sci, Dept Math, Baoji, Peoples R China

来源：

CIS: 2007 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, PROCEEDINGS | 2007年

基金：

国家高技术研究发展计划(863计划); 中国国家自然科学基金;

关键词：

D O I：

10.1109/CIS.2007.168

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper, we present an ID-based signature scheme that is proved to be secure in the random oracle model under the hardness assumption of k-CAA problem. The proposed scheme upholds all desirable properties of previous IBS schemes, and requires general cryptographic hash functions instead of MapToPoint hash function that is inefficient and probabilistic. Furthermore, our scheme requires less computation cost and is significantly more efficient than all known IBS schemes, and the size of signatures generated by our scheme is approximate 160 bits, which is the shortest ID-based signatures so far.

引用

页码：725 / +

页数：2

共 16 条

[1]

Barreto PSLM, 2005, LECT NOTES COMPUT SC, V3788, P515

[2]

BARRETO PSLM, 2001098

[3]

Boneh D., 2001, LNCS, P514, DOI [DOI 10.1007/3-540-45682-1_30, DOI 10.1007/3-540-45682-130]

[4]

BONEH D, 2001, LNCS, V2139

[5]

Cha JC, 2003, LECT NOTES COMPUT SC, V2567, P18

[6]

CHA JC, 2002, 2002018

[7]

Cheng XG, 2005, LECT NOTES COMPUT SC, V3483, P1046

[8]

GUILLOU LC, 1988, P CRYPTO 88 SANT BAR, P216

[9] Efficient identity based signature schemes based on pairings [J].

Hess, F .

SELECTED AREAS IN CRYPTOGRAPHY, 2003, 2595 :310-324

[10]

Koblitz N, 2005, LECT NOTES COMPUT SC, V3796, P13

← 1 2 →