✦ LIBER ✦

Provably secure randomized blind signature scheme based on bilinear pairing

✍ Scribed by Chun-I Fan; Wei-Zhe Sun; Vincent Shi-Ming Huang

Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 425 KB
Volume: 60
Category: Article
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2010.01.021

No coin nor oath required. For personal study only.

✦ Synopsis

Blind signature is a well-known technique used to construct some advanced applications for the consideration of user privacy. Various generic ideas and variants on blind signatures have been brought up so far, but few of them considered the randomization property or offered formal proofs. The concept of randomization can form a solution for reducing the threat of coercion or bribery in anonymous electronic voting systems based on blind signatures. This manuscript will present a blind signature scheme with randomization based on bilinear pairing primitives. Furthermore, we will also provide concrete security proofs for the required properties of the proposed scheme under the random oracle model.

📜 SIMILAR VOLUMES

An efficient identity-based blind signat

An efficient identity-based blind signature scheme without bilinear pairings

✍ Debiao He; Jianhua Chen; Rui Zhang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 258 KB

Provably secure proxy-protected signatur

Provably secure proxy-protected signature schemes based on RSA

✍ Zuhua Shao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 210 KB

The proxy signature schemes allow proxy signers to sign messages on behalf of an original signer, a company or an organization. Such schemes have been suggested for use in a number of applications, particularly in distributed computing, where delegation of rights is quite common. Most of proxy signa