Group Signatures: Unconditional Security for Members
Abstract:
First a detailed definition of group signatures, originally suggested by Chaum and van Heijst, is given. Such signatures allow members of a group to sign messages anonymously on behalf of the group subject to the constraint that in case of disputes later on a designated authority can identify the signer. It is shown that if such schemes are to provide information theoretic anonymity, then the length of the secret information of the members and the authority increases with the number of members and the number of signatures each member is allowed to make. A dynamic scheme meeting these lower bounds is described. Unlike previous suggestions it protects each member unconditionally against framing, i.e. being hold responsible for a signature made by someone else. 1
Citations
| 173 | The Art of Computer Programming: Seminumerical Algorithms, volume 2 – Knuth - 1981 |
| 91 | Provable secure and practical identification schemes and corresponding signature schemes – Okamoto - 1993 |
| 67 | Random self-reducibility and zero knowledge interactive proofs of possession of information – Tompa, Woll - 1987 |
| 26 | A Digital Multisignature Scheme Using Bijective Public-Key Cryptosystems – Okamoto - 1988 |
| 19 | A digital multisignature scheme based on the Fiat-Shamir scheme”, Asiacrypt 91 – Ohta, Okamoto - 1991 |
| 8 | How to make efficient fail-stop signatures – Heijst, Pedersen - 1993 |
| 6 | How to make efficient fail-stop signatures – Heyst, Pederson - 1992 |
| 3 | Efficient proofs of or – Schoenmakers - 1993 |
| 1 | Special Signature Schemes – Heijst - 1992 |
