A strong blind signature scheme over the braid groups

doi:10.7523/j.issn.2095-6134.2011.6.018

Abstract

Abstract:

A new computational problem over braid groups, one-more root extraction problem, is described, and a new strong blind signature scheme is constructed. The constructed scheme can resist one-more existential forgery against the adaptively chosen message attack under the random oracle model and has advantage over the conjugate blind signature schemes in computational efficiency and shortening signature.

Key words: blind signature, braid group, one-more root extraction problem, random oracle model

CLC Number:

TP309

WEI Yun, XIONG Guo-Hua, ZHANG Xing-Kai, BAO Wan-Su. A strong blind signature scheme over the braid groups[J]. , 2011, 28(6): 826-831.

References

[1] Shor P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
[J]. SIAM Journal on Computing, 1997, 26(5): 1484-1509.

[2] Kitaev A. Quantum measurements and the abelian stabilizer problem.http://arxiv.org/quant-ph/9511026. 2010.6.

[3] Artin E. Theory of braids
[J]. Annals of Mathematics Studies, 1947, 48(2): 101-126.

[4] Ko K H, Lee S J, Cheon J H, et al. New public key cryptosystem using braid groups //Proceedings of Crypto-2000, Lecture Notes in Computer Science. Berlin: Springer-Verlag, 2000, 1880: 166-183.

[5] Anshel I, Anshel M, Fisher B, et al. New key agreement protocol in braid group cryptography //Topics in Cryptology-CT-RSA 2001, Lectures Notes in Computer Science. Berlin: Springer-Verlag, 2001, 2020: 1-15.

[6] Cha J C, Ko K H, Lee S J, et al. An efficient implementation of braid groups //Advances in Cryptology: Proceedings of ASIACRYPT 2001, Lecture Notes in Computer Science. Berlin: Springer-Verlag, 2001, 2248: 144-156.

[7] Sibert H, Dehornoy P, Girault M. Entity authentication schemes using braid word reduction.http://eprint.iacr.org/2002/187.

[8] Lal S, Chaturvedi A. Authentication schemes using braid groups.http://arXiv.org/cs.CR/0507066.

[9] Ko K H, Choi D H, Cho M S, et al. New signature scheme using conjugacy problem.http://eprint.iacr.org/2002/168.

[10] Ding Y, Tian H B, Wang Y M. An improved signature scheme based on the braid group
[J]. Journal of Xidian University, 2006, 33(1): 50-52(in Chinese). 丁勇, 田海博, 王育民. 一种改进的基于辫群的签名体制
[J]. 西安电子科技大学学报, 2006, 33(1): 50-52.

[11] Thomas T, Lal A K. Group signature scheme using braid groups.http://arXiv.org/cs.CR/0602063.

[12] Verma G K. Blind signature schemes over braid groups.http://eprint.iacr.org/2008/027.

[13] Verma G K. A proxy signature scheme over braid groups.http://eprint.iacr.org/2008/160.

[14] Zhang L L, Zeng J W. Proxy signature based on braid group
[J]. Journal of Mathematical Study, 2008, 41(1): 56-64.

[15] Lal S, Verma V. Some proxy signature and designated verifier signature schemes over braid groups. http://arXiv.org/cs.CR/09043422.

[16] Verma G K. A proxy blind signature scheme over braid groups
[J]. International Journal of Network Security, 2009, 9(3): 214-217.

[17] Wei Y, Xiong G H, Zhang X K, et al. Security analysis and design of proxy signature schemes over braid groups. http://eprint.iacr.org/2009/458.

[18] Wei Y, Xiong G H, Bao W S, et al. A strong blind signature scheme over braid groups. http://eprint.iacr.org/2009/622.

[19] Manoj K. Linkability of blind signature schemes over braid groups. http://eprint.iacr.org/2009/192.

[20] Manoj K. On the security of a proxy blind signature scheme over braid groups. http://eprint.iacr.org/2009/361.

[21] Bellare M, Namprempre C, Pointcheval D, et al. The power of RSA inversion oracles and the security of Chaum's RSA-based blind signature scheme //Financial Cryptography 01, Lecture Notes in Computer Science. Berlin: Springer-Verlag, 2002, 2339: 319-338.

[22] Pointcheval D, Stern J. Security arguments for digital signatures and blind signatures
[J]. Journal of Cryptology, 2000, 13(3): 361-396.