Efficient identity-based signatures in the standard model

The authors describe signature constructions in the standard model based on the hardness of the computational Diffie-Hellman problem over gap and co-gap groups. The schemes are computationally efficient and have reduced public parameter size when compared with other identity-based signatures in the standard model.