An Efficient Provable Secure ID-Based Proxy Signature Scheme Based on CDH Assumption  

作　　者：柴震川 曹珍富 陆荣幸 

机构地区：[1]Dept.of Computer Science and Eng.,Shanghai Jiaotong Univ., Shanghai 200030,China

出　　处：《Journal of Shanghai Jiaotong university(Science)》2006年第3期271-278,共8页上海交通大学学报（英文版）

基　　金：National Natural Science Foundation of Chi-na for Distinguished Young Scholars (No.60225007);National Research Fund for theDoctoral Program of Higher Education ofChina (No.20020248024);Grant-in-Aid forScientific Research(C) (No.14540100)

摘　　要：Identity-based proxy signature enables an entity to delegate its signing rights to another entity in identity-based cryptosystem settings. However, few existing scheme has been proved secure in a formalized model, or acquired optimized performance. To achieve the goals of both proven security and high efficiency, this paper proposed an efficient identity-based proxy signature scheme. The scheme is constructed from bilinear pairing and proved secure in the random oracle model, using the oracle replay attack technique introduced by Pointehval and Stern. The analysis shows that the scheme needs less computation costs and has a shorter signature than the other schemes.Identity-based proxy signature enables an entity to delegate its signing rights to another entity in identity-based cryptosystem settings. However, few existing scheme has been proved secure in a formalized model, or acquired optimized performance. To achieve the goals of both proven security and high efficiency, this paper proposed an efficient identity-based proxy signature scheme. The scheme is constructed from bilinear pairing and proved secure in the random oracle model, using the oracle replay attack technique introduced by Pointchval and Stern. The analysis shows that the scheme needs less computation costs and has a shorter signature than the other schemes.

关 键 词：ID-based cryptography proxy signature bilinear pairings provable security 

分 类 号：TP393.0[自动化与计算机技术—计算机应用技术]