The Research Of Threshold Group Signcryption Scheme Based On HECC

Neal Koblitz and Victor Miller propose the elliptic curve cryptosystem(ECC), widely apply in practice in recent years. Hyperelliptic curve cryptosystem(HECC) as a push AD of elliptic curve, by Neal Kobitz is put forward in 1989, it is based on the finite field on super Jacobian elliptic curve discrete logarithm problem. Under the same levels of safety, hyperelliptic curve cryptosystem is smaller than the base field of the elliptic curve cryptosystems, and HECC can simulate based on general multiplicative group such as DSA, ELGamal almost all agreement; On the same domain, kui g(g 4 or less), the greater the curve, the more so the more selection used in the password security curve.It is because the hyperelliptic curve cryptosystem has many a little than other password system, so in recent years, the study of the hyperelliptic curve cryptosystem is increasingly attention by people.(t, n) threshold signature is first put forward by Desmedt and Frankel, and respectively based on Lagrange interpolation polynomial and the nature of the multidimensional space point shows a(t, n) threshold secret sharing scheme.In this paper, using the hyperelliptic curve discrete logarithm problem intractability, based on the Lagrange interpolation polynomial, put forward a new(t, n) threshold secret sharing scheme.Plan participants can get validated sub secret from distribution center, to prevent the distribution center of the fraud.In addition, when recovery secret value m, can be provided by the other members to share any participants sub secret verification, to prevent the fraud behavior between the sharers.The program compared with the scheme based on RSA cryptosystem, such as in such aspects as security, computational efficiency, the system overhead has the obvious advantage.Zheng, in 1997 for the first time put forward the concept of "sign", it refers to the logical steps in a reasonable and complete digital signature and information encryption in two steps, and the computational costs and communication should be lower than the traditional "signature before encryption", in the process of network communication between groups, threshold of sign scheme has high security and maneuverability, based on the hyperelliptic curve cryptosystem, resistance against collusion attacks as well as to the fraud group traced, this paper proposes a new scheme, the scheme(t, n) threshold group signed in dense, on the basis of can distinguish the attack against attack comes from the group members and outside, and can be traced in view of the group of members of the fraud.With existing group communication oriented generalized compared threshold signing secret scheme, this scheme can avoid the malicious attacks of information, can resist internal fraud and external attacks, has less communication cost and higher safety, the safety of scheme is based on the hyperelliptic curve discrete logarithm problem on the intractability of the security at the same time, also has the advantages of HECC.