Shorter Group Signatures Scheme with Verifier-Local Revocation
Yumin Wang
Abstract
Yumin Wang
Abstract
Aiming at the intrinsic problems in verifier-local revocation group signatures,such as reducing the computational costs,shortening the signature length and so on,a new verifier-local revocation group signature is proposed based on the strong Diffie-Hellman assumption and the decisional tripartite Diffie-Hellman assumption.In the proposed scheme,a member in the group generates his own private key together with the group manager to realize exculpability,and the computation costs of revocation check are independent of the length of the revocation list by verifying whether the value in the revocation list is equal to some known value in the signing process.The bilinear maps in the revocation check are no longer required,and the shortcoming that the computational costs are linear with the length of the revocation list in the existing verifier-local revocation(VLR) schemes is overcome.The size of a signature in the proposed scheme is just 1 533 bits,and reduces about 30%-47% compared with that of the existing VLR group signatures.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Aiming at the intrinsic problems in verifier-local revocation group signatures,such as reducing the computational costs,shortening the signature length and so on,a new verifier-local revocation group signature is proposed based on the strong Diffie-Hellman assumption and the decisional tripartite Diffie-Hellman assumption.In the proposed scheme,a member in the group generates his own private key together with the group manager to realize exculpability,and the computation costs of revocation check are independent of the length of the revocation list by verifying whether the value in the revocation list is equal to some known value in the signing process.The bilinear maps in the revocation check are no longer required,and the shortcoming that the computational costs are linear with the length of the revocation list in the existing verifier-local revocation(VLR) schemes is overcome.The size of a signature in the proposed scheme is just 1 533 bits,and reduces about 30%-47% compared with that of the existing VLR group signatures.
Key concepts: Revocation, Group signature, Computer science, Computer security, Group (periodic table), Signature (topology), Scheme (mathematics), Theoretical computer science