An efficient blind ring signature scheme without pairings

Authors:
Jianhong Zhang;Hua Chen;Xue Liu;Chenglian Liu
Affiliations:
College of Science, North China University of Technology, Beijing, P.R.China;College of Science, North China University of Technology, Beijing, P.R.China;College of Science, North China University of Technology, Beijing, P.R.China;Department of Mathematics, Royal Holloway, University of London, UK
Venue:
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Year:
2010

Citing 16
Cited 0

Random oracles are practical: a paradigm for designing efficient protocols

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Provably Secure Partially Blind Signatures

CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Deniable Ring Authentication

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
How to Leak a Secret

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
A Signcryption Scheme Based on Integer Factorization

ISW '00 Proceedings of the Third International Workshop on Information Security
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
Implementing the Tate Pairing

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Efficienct ID-Based Proxy Blind Signature Schemes from Pairings

CIS '08 Proceedings of the 2008 International Conference on Computational Intelligence and Security - Volume 01
Certificateless Proxy Blind Signature Scheme from Bilinear Pairings

WKDD '09 Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining
Security proofs for signature schemes

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Efficient ID-based blind signature and proxy signature from bilinear pairings

ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Blind ring signatures secure under the chosen-target-CDH assumption

ISC'06 Proceedings of the 9th international conference on Information Security
Blind spontaneous anonymous group signatures for ad hoc groups

ESAS'04 Proceedings of the First European conference on Security in Ad-hoc and Sensor Networks
Ring signatures: stronger definitions, and constructions without random oracles

TCC'06 Proceedings of the Third conference on Theory of Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Anonymous technology can realize the privacy-preserving of the user's information, thus it plays an important role in the e-commerce application. As two important cryptographic techniques, blind signature and ring signature can realize anonymity. Thus, it makes that they play very important roles in realizing the anonymity of user's information. To fit with the demand in real life, we propose a blind ring signature scheme based on algebraic curves by combining blind signature and ring signature. And we give formal security proof of anonymity, blindness and unforgeability of our scheme in the random oracle model. By comparing our scheme with Herranz et al's scheme which is state-of-the-art, in terms of computational cost and the signature length, we show that our scheme is more efficient, since no pairing computations are involved in the whole signing and verifying phase.