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.
Keywords
- Anonymity
- perfectly one-way hash function
- randomness extractor
- signature scheme
Chapter PDF
References
Bender, A., Katz, J., Morselli, R.: Ring Signatures: Stronger Definitions, and Constructions Without Random Oracles. Theory of Cryptography Conference (TCC) 2006. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 60–79. Springer, Heidelberg (2006)
Canetti, R.: Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information. Advances in Cryptology—Crypto’97. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 455–469. Springer, Heidelberg (1997)
Canetti, R., Micciancio, D., Reingold, O.: Perfectly One-Way Probabilistic Hash Functions. In: Proceedings of the Annual Symposium on the Theory of Computing (STOC)’98, pp. 131–140. ACM Press, New York (1998)
Dodis, Y., Kiayias, A., Nicolosi, A., Shoup, V.: Anonymous Identification in Ad Hoc Groups. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 609–626. Springer, Heidelberg (2004)
Nisan, N., Ta-Shma, A.: Extracting Randomness: A Survey and New Constructions. Journal of Computer and System Science 58(1), 148–173 (1999)
Nisan, N., Zuckerman, D.: Randomness is Linear in Space. Journal of Computer and System Science 52(1), 43–52 (1996)
Rivest, R., Shamir, A., Tauman, Y.: How to Leak a Secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 552–565. Springer, Heidelberg (2001)
Shaltiel, R.: Recent Developments in Extractors — a Survey. Bulletin of the European Association for Theoretical Computer Science 77, 67–95 (2002)
Yang, G., Wong, D., Deng, X., Wang, H.: Anonymous Signature Schemes. Public-Key Cryptography (PKC) 2006. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol. 3958, pp. 347–363. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Fischlin, M. (2007). Anonymous Signatures Made Easy. In: Okamoto, T., Wang, X. (eds) Public Key Cryptography – PKC 2007. PKC 2007. Lecture Notes in Computer Science, vol 4450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71677-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-71677-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71676-1
Online ISBN: 978-3-540-71677-8
eBook Packages: Computer ScienceComputer Science (R0)