An efficient blind ring signature scheme without pairings

9Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Zhang, J., Chen, H., Liu, X., & Liu, C. (2010). An efficient blind ring signature scheme without pairings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6185 LNCS, pp. 177–188). https://doi.org/10.1007/978-3-642-16720-1_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free