ID-based Threshold Blind Signature scheme from Bilinear Pairing
暂无分享,去创建一个
Zhenfu Cao | Xiaohui Liang | Rongxing Lu | Rongxing Lu | Z. Cao | X. Liang | ZhenChuan Chai | Zhenchuan Chai
[1] David Chaum,et al. Blind Signatures for Untraceable Payments , 1982, CRYPTO.
[2] Kwangjo Kim,et al. An Efficient and Provably Secure Threshold Blind Signature , 2001, ICISC.
[3] Jan Camenisch,et al. Blind Signatures Based on the Discrete Logarithm Problem , 1994, EUROCRYPT.
[4] Alexandra Boldyreva,et al. Efficient threshold signature , multisignature and blind signature schemes based on the Gap-Diffie-Hellman-group signature scheme , 2002 .
[5] Siu-Ming Yiu,et al. Two Improved Partially Blind Signature Schemes from Bilinear Pairings , 2005, ACISP.
[6] Tsz Hon Yuen,et al. Fast and Proven Secure Blind Identity-Based Signcryption from Pairings , 2005, CT-RSA.
[7] Adi Shamir,et al. How to share a secret , 1979, CACM.
[8] Jean-Jacques Quisquater,et al. A new identity based signcryption scheme from pairings , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).
[9] Duc-Liem Vo,et al. A New Threshold Blind Signature Scheme from Pairings , 2003 .
[10] Claus-Peter Schnorr,et al. Security of Blind Discrete Log Signatures against Interactive Attacks , 2001, ICICS.
[11] Jacques Stern,et al. Provably Secure Blind Signature Schemes , 1996, ASIACRYPT.
[12] Fuw-Yi Yang,et al. A Provable Secure Scheme for Partially Blind Signatures , 2004, IACR Cryptol. ePrint Arch..
[13] A. Shamm. Identity-based cryptosystems and signature schemes , 1985 .
[14] K. C. Reddy,et al. Signcryption scheme for Identity-based Cryptosystems , 2003, IACR Cryptol. ePrint Arch..
[15] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[16] Chanathip Namprempre,et al. The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme , 2003, Journal of Cryptology.
[17] John Malone-Lee,et al. Identity-Based Signcryption , 2002, IACR Cryptol. ePrint Arch..