This study, for the first time, presents a proxy blind signature scheme with message recovery. The proposed scheme is based on Tan et al .?s proxy blind signature scheme and Abe and Okamoto?s signature scheme with message recovery.When practical hash functions are used in the place of truly random functions,the scheme is almost as efficient as the existing schemes with message recovery such as Zhang et al .?s scheme. And, it can be proven to be unforgeable against adaptively chosen message attacks in the random oracle model under the discrete logarithm assumption, like Abe and Okamoto scheme.
展开▼
