The blind signature scheme introduced by Chaum allows a user to obtain a valid signature for a message from a signer such that the message is kept secret for the signer. Blind signature schemes have mainly been studied from a viewpoint of computational security so far. In this paper, we study blind signatures in unconditional setting. Specifically, we newly introduce a model of unconditionally secure blind signature schemes (USBS, for short). Also, we propose security notions and their formalization in our model. Finally, we propose a construction method for USBS that is provably secure in our security notions. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hara, Y., Seito, T., Shikata, J., & Matsumoto, T. (2009). Unconditionally secure blind signatures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4883 LNCS, pp. 23–43). https://doi.org/10.1007/978-3-642-10230-1_2
Mendeley helps you to discover research relevant for your work.