Anonymous signatures made easy

13Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

At PKC 2006, Yang, Wong, Deng and Wang proposed the notion of anonymous signature schemes where signatures do not reveal the signer's identity, as long as some parts of the message are unknown. They also show how to modify the RSA scheme and the Schnorr scheme to derive anonymous signatures in the random oracle model. Here we present a general and yet very efficient approach to build such anonymous schemes from ordinary signature schemes. When instantiated in the random oracle model, our solution is essentially as efficient as the original scheme, whereas our construction also supports an almost as efficient instantiation in the standard model. © International Assocation tor Cryptologic Research 2007.

Cite

CITATION STYLE

APA

Fischlin, M. (2007). Anonymous signatures made easy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4450 LNCS, pp. 31–42). Springer Verlag. https://doi.org/10.1007/978-3-540-71677-8_3

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