Blind signature

An often-used analogy to the cryptographic blind signature is the physical act of a voter enclosing a completed anonymous ballot in a special carbon paper lined envelope that has the voter's credentials pre-printed on the outside. An official verifies the credentials and signs the envelope, thereby transferring his signature to the ballot inside via the carbon paper. Once signed, the package is given back to the voter, who transfers the now signed ballot to a new unmarked normal envelope. Thus, the signer does not view the message content, but a third party can later verify the signature and know that the signature is valid within the limitations of the underlying signature scheme.

Blind signatures can also be used to provide unlinkability, which prevents the signer from linking the blinded message it signs to a later un-blinded version that it may be called upon to verify. In this case, the signer's response is first "un-blinded" prior to verification in such a way that the signature remains valid for the un-blinded message. This can be useful in schemes where anonymity is required.

Blind signature schemes can be implemented using a number of common public key signing schemes, for instance RSA and DSA. To perform such a signature, the message is first "blinded", typically by combining it in some way with a random "blinding factor". The blinded message is passed to a signer, who then signs it using a standard signing algorithm. The resulting message, along with the blinding factor, can be later verified against the signer's public key. In some blind signature schemes, such as RSA, it is even possible to remove the blinding factor from the signature before it is verified. In these schemes, the final output (message/signature) of the blind signature scheme is identical to that of the normal signing protocol.

Uses

Blind signature schemes see a great deal of use in applications where sender privacy is important. This includes various "digital cash" schemes and voting protocols.

For example, the integrity of some electronic voting system may require that each ballot be certified by an election authority before it can be accepted for counting; this allows the authority to check the credentials of the voter to ensure that they are allowed to vote, and that they are not submitting more than one ballot. Simultaneously, it is important that this authority does not learn the voter's selections. An unlinkable blind signature provides this guarantee, as the authority will not see the contents of any ballot it signs, and will be unable to link the blinded ballots it signs back to the un-blinded ballots it receives for counting.

2 more chapters are free with a Lably account.

Blind signature schemes exist for many public key signing protocols. More formally a blind signature scheme is a cryptographic protocol that involves two parties, a user Alice that wants to obtain signatures on her messages, and a signer Bob that is in possession of his secret signing key. At the end of the protocol Alice obtains Bob’s signature on m without Bob learning anything about the message. This intuition of not learning anything is hard to capture in mathematical terms. The usual approach is to show that for every (adversarial) signer, there exists a simulator that can output the same information as the signer. This is similar to the way zero-knowledge is defined in zero-knowledge proof systems.

One of the simplest blind signature schemes is based on RSA signing. A traditional RSA signature is computed by raising the message m to the secret exponent d modulo the public modulus N. The blind version uses a random value r, such that r is relatively prime to N (i.e. gcd(r, N) = 1). r is raised to the public exponent e modulo N, and the resulting value $r^{e} mod N$ is used as a blinding factor. The author of the message computes the product of the message and blinding factor, i.e.:

m^{'} \equiv m r^{e} (m o d N)

and sends the resulting value $m^{'}$ to the signing authority. Because r is a random value and the mapping $r \mapsto r^{e} mod N$ is a permutation it follows that $r^{e} mod N$ is random too. This implies that $m^{'}$ does not leak any information about m. The signing authority then calculates the blinded signature s' as:

s^{'} \equiv (m^{'})^{d} (m o d N) .

s' is sent back to the author of the message, who can then remove the blinding factor to reveal s, the valid RSA signature of m:

s \equiv s^{'} \cdot r^{- 1} (m o d N)

This works because RSA keys satisfy the equation $r^{e d} \equiv r (\mod N)$ and thus

s \equiv s^{'} \cdot r^{- 1} \equiv (m^{'})^{d} r^{- 1} \equiv m^{d} r^{e d} r^{- 1} \equiv m^{d} r r^{- 1} \equiv m^{d} (\mod N),

hence s is indeed the signature of m.

In practice, the property that signing one blinded message produces at most one valid signed message is usually desired. This means one vote per signed ballot in elections, for example. This property does not hold for the simple scheme described above: the original message and the unblinded signature is valid, but so is the blinded message and the blind signature, and possibly other combinations given a clever attacker. A solution to this is to blind sign a cryptographic hash of the message, not the message itself.

RSA is subject to the RSA blinding attack through which it is possible to be tricked into decrypting a message by blind signing another message. Since the signing process is equivalent to decrypting with the signer's secret key, an attacker can provide a blinded version of a message $m$ encrypted with the signer's public key, $m^{'}$ for them to sign. The encrypted message would usually be some secret information which the attacker observed being sent encrypted under the signer's public key which the attacker wants to learn more about. When the attacker removes the blindness the signed version will have the clear text:

\begin{matrix} m^{″} & = m^{'} r^{e} (\mod n) \\ = (m^{e} (\mod n) \cdot r^{e}) (\mod n) \\ = (m r)^{e} (\mod n) \end{matrix}

where $m^{'}$ is the encrypted version of the message. When the message is signed, the cleartext $m$ is easily extracted:

\begin{matrix} s^{'} & = m^{″ d} (\mod n) \\ = ((m r)^{e} (\mod n))^{d} (\mod n) \\ = (m r)^{e d} (\mod n) \\ = m \cdot r (\mod n), since e d \equiv 1 (\mod ϕ (n)) \end{matrix}

Note that $ϕ (n)$ refers to Euler's totient function. The message is now easily obtained.

\begin{matrix} m = s^{'} \cdot r^{- 1} (\mod n) \end{matrix}

This attack works because in this blind signature scheme the signer signs the message directly. By contrast, in an unblinded signature scheme the signer would typically use a padding scheme (e.g. by instead signing the result of a cryptographic hash function applied to the message, instead of signing the message itself), however since the signer does not know the actual message, any padding scheme would produce an incorrect value when unblinded. Due to this multiplicative property of RSA, the same key should never be used for both encryption and signing purposes.

Uses

Blind signature schemes

Blind RSA signatures

Dangers of RSA blind signing

More in Computing and communication