|Table of Contents|

Certificateless Proxy Signature Scheme Based on Discrete Logarithm Problem

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

Issue:
2010年06期
Page:
733-737
Research Field:
Publishing date:

Info

Title:
Certificateless Proxy Signature Scheme Based on Discrete Logarithm Problem
Author(s):
XU Chun-gen1ZHANG Ao-hong1HAN Mu2DOU Ben-nian1
1.School of Sciences;2.School of Computer Science and Technology,NUST,Nanjing 210094,China
Keywords:
discrete logarithm problems certificateless proxy signature schemes private keys identity
PACS:
TN918.2
DOI:
-
Abstract:
To solve the problems of certificate management or key escrow in proxy signature schemes,a new certificateless proxy signature scheme(CLPS)is presented.This scheme solves the key escrow problem by binding two partially private keys with a same identity and also satisfies all the required characteristics of the proxy signature.Its security is based on the discrete logarithm problem(DLP).It has existential unforgeability,effectively resisting the attack of Type-Ⅰ adversary and Type-Ⅱ adversary.Compared with the existed CLPS,the CLPS presented here doesn’t use the bilinear pairing and its proxy keys use the Schnorr short signature,and its efficiency and security is improved.

References:

[ 1] A-lR iyam i S S, Paterson K G. Certificateless pub lic keycryptography [ A ]. AsiaC rypt 2003, LNCS 2894 [ C ].Berlin, Germany: Spr inger-Ver lag, 2003: 452- 473.
[ 2] M amboM, Usuda K, Okamo to E. Prox y signatures fo rde legating singsing operation[ A] . ACM Con ference oncom puter and communication secur ity[ C ]. New York,USA: ACM, 1996: 48- 57.
[ 3 ] M am bo M, Usuda K, Okam oto E. Proxy signatu resde lega tion of the powe r to sign m essageses[ J]. IEICETrans Fundam enta ls, 1996, E79-A ( 9) : 1338- 1354.
[ 4] K im S, Pa rk S, Won D. Proxy signatures[ A] . Pro co f ICICS. 97, LNCS 1334 [ C ] . Be rlin, Germ any:Springer-V erlag, 1997: 223- 232.
[ 5] Baek J, Safav-i Na ini R, SusiloW. Certifica teless publickey encryotion and e ffic ient schem es w ithout pair ing[ A]. Proc of the 8th Inform ation Secur ity Conference( ISC 2005 ), LNCS 3650 [ C ]. Berlin, Ge rmany:Spr inge r-Ver lag, 2005: 134- 148.
[ 6] Zhang L, Zhang F. Ce rtificate less signa ture and b lindsignatu re[ J]. Journa l o f E lec tron ics( Ch ina), 2008,25( 5): 629- 635.
[ 7] Huang X, SusiloW, M u Y, et a.l On the secur ity ofce rtificate less signature schem es from A siacrypt 2003[ A]. Inte rnational Conference on Crypto logy and Ne-tw ork Secur ity-CANS. 05, LNCS 3810 [ C ]. Ber lin,Ge rmany: Spr ing er-Ve rlag, 2005: 13- 25.
[ 8] 王化群, 徐名海, 郭显久. 几种无证书数字签名方案的安全性分析及改进[ J]. 通信学报, 2008,29( 5): 88- 92.
[ 9] Zhang Z, W ong D, Xu J, et a.l Certificateless publickeysignature: Security mode l and effic ient construction[ A]. App lied C ryptog raphy and Netw ork Secu rity-ACNSc2006,LNCS 3989[ C ]. Berlin, Germ any: Springer-Ver lag, 2006: 239- 308.
[ 10] 许春根, 杨彦炯. 一种有成员加入的公开可验证秘密共享方案[ J]. 南京理工大学学报( 自然科学版) , 2009, 33( 2): 161- 164.
[ 11] Po intcheva l D, Stern J. Security argum ents for d ig ita lsignature and blind signature[ J]. Journal o f C rypto logy,2000, 13( 3): 361- 369.
[ 12] Xu J, Zhang Z F, Feng D G. ID-based proxy s ignatureusing bilinear parings[ A]. Advances in Para lle land D istr ibu ted Processing and Applications-LSPA2005W orkshops, LNCS 3759[ C]. Ber lin, Germ any:Springer-Verlag, 2005: 359- 367.
[ 13] Zhang F, K im K. E fficien t ID-based b lind signatureand proxy signature from b ilinear pa irings[ A ]. ACSP2003, LNCS 2727 [ C ]. Ber lin, Ge rm any: Spr ing er-Ver lag, 2003: 312- 323.

Memo

Memo:
-
Last Update: 2012-11-02