A new blind signature and threshold blind signature scheme from pairings

被引:0
作者
Cui, Wei [1 ]
Xin, Yang [1 ]
Yang, Yixian [1 ]
Niu, Xinxin [1 ]
机构
[1] Beijing Univ Posts & Telecommun, State Key Lab Networking & Switching Technol, Informat Secur Ctr, Beijing 100876, Peoples R China
来源
CIS WORKSHOPS 2007: INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY WORKSHOPS | 2007年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
An efficient provably secure identity-based blind signature (IBBS) scheme based on bilinear pairings is proposed. Assuming the intractability of the q-Strong Diffie-Hellman problem, our IBBS is unforgeable under adaptive chosen-message and ID attack. Because of avoiding using the inefficient MapToPoint function, our IBBS can offer advantages in runtime over the schemes available. Based on this ID-based blind signature scheme, we describe the first ID-based threshold blind signature (TBS) and show that it has security properties of unforgeability and robustness.
引用
收藏
页码:699 / 702
页数:4
相关论文
共 6 条
[1]  
Boneh D., 2001, LNCS, P514, DOI [DOI 10.1007/3-540-45682-1_30, DOI 10.1007/3-540-45682-130]
[2]  
Cha JC, 2003, LECT NOTES COMPUT SC, V2567, P18
[3]  
Huang ZJ, 2005, LECT NOTES COMPUT SC, V3810, P120
[4]  
Kurosawa K, 2005, LECT NOTES COMPUT SC, V3481, P603
[5]  
Zhang FG, 2003, LECT NOTES COMPUT SC, V2727, P312
[6]  
Zhang FG, 2002, LECT NOTES COMPUT SC, V2501, P533