基于双线性对的在线/离线签名

广东工业大学学报 ›› 2007, Vol. 24 ›› Issue (4): 63-66.

基于双线性对的在线/离线签名

广州大学信息机电学院；广东工业大学应用数学学院广东广州510006；广东广州510090；

出版日期:2007-11-08 发布日期:2007-11-08
基金资助:
广东省科技计划资助项目(2004B10101004)

Online/Offline Signature Based on Bilinear Pairings

(1.Information,Machinery and Electronics College,Guangzhou University,GuangZhou 510000,China;2.Faculty of Applied Mathematics,Guangdong University of Technology,Guangzhou 510090,China)

Online:2007-11-08 Published:2007-11-08

摘要/Abstract

摘要： 针对在线/离线签名用于待签署的信息一旦被确定,就必须用极少的时间生成签名的情况,构造了两种基于双线性对的在线/离线签名方案.在标准模型下,新方案被证明是安全的.并且,在不提高总体计算量的前提下,新方案的在线阶段计算量是文献改进前方案计算量的1/4. 更多还原

关键词: 数字签名；在线/离线签名；双线性对； q-SDH假设； LRSW假设；

Abstract: Online/Offline signatures are used in a particular scenario where the signer must respond quickly once the message to be signed is presented.This paper presents two online/offline signature schemes from bilinear pairings.Without the random oracle assumption,these two schemes are proved secure.Furthermore,without increasing the overall computation,the new schemes’ online computation requires only about one fourth of that of the old schemes

Key words: digital signatures； online/offline signatures； bilinear pairings； q-SDH assumption； LRSW assumption；

高崇志；曹嘉莉； . 基于双线性对的在线/离线签名[J]. 广东工业大学学报, 2007, 24(4): 63-66.

GAO Chong-zhi1,CAO Jia-li2 . Online/Offline Signature Based on Bilinear Pairings[J]. Journal of Guangdong University of Technology, 2007, 24(4): 63-66.

参考文献

[1] Shimon Even,Oded Goldreich,Silvio Micali.On-line/off-linedigital signatures. Proc CRYPTO89 . 1990

[2] Adi Shamir,Yael Tauman.Improved online/offine signatureschemes. Advances in Cryptology——CRYPTO’2001In-ternational Association for Cryptologic Research . 2001

[3] Hugo Krawczyk,and Tal Rabin.Chameleon signatures. Pro-ceedings ofthe Symposium on Network and Distributed Sys-tems Security(NDSS’00) . 2000

[4] GAO Chong-zhi,,YAO Zheng-an.How to Authenticate RealTime Streams Using Improved Online/Offline Signatures. Lecture Notes in Computer Science . 2005

[5] Mihir Bellare,Phillip Rogaway.Random oracles are practi-cal:Aparadigm for designing efficient protocols. Pro-ceedings ofthe1st ACM Conference on Computer and Com-munications Security . 1993

[6] Dan Boneh,,Xavier Boyen.Short signatures without randomoracles. Advances in Cryptology Eurocrypt2005 . 2004

[7] Shaffi Goldwasser,Silvio Micali,Ron L Rivest.A digital sig-nature scheme secure against adaptive chosen-message at-tacks. SIAM Journal on Computing . 1988

[8] Dan Boneh,Ben Lynn,Hovav Shacham.Short signaturesfrom the weil pairing. ASIACRYPT . 2001

[9] Mitsunari,Sakai,Kasahara.Anewtraitor tracing. TIE-ICE:IEICE transactions on Communications/Electronics/Information and Systems . 2002

[10] Jan Camenisch,Anna Lysyanskaya.Signature schemes andanonymous credentials from bilinear maps. CRYPTO . 2004

[11] Anna Lysyanskaya,,Ronald L,Rivest,et al.Pseudonym sys-tems. Selected Areas in Cryptography . 1999

Metrics

Viewed

Full text

Abstract

Cited

Shared

Discussed