We propose the PARK-1 group signature scheme and the PARK-2 group signature scheme. The PARK-1 group signature scheme with SEM is based on bilinear pairings. An on-line third party called a SEM, is introduced to help our scheme to realize the "join" o...
We propose the PARK-1 group signature scheme and the PARK-2 group signature scheme. The PARK-1 group signature scheme with SEM is based on bilinear pairings. An on-line third party called a SEM, is introduced to help our scheme to realize the "join" of our scheme and immediate "revocation" of group membership. Thus, the PARK-1 group signature scheme is suitable for an anonymous electronic auction system with expensive bids. Also, the PARK-2 group signature scheme with SEM1 is based on bilinear pairings. To satisfy exculpability property on our scheme, SEM1 generates a partial private key of group member. Thus, even GM can not generate a valid signature on behalf of other group member. Particularly, the PARK-2 group signature scheme uses the transformation from weakly unforgeable signature scheme to strongly unforgeable signature scheme. Thus, the PARK-2 group signature scheme is suited to an anonymous electronic auction system with inexpensive bids. To design an anonymous electronic auction system with inexpensive bids which we get easily access to, we apply the PARK-2 group signature scheme to it. Our electronic auction system has selective conditional anonymity with trustee and is a sealed bid auction. Also, our system protects the privacy of bidder. In order words, even auction server can't tell who participate in bid and though seller tells a winner of bid, he can't tell who participate in bid. Also, our system satisfies all security requirements of anonymous electronic auction system.