Here is the blind DSA signature based on MacKenzie and Reiter,
http://www.ece.cmu.edu/~reiter/papers/2001/CRYPTO.pdf, in graphical form.
Recall that a DSA public key is p, q, g, y; private key x; signature on
hash h is:
Choose k < q
r = g^k mod p mod q
s = rx/k + h/k mod q
Output (r,s)
Here is th
Often people ask about blind DSA signatures. There are many known
variants on DSA signatures which allow for blinding, but blinding "plain"
DSA signatures is not discussed much.
Clearly, blinding DSA signatures is possible, through general purpose
two party multi-party computations, such as circ
Folks,
Does anyone know if there is a blind signature scheme that works with
DSA or ECDSA? I know about Camenisch, Pivetau and Stadler's "Blind
Signatures Based on the Discrete Logarithm Problem" (1994), but as far
as I can tell that doesn't produce straight DSA-verifiable signatures
and so is a l
