Signature Scheme Provably Secure in the Standard Model

Digital signatures provide authentication functionality and are important building blocks of some cryptographic protocols.An efficient digital signature scheme provably secure in the standard model from bilinear maps was proposed.The proposed signature scheme was showed to be strongly existentially unforgeable under adaptive chosen message attacks based on the strong Diffie-Hellman assumption and the formal proof of security was given.In the proposed signature scheme,the generation of signatures needs no pairing operation and the verification just needs two pairing operations.The signature length in the proposed signature scheme is shorter than that of RSA based signatures with the same security level.