Title: an efficient identity-based blind signature scheme without bilinear pairings
Author: He Debiao
; Chen Jianhua
; Zhang Rui
Keyword: Online systems
; Voting machines
Source: Computers and Electrical Engineering
Issued Date: 2011
Volume: 37, Issue: 4, Pages: 444-450 Indexed Type: ei
Department: (1) School of Mathematics and Statistics, Wuhan University, Wuhan, China; (2) State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing, China
English Abstract: The blind signature schemes are useful in some applications where the anonymity is a big issue. Examples include the online voting systems and the electronic cash systems. Since the first identity-based blind signature scheme was proposed by Zhang et al., many identity-based blind signature schemes using bilinear pairings have been proposed. But the relative computation cost of the pairing is approximately 20 times higher than that of the scalar multiplication over elliptic curve group. In order to save the running time and the size of the signature, we propose an identity based blind signature scheme without bilinear pairings. With both the running time and the size of the signature being saved greatly, our scheme is more practical than the related schemes in application. © 2011 Published by Elsevier Ltd. All rights reserved. Language: 英语
WOS ID: WOS:000293479900004
Citation statistics:
Content Type: 期刊论文
URI: http://ir.iscas.ac.cn/handle/311060/14073
Appears in Collections: 软件所图书馆_期刊论文
File Name/ File Size
Content Type
Version
Access
License
An efficient identity-based blind signature scheme without bilinear pairings.pdf （258KB） -- -- 限制开放 -- 联系获取全文
Recommended Citation:
He Debiao,Chen Jianhua,Zhang Rui. an efficient identity-based blind signature scheme without bilinear pairings[J]. Computers and Electrical Engineering,2011-01-01,37(4):444-450.
