Two Improved Partially Blind Signature Schemes from Bilinear Pairings

A blind signature scheme is a protocol for obtaining a digital signature from a signer, but the signer can neither learn the messages he/she sign nor the signatures the recipients obtain afterwards. Partially blind signature is a variant such that part of the message contains pre-agreed information (agreed by the signer and the signature requester) in unblinded form, while threshold blind signature distributes the signing power to a group of signers such that a signature can only be produced by interacting with a predetermined numbers of signers. In this paper, we propose a threshold partially blind signature scheme from bilinear pairings and an ID-based partially blind signature scheme, which are provably secure in the random oracle model. To the best of authors’ knowledge, we give the first discussion on these two notions.

[1]  Yiannis Tsiounis,et al.  "Indirect Discourse Proof": Achieving Efficient Fair Off-Line E-cash , 1996, ASIACRYPT.

[2]  Tsz Hon Yuen,et al.  Fast and Proven Secure Blind Identity-Based Signcryption from Pairings , 2005, CT-RSA.

[3]  Zuowen Tan,et al.  Digital Proxy Blind Signature Schemes Based on DLP and ECDLP , 2002 .

[4]  Kwangjo Kim,et al.  Efficient ID-Based Blind Signature and Proxy Signature from Bilinear Pairings , 2003, ACISP.

[5]  Lihua Liu,et al.  Universal Forgeability of a Forward-Secure Blind Signature Scheme Proposed by Duc et al , 2004, IACR Cryptol. ePrint Arch..

[6]  Yan Wang,et al.  A Simple Anonymous Fingerprinting Scheme Based on Blind Signature , 2003, ICICS.

[7]  Kaoru Kurosawa,et al.  Oblivious keyword search , 2004, J. Complex..

[8]  Moti Yung,et al.  Blind, Auditable Membership Proofs , 2000, Financial Cryptography.

[9]  Zulfikar Ramzan,et al.  Group Blind Digital Signatures: A Scalable Solution to Electronic Cash , 1998, Financial Cryptography.

[10]  Kwangjo Kim,et al.  ID-Based Distributed "Magic Ink" Signature from Pairings , 2003, ICICS.

[11]  Hovav Shacham,et al.  Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.

[12]  Joseph K. Liu,et al.  Blind Spontaneous Anonymous Group Signatures for Ad Hoc Groups , 2004, ESAS.

[13]  Reihaneh Safavi-Naini,et al.  An Efficient Signature Scheme from Bilinear Pairings and Its Applications , 2004, Public Key Cryptography.

[14]  Alexandra Boldyreva,et al.  Efficient threshold signature, multisignature and blind signature schemes based on the Gap-Diffie-Hellman-Group signature scheme , 2002 .

[15]  Claus-Peter Schnorr,et al.  Security of Blind Discrete Log Signatures against Interactive Attacks , 2001, ICICS.

[16]  Duc-Liem Vo,et al.  A New Threshold Blind Signature Scheme from Pairings , 2003 .

[17]  David Naccache,et al.  On blind signatures and perfect crimes , 1992, Comput. Secur..

[18]  Amos Fiat,et al.  Untraceable Electronic Cash , 1990, CRYPTO.

[19]  Jacques Stern,et al.  Provably Secure Blind Signature Schemes , 1996, ASIACRYPT.

[20]  Chin-Laung Lei,et al.  A Secure and Practical Electronic Voting Scheme for Real World Environments , 1997 .

[21]  Hovav Shacham,et al.  Short Signatures from the Weil Pairing , 2001, J. Cryptol..

[22]  David A. Wagner,et al.  A Generalized Birthday Problem , 2002, CRYPTO.

[23]  Adi Shamir,et al.  Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.

[24]  M. Michels,et al.  Hidden signature schemes based on the discrete logarithm problem and related concepts , 1995 .

[25]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[26]  Tatsuaki Okamoto,et al.  Provably Secure Partially Blind Signatures , 2000, CRYPTO.

[27]  Donald W. Davies.  Advances in cryptology--EUROCRYPT '91 : Workshop on the Theory and Application of Cryptographic Techniques, Brighton, UK, April 8-11, 1991 : proceedings , 1991 .

[28]  Jung Hee Cheon,et al.  A Forward-Secure Blind Signature Scheme Based on the Strong RSA Assumption , 2003, ICICS.

[29]  Kwangjo Kim,et al.  An Efficient and Provably Secure Threshold Blind Signature , 2001, ICISC.

[30]  Reihaneh Safavi-Naini,et al.  New Proxy Signature, Proxy Blind Signature and Proxy Ring Signature Schemes from Bilinear Pairing , 2003, IACR Cryptol. ePrint Arch..

[31]  Masayuki Abe,et al.  How to Date Blind Signatures , 1996, ASIACRYPT.

[32]  Kwangjo Kim,et al.  ID-Based Multi-Proxy Signature and Blind Multisignature from Bilinear Pairings , 2003 .

[33]  Claus-Peter Schnorr.  Enhancing the security of perfect blind DL-signatures , 2006, Inf. Sci..

[34]  Reihaneh Safavi-Naini,et al.  Efficient Verifiably Encrypted Signature and Partially Blind Signature from Bilinear Pairings , 2003, INDOCRYPT.

[35]  Jan Camenisch,et al.  Fair Blind Signatures , 1995, EUROCRYPT.

[36]  Hugo Krawczyk,et al.  Robust Threshold DSS Signatures , 1996, Inf. Comput..

[37]  Siu-Ming Yiu,et al.  Forward-secure multisignature and blind signature schemes , 2005, Appl. Math. Comput..

[38]  David Chaum,et al.  Showing Credentials without Identification Transfeering Signatures between Unconditionally Unlinkable Pseudonyms , 1990, AUSCRYPT.

[39]  Torben P. Pedersen.  Distributed Provers with Applications to Undeniable Signatures , 1991, EUROCRYPT.