An Efficient Verifiably Encrypted Signature Scheme
Shanshan Zhang · Journal of Xianyang Normal University · 2010
In order to design a secure and efficient verifiably encrypted signature scheme,we first proposed a new digital signature scheme under the Square Computational Diffie-Hellman assumption.The scheme is probably secure in the random oracle model.And then,based on the proposed signature scheme,a blind verifiably encrypted signature(BVES) scheme was presented in this paper.The BVES scheme enjoys desirable properties of unforgeability and opacity.Compared with existing VES schemes,our scheme’s computational cost is lower and the whole operation only requires two pairing evaluations and five scalar multiplications.The size of the signature generated by our BVES is only 320 bits.So it can be used in environments with stringent bandwidth constraints.