Factoring based proxy signature schemes

摘要

In proxy signature schemes, original signers delegate proxy signers to sign messages on behalf of original signers. Currently, most proxy signature schemes are based on the difficulty of discrete logarithms over finite field or ellipse curve addition group. Based on the difficulty of factorings of large integers, one normal proxy signature scheme and one multi-proxy signature scheme are proposed. The security properties of strong unforgeability, verifiability, strong nonrepudiation, strong identifiability, distinguishability and prevention of misuse of proxy signing power can be fulfilled by the proposed schemes. In addition, the performance of the proposed schemes is analysed as well.