Provably secure randomized blind signature scheme based on bilinear pairing

Authors:
Chun-I Fan;Wei-Zhe Sun;Vincent Shi-Ming Huang
Affiliations:
Department of Computer Science and Engineering, National Sun Yat-sen University, 70, Lienhai Road, Kaohsiung 80424, Taiwan;Department of Computer Science and Engineering, National Sun Yat-sen University, 70, Lienhai Road, Kaohsiung 80424, Taiwan;Department of Computer Science and Engineering, National Sun Yat-sen University, 70, Lienhai Road, Kaohsiung 80424, Taiwan
Venue:
Computers & Mathematics with Applications
Year:
2010

Citing 14
Cited 0

Single term off-line coins

EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Receipt-free secret-ballot elections (extended abstract)

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The State of Elliptic Curve Cryptography

Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Untraceable Electronic Cash

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Security of Blind Digital Signatures (Extended Abstract)

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
A Practical Secret Voting Scheme for Large Scale Elections

ASIACRYPT '92 Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Provably Secure Blind Signature Schemes

ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
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
Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Coercion-Resistance and Receipt-Freeness in Electronic Voting

CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Securing Mobile Ad Hoc Networks with Certificateless Public Keys

IEEE Transactions on Dependable and Secure Computing
Efficient ID-based blind signature and proxy signature from bilinear pairings

ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
An efficient multi-receipt mechanism for uncoercible anonymous electronic voting

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.09

Visualization

Abstract

Blind signature is a well-known technique used to construct some advanced applications for the consideration of user privacy. Various generic ideas and variants on blind signatures have been brought up so far, but few of them considered the randomization property or offered formal proofs. The concept of randomization can form a solution for reducing the threat of coercion or bribery in anonymous electronic voting systems based on blind signatures. This manuscript will present a blind signature scheme with randomization based on bilinear pairing primitives. Furthermore, we will also provide concrete security proofs for the required properties of the proposed scheme under the random oracle model.