Definition
In blind signature schemes, the sender and the signer of the message are two distinguished entities. Given a message m, blind signatures have the property that the signer digitally signs a blinded version of m, i.e., m′, without the disclosure of any information about the original message. The obtained blind signature can be verified by using the public key of the signer and the original message m, instead of m′.
Key Points
In 1982, David Chaum introduced the concept of blind signatures for protecting user privacy during electronic payment transactions [1]. This scheme has been devised for scenarios where the sender and the signer of the message are two distinguished entities, with the aim of preventing the signer from observing the message he or she signs. More precisely, given a message m generated by A, a signer B is able to digitally sign a blinded version of m′, i.e., DS B (m′), without the disclosure of any information about the original message. The key property of...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Chaum D. Blind signatures for untraceable payments, advances in cryptology. In Proceedings of Crypto ’82, 1983, pp. 199–203.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this entry
Cite this entry
Carminati, B. (2009). Blind Signatures. In: LIU, L., ÖZSU, M.T. (eds) Encyclopedia of Database Systems. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-39940-9_1488
Download citation
DOI: https://doi.org/10.1007/978-0-387-39940-9_1488
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-35544-3
Online ISBN: 978-0-387-39940-9
eBook Packages: Computer ScienceReference Module Computer Science and Engineering