A new proxy signature with revocationbased on factoring and discrete logarithm

摘要

In 2006, Lu et al. proposed a proxy signature with revocation based on the discretelogarithm problem. In their scheme an original signer delegated his signing capabilityto a proxy signer on behalf of the original signer and revoke delegation when forgerydetected. All previous proxy signature schemes have been based on single problem.Therefore, it has been proven it will not secure anymore since day to day singleproblem has been solved. To encounter this problem we propose a new proxysignature with revocation with two hard problems. To our best knowledge, this is thefirst proxy signature with revocation based on factoring and discrete logarithms usingtwo hard problems with advancement security.