Efficient and Short Certificateless Signature

被引：0

作者：

Tso, Raylin ^{[1
]}

Yi, Xun ^{[2
]}

Huang, Xinyi ^{[3
]}

机构：

[1] Natl Chengchi Univ, Dept Comp Sci, Taipei, Taiwan

[2] Victoria Univ, Sch Comp Sci & Math, Footscray, Vic, Australia

[3] Univ Wollongong, Ctr Comp & Informat Secur Res, Sch Comp Sci & Software Engn, Wollongong, NSW 2500, Australia

来源：

CRYPTOLOGY AND NETWORK SECURITY | 2008年 / 5339卷

基金：

中国国家自然科学基金;

关键词：

Bilinear pairing; certificateless signature; random oracle; short signature;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A certificateless signature (CLS) scheme with short signature size is proposed in this paper. Our scheme is as efficient as BLS short signature scheme in both communication and computation, and therefore turns out to be more efficient than other CLS schemes proposed so far. We provide a rigorous security proof of our scheme in the random oracle model. The security of our scheme is based on the k-CAA hard problem and a new discovered hard problem, namely, modified k-CAA problem. Our scheme can be applied to systems where signatures are typed in by human or systems with low-bandwidth channels and/or low-computation power, such as PDAs or cell phones.

引用

页码：64 / +

页数：5

共 25 条

[1]

Al-Riyami SS, 2003, LECT NOTES COMPUT SC, V2894, P452

[2]

Au M. H., 2007, P 2 ACM S INF COMP C, P302

[3]

BARR K, 2003, P ACM C MOB SYST APP

[4]

Barreto PSLM, 2004, LECT NOTES COMPUT SC, V3006, P17

[5]

Barreto PSLM, 2002, LECT NOTES COMPUT SC, V2442, P354

[6]

Bellare M, 2004, LECT NOTES COMPUT SC, V3152, P273

[7]

Bellare M., 2006, P 13 ACM C COMP COMM, P390, DOI DOI 10.1145/1180405.1180453

[8]

Boneh D, 2004, LECT NOTES COMPUT SC, V3027, P56

[9]

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

[10]

Choi KY, 2007, LECT NOTES COMPUT SC, V4521, P443

← 1 2 3 →