A New Chameleon Multi-signature Based on Bilinear Pairing
With the combination of vector space secret sharing and Chameleon function, a new Chameleon multi-signature based on bilinear pairing is presented in this paper. The scheme has following properties: only the appointed receiver can verify the signature; the appointed receiver can’t disclose contents of the signed information to any third party without the signer’s consent; undeniable; when dispute occur, the signer can prove the signature to be forged without exposure the origin signature; it can protect the signature from allied cheating which comes from in or out the group. With the security analysis, we can conclude that the signature is secure.
KeywordsSignature Scheme Secret Sharing Discrete Logarithm Secret Sharing Scheme Blind Signature Scheme
Unable to display preview. Download preview PDF.
- 1.Krawczyk, H., Rabin, T.: Chameleon signatures. In: Proceedings of NDSS 2000, pp. 143–154 (2000)Google Scholar
- 2.Zhang, F., Safavi-Naini, R., Susilo, W.: ID-Based Chameleon Hashes from Bilinear Pairings, http://eprint.iacr.org/2003/208
- 4.Xu, C.X., Tong, X.F., Xiao, Z.G.: A Vector Space Secret Sharing Against Cheating. Journal of Xi Dian University 29(4), 257–260 (2002)Google Scholar
- 5.Libert, B., Quisquater, J.-J.: Identity Based Undeniable Signatures, http://eprint.iacr.org/2003/206
- 7.Chen, X., Zhang, F., Kim, K.: A New ID-based Group Signature Scheme from Bilinear Pairings. Cryptology ePrint ArchiveGoogle Scholar
- 8.Vo, D.L., Zhang, F., Kim, K.: A New Threshold Blind Signature Scheme from Pairings. In: 2003 Symposium on Cryptography and Information Security (SCIS 2003), Itaya, Japan, January 26-29, vol. 1/2, pp. 233–238 (2003)Google Scholar