## A Group Signature Scheme with Efficient Membership Revocation For Middle-scale Groups (2005)

Citations: | 5 - 1 self |

### BibTeX

@MISC{Nakanishi05agroup,

author = {Toru Nakanishi and et al.},

title = {A Group Signature Scheme with Efficient Membership Revocation For Middle-scale Groups},

year = {2005}

}

### OpenURL

### Abstract

This paper proposes a group signature scheme with efficient membership revocation. Though group signature schemes with efficient membership revocation based on a dynamic accumulator were proposed, the previous schemes force a member to change his secret key whenever he makes a signature. Furthermore, for the modification, the member has to obtain a public membership information of O(ℓnN) bits, where ℓn is the length of the RSA modulus and N is the total number of joining members and removed members. In our scheme, the signer needs no modification of his secret, and the public membership information has only K bits, where K is the maximal number of members. Then, for middle-scale groups with the size that is comparable to the RSA modulus size (e.g., up to about 1000 members for 1024 bit RSA modulus), the public membership information is a single small value only, while the signing/verification also remains efficient.

### Citations

1331 | Random oracles are practical: A paradigm for designing efficient protocols - Bellare, Rogaway - 1993 |

829 | How to prove yourself: practical solutions to identification and signature problems - Fiat, Shamir - 1986 |

492 |
Undeniable Signatures
- Chaum, Antwerpen
- 1989
(Show Context)
Citation Context ...rify user’s ownership of some privilege, it is applied to various cryptographic protocols such as anonymous credential system [6]. On the other hand, various group signature schemes are also proposed =-=[10, 5, 1, 4, 2, 7, 12]-=-, with the improvements of efficiency, security and convenience. The breakthrough is achieved in [5]. In this scheme, the efficiency of the public key and signatures is independent from the group size... |

264 | Efficient group signature schemes for large groups
- Camenisch, Stadler
(Show Context)
Citation Context ...rify user’s ownership of some privilege, it is applied to various cryptographic protocols such as anonymous credential system [6]. On the other hand, various group signature schemes are also proposed =-=[10, 5, 1, 4, 2, 7, 12]-=-, with the improvements of efficiency, security and convenience. The breakthrough is achieved in [5]. In this scheme, the efficiency of the public key and signatures is independent from the group size... |

238 | A practical and provably secure coalition-resistant group signature scheme
- Ateniese, Camenisch, et al.
(Show Context)
Citation Context ...rify user’s ownership of some privilege, it is applied to various cryptographic protocols such as anonymous credential system [6]. On the other hand, various group signature schemes are also proposed =-=[10, 5, 1, 4, 2, 7, 12]-=-, with the improvements of efficiency, security and convenience. The breakthrough is achieved in [5]. In this scheme, the efficiency of the public key and signatures is independent from the group size... |

207 | An efficient system for non-transferable anonymous credentials with optional anonymity revocation
- Camenisch, Lysyanskaya
- 2001
(Show Context)
Citation Context ...the anonymity of a signature. Since the scheme allows us to anonymously verify user’s ownership of some privilege, it is applied to various cryptographic protocols such as anonymous credential system =-=[6]-=-. On the other hand, various group signature schemes are also proposed [10, 5, 1, 4, 2, 7, 12], with the improvements of efficiency, security and convenience. The breakthrough is achieved in [5]. In t... |

168 | Dynamic accumulators and application to efficient revocation of anonymous credentials
- Camenisch, Lysyanskaya
(Show Context)
Citation Context |

156 | A.: A signature scheme with efficient protocols
- Camenisch, Lysyanskaya
- 2002
(Show Context)
Citation Context ... uniform random selection. 3.2 Camenisch-Lysyanskaya Signature Scheme for blocks of messages Our group signature scheme is based on the ordinary (not group) signature due to Camenisch and Lysyanskaya =-=[8]-=- under the strong RSA assumption, which is an extension from the signature used as a membership certificate in Ateniese et al.’s scheme [1]. Key generation: Let ℓn, ℓm, ℓs, ℓe, ℓ be security parameter... |

152 | Efficient proofs that a committed number lies in an interval
- Boudot
- 2000
(Show Context)
Citation Context ... of a representation [11]. We furthermore use the SP K of representations with equal parts, SP K of a representation with parts in intervals [9], and SP K of a representation with a non-negative part =-=[3]-=-. SP K of representation: An SP K proving the knowledge of a representation of C ∈ QR(n) to the bases g1, g2, . . . , gt ∈ QR(n) on message m is denoted as SP K{(α1, . . . , αt) : C = g α1 1 · · · gαt... |

132 | Statistical Zero Knowledge Protocols to Prove Modular - Fujisaki, Okamoto - 1997 |

129 | Foundations of group signatures: formal definitions, simplified requirements and a construction based on general assumptions - Bellare, Micciancio, et al. - 2003 |

75 | Separability and efficiency for generic group signature schemes - Camenisch, Michels - 1999 |

71 | A Statistically-Hiding Integer Commitment Scheme Based on
- Damgård, Fujisaki
- 2002
(Show Context)
Citation Context ...ke and A ′ = Ab k for k ∈ Z, since A ′e = (Ab k ) e = a m1 1 · · · a mL L bs cb ke = a m1 1 · · · a mL L bs′ c.s3.3 Commitment Scheme A commitment scheme on QR(n) is proposed by Damg˚ard and Fujisaki =-=[11]-=-,under the strong RSA assumption. The following is a slightly modified version due to Camenisch and Lysyanskaya [8]. Key generation: The public key consists of a secure RSA modulus n of length ℓn, h f... |

71 | Easy come - easy go divisible cash - Chan, Frankel, et al. - 1998 |

57 | Quasi-efficient revocation in group signatures - Ateniese, Song, et al. - 2002 |

47 | On the security of ElGamal based encryption - Tsiounis, Yung |

39 | Practical forward secure group signature schemes - Song - 2001 |

32 | Signature Schemes and Applications to Cryptographic Protocol Design - Lysyanskaya - 2002 |

28 | Efficient group signatures without trapdoors - Ateniese, Medeiros |

21 | Accumulating composites and improved group signing
- Tsudik, Xu
- 2003
(Show Context)
Citation Context |

17 | An nonymous electronic bidding protocol based on a new convertible group signature scheme - Sakurai, Miyazaki - 2000 |

10 | Unlinkable divisible electronic cash - Nakanishi, Sugiyama |

3 |
Group signature scheme with efficient revocation
- Bresson, Stern
- 1992
(Show Context)
Citation Context |