Katz J, Schröder D, Yerukhimovich A (2011)
Publication Language: English
Publication Status: Published
Publication Type: Authored book, Volume of book series
Publication year: 2011
Series: Theory of Cryptography - TCC 2011
Pages Range: 615-629
Event location: Providence, RI
ISBN: 9783642195709
DOI: 10.1007/978-3-642-19571-6_37
A seminal result in cryptography is that signature schemes can be constructed (in a black-box fashion) from any one-way function. The minimal assumptions needed to construct blind signature schemes, however, have remained unclear. Here, we rule out black-box constructions of blind signature schemes from one-way functions. In fact, we rule out constructions even from a random permutation oracle, and our results hold even for blind signature schemes for 1-bit messages that achieve security only against honest-but-curious behavior. © 2011 International Association for Cryptologic Research.
APA:
Katz, J., Schröder, D., & Yerukhimovich, A. (2011). Impossibility of blind signatures from one-way permutations.
MLA:
Katz, Jonathan, Dominique Schröder, and Arkady Yerukhimovich. Impossibility of blind signatures from one-way permutations. 2011.
BibTeX: Download