Stack Exchange network consists of 175 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Is it possible to implement blind signatures with purely hash-based signature algorithms?
Any whitepapers, code samples, etc on the subject would be helpful.
Impossibility of Blind Signatures From One-Way Permutations - Katz, Schroder, Yerukhimovich
Till today, there is no known construction for this. The problem is that standard hash functions do not come with the necessary algebraic properties required for blinding and unblinding.
Required, but never shown