An Efficient Group Signature Scheme from Bilinear Maps
نویسندگان
چکیده
We propose a new group signature scheme which is secure if we assume the Decision Diffie-Hellman assumption, the q-Strong Diffie-Hellman assumption, and the existence of random oracles. The proposed scheme is the most efficient among the all previous group signature schemes in signature length and in computational complexity. This paper is the full version of the extended abstract appeared in ACISP 2005 [17]. key words: group signature, bilinear map, efficient
منابع مشابه
A Novel Identity-based Group Signature Scheme from Bilinear Maps
We propose an identity-based group signature scheme from bilinear maps. The scheme has the security properties of group signatures. Our scheme is based on the CDHP assumption and bilinear maps between groups. The size of the group pubic key and the length of the signature are independent on the number of group members. Furthermore, a group member can sign many message using the same key pair.
متن کاملVerifier-Local Revocation Group Signature Schemes with Backward Unlinkability from Bilinear Maps
An approach of membership revocation in group signatures is verifier-local revocation (VLR for short). In this approach, only verifiers are involved in the revocation mechanism, while signers have no involvement. Thus, since signers have no load, this approach is suitable for mobile environments. Although Boneh and Shacham recently proposed a VLR group signature scheme from bilinear maps, this ...
متن کاملSignature Schemes and Anonymous Credentials from Bilinear Maps
We propose a new and efficient signature scheme that is provably secure in the plain model. The security of our scheme is based on a discrete-logarithm-based assumption put forth by Lysyanskaya, Rivest, Sahai, and Wolf (LRSW) who also showed that it holds for generic groups and is independent of the decisional Diffie-Hellman assumption. We prove security of our scheme under the LRSW assumption ...
متن کاملNew Paradigms in Signature Schemes
Digital signatures provide authenticity and nonrepudiation. They are a standard cryptographic primitive with many applications in higher-level protocols. Groups featuring a computable bilinear map are particularly well suited for signature-related primitives. For some signature variants the only construction known uses bilinear maps. Where constructions based on, e.g., RSA are known, bilinear-m...
متن کاملNew Paradigms in Signature Schemes a Dissertation Submitted to the Department of Computer Science and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy
Digital signatures provide authenticity and nonrepudiation. They are a standard cryptographic primitive with many applications in higher-level protocols. Groups featuring a computable bilinear map are particularly well suited for signature-related primitives. For some signature variants the only construction known uses bilinear maps. Where constructions based on, e.g., RSA are known, bilinear-m...
متن کامل