![]() ![]() From the blind signature, and knowing the secret factor, the client can locally compute a (message, signature) pair that can be verified using the server's public key. ![]() The server receives the blind message, signs it and returns a blind signature.The client creates a random message, and blinds it with a random, secret factor.Using that scheme, a server can issue a token and verify that a client has a valid token, without being able to link both actions to the same client. Using that (message, signature) pair, the client can locally compute a second, valid (message', signature') pair.Īnyone can verify that (message', signature') is valid for the server's public key, even though the server didn't see that pair before.īut no one besides the client can link (message', signature') to (message, signature). The server receives the message, and returns the signature. Protocol overviewĪ client asks a server to sign a message. This is an implementation of the RSA Blind Signatures RFC, based on the Zig implementation. Author-blinded RSASSA-PSS RSAE signatures.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |