Global Information Lookup Global Information

Blind signature information


In cryptography a blind signature, as introduced by David Chaum,[1] is a form of digital signature in which the content of a message is disguised (blinded) before it is signed. The resulting blind signature can be publicly verified against the original, unblinded message in the manner of a regular digital signature. Blind signatures are typically employed in privacy-related protocols where the signer and message author are different parties. Examples include cryptographic election systems and digital cash schemes.

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.

An example of blind signature in action

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.

  1. ^ Chaum, David (1983). "Blind Signatures for Untraceable Payments" (PDF). Advances in Cryptology. Vol. 82. pp. 199–203. doi:10.1007/978-1-4757-0602-4_18. ISBN 978-1-4757-0604-8.

and 24 Related for: Blind signature information

Request time (Page generated in 0.8519 seconds.)

Blind signature

Last Update:

cryptography a blind signature, as introduced by David Chaum, is a form of digital signature in which the content of a message is disguised (blinded) before...

Word Count : 1535

Digital signature

Last Update:

electronic signature Blind signature Detached signature Public key certificate Digital signature in Estonia Electronic lab notebook Electronic signature Electronic...

Word Count : 5199

BLS digital signature

Last Update:

Yvo G. (ed.). "Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme". Public Key Cryptography...

Word Count : 799

Oblivious pseudorandom function

Last Update:

the blinding, the party computing the blind signature learns neither the input (what is being signed) nor the output (the resulting digital signature)....

Word Count : 3333

DigiCash

Last Update:

private key technology, in order to create this Blind Signature Technology. Chaum's Blind Signature Technology was designed to ensure the complete privacy...

Word Count : 584

David Chaum

Last Update:

user's anonymity, and inventing many cryptographic protocols like the blind signature, mix networks and the Dining cryptographers protocol. In 1995 his company...

Word Count : 3230

Blind Skateboards

Last Update:

very brief period of time, and a signature board, featuring a pink-colored car, was designed and released for Way. Blind released its first video in 1991...

Word Count : 2454

Ecash

Last Update:

numbers. Security was ensured by public key digital signature schemes. The RSA blind signatures achieved unlinkability between withdrawal and spend transactions...

Word Count : 917

Digital credential

Last Update:

signed, while the recipient obtains a signature without any knowledge of the signed message. Blind signatures serve as a crucial building block for various...

Word Count : 2457

Financial cryptography

Last Update:

Dr David Chaum who invented the blind signature. The blind signature is a special form of a cryptographic signature which allowed virtual coins to be...

Word Count : 546

Undeniable signature

Last Update:

An undeniable signature is a digital signature scheme which allows the signer to be selective to whom they allow to verify signatures. The scheme adds...

Word Count : 912

GNU Taler

Last Update:

decentralized payment systems, GNU Taler does not use a blockchain. A blind signature is used to protect the privacy of users as it prevents the exchange...

Word Count : 395

ElGamal signature scheme

Last Update:

The ElGamal signature scheme is a digital signature scheme which is based on the difficulty of computing discrete logarithms. It was described by Taher...

Word Count : 1236

X mark

Last Update:

or other symbols. It is also used as a replacement for a signature for a person who is blind or illiterate and thus cannot write their name. Typically...

Word Count : 521

Signature dish

Last Update:

A signature dish is a recipe that identifies an individual chef or restaurant. Ideally it should be unique and allow an informed gastronome to name the...

Word Count : 380

Zhang Fangguo

Last Update:

ID-based short signature schemes (joint work with Willy Susilo and Yi Mu) - Financial Cryptography 2005, and restrictive partial blind signature schemes (joint...

Word Count : 128

Forking lemma

Last Update:

arguments for Digital Signatures and Blind Signature using Forking Lemma. Claus P. Schnorr provided an attack on blind Schnorr signatures schemes, with more...

Word Count : 1188

Digital currency

Last Update:

Sabre (travel reservation system). In 1983, a research paper titled "Blind Signatures for Untraceable Payments" by David Chaum introduced the idea of digital...

Word Count : 5716

Cryptographic protocol

Last Update:

other desired characteristics of computer-mediated collaboration. Blind signatures can be used for digital cash and digital credentials to prove that...

Word Count : 1009

Social search

Last Update:

integrity are digital signature, hash chaining and embedded signing key. The solutions for secure social search are blind signature, zero knowledge proof...

Word Count : 3157

Mutational signatures

Last Update:

distinct concepts, often conflated: mutagen signatures and tumor signatures. Its original use, mutagen signature, referred to a pattern of mutations made...

Word Count : 4037

Index of cryptography articles

Last Update:

Chamber • Blaise de Vigenère • Bletchley Park • Blind credential • Blinding (cryptography) • Blind signature • Block cipher • Block cipher mode of operation...

Word Count : 2933

Dovetail joint

Last Update:

'secret mitred dovetail' joint (also called a 'mitred blind dovetail', 'full-blind dovetail', or 'full-blind mitred dovetail') is used in the highest class of...

Word Count : 1196

Cryptocurrency

Last Update:

market capitalization exceeding $1 billion Chaum, David (2013) [1983]. "Blind Signatures for Untraceable Payments" (PDF). In David Chaum (ed.). Advances in...

Word Count : 19339

PDF Search Engine © AllGlobal.net