Abstract: Secure and efficient blind multisignature schemes have a number of important applications in electronic commerce and electronic cash systems. Structured multisignature algorithms by reference are analyzed and improved in this paper. We present fast and efficient structured blind multisignature schemes based on hyperelliptic curves. The signature structure is expanded from two levels to three levels, so both sequential and broadcast are better integration. And a variety of specific algorithms are given. Finally, the complexity and security of improved schemes are compared and analyzed. Comparing with current approaches, improved schemes reduce computation costs by $(3n+2)TH+(273.8n+32.2)TML$. The results show that improved schemes have the advantages of low computation complexity, low computation time, high security and easy to implement.

Key words: hyperelliptic curve, reduced divisors, blind signature, structured, multisignature