Research On Anonymous Signature Scheme Based On Non-interactive Zero-knowledge Proof

In this paper we make an intensive study of non-interactive zero knowledge, and in view of the anonymous requirement in practice, the inefficiency of the most anonymous signatures, and schemes without off-line mechanism or CCA secure, we proposed the combination of NIZK with the signatures. The main works are as follows:We construct an efficient group signature scheme called GSCOBG, which is based on BMW model in the composite order bilinear groups of three primes. To solve the above problem, we use Groth-Sahai proof system. The size of signature is a constant rather than relying on other parameters, and the scheme is secure under standard model. We compare the security and the efficiency respectively with the similar group signatures, and achieve the advantage.We construct non-interactive BB+and CL+signature schemes and prove the schemes’ security, which satisfy the properties such as anonymity(including signers and users), zero knowledge and Unforgeability and achieve identity authentication in the way of anonymity. The non-interactive signatures are used as anonymous authentication in the E-Commerce such as Electronic Auction, Electronic Voting and Trusted Computation. We apply the non-interactive BB+and CL+signatures in the anonymous Electronic Auction, and construct public auction protocol and sealed auction protocol. Comparing with the conventional schames, our schemes have stronger anonymity, traceability and non-interact, and reduce the communication cost.As a result, NIZK theory is useful to improve the security and efficiency of the traditional signatures, and provide off-line support.