Short Structure Preserving Signatures
k Abstract. We construct a new structure preserving signature scheme in the ecient Type III asymmetric bilinear group setting with signa tures shorter than all existing schemes. Our signatures consist of 3 group elements from the rst source group and therefore have shorter size than all existing schemes as existing ones have at least one component of the signature in the second source group whose elements bit size is at least double their rst group counterparts. Besides enjoying short signatures, our scheme is fully re randomizable which is a useful property for many applications. Our result also con stitutes a proof that the impossibility of unilateral structure preserving signatures in the Type III setting result of Abe et al. (Crypto 2011) does not apply to constructions in which the message space is dual in both source groups. Besides checking the well formedness of the message, ver ifying a signature in our scheme requires checking 2 Pairing Product Equations (PPE) and require the evaluation of only 5 pairings in total which matches the best existing scheme and outperforms many other existing ones. Reducing the number of pairings in the verication equa tions is very important when combining structure preserving signature schemes with Groth Sahai proofs as the number of pairings required for verifying Groth Sahai proofs for PPE equations grows linearly with the number of pairing monomials in the source equations. We give some ex amples of how using our new scheme instead of existing ones improves the eciency of some existing cryptographic protocols such as direct anonymous attestation and group signature related constructions.