An efficient identity-based blind signature scheme without bilinear pairings

Authors:
Debiao He;Jianhua Chen;Rui Zhang
Affiliations:
School of Mathematics and Statistics, Wuhan University, Wuhan, People's Republic of China and State Key Laboratory of Information Security, Institute of Software, Chinese Academy of Sciences, Beij ...;School of Mathematics and Statistics, Wuhan University, Wuhan, People's Republic of China;School of Mathematics and Statistics, Wuhan University, Wuhan, People's Republic of China
Venue:
Computers and Electrical Engineering
Year:
2011

Citing 11
Cited 0

Identity-based cryptosystems and signature schemes

Proceedings of CRYPTO 84 on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
ID-Based Blind Signature and Ring Signature from Pairings

ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The random oracle methodology, revisited

Journal of the ACM (JACM)
Identity-based key agreement protocols from pairings

International Journal of Information Security
One-Round ID-Based Blind Signature Scheme without ROS Assumption

Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
A Security Enforcement ID-Based Partially Blind Signature Scheme

WISM '09 Proceedings of the 2009 International Conference on Web Information Systems and Mining
Efficient ID-based blind signature and proxy signature from bilinear pairings

ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
A pairing-free identity-based authenticated key agreement protocol with minimal message exchanges

Information Sciences: an International Journal
Efficient online/offline identity-based signature for wireless sensor network

International Journal of Information Security
A pairing-free certificateless authenticated key agreement protocol

International Journal of Communication Systems

Quantified Score

Hi-index	0.00

Visualization

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.