Blind Proxy Signature Scheme Based on Both ECDLP and IFP
After studying blind proxy signature scheme and a group of digital signature schemes based on two hard mathematical problems, a new blind proxy signature scheme based on both Elliptic Curve Discrete Logarithm Problem and Integer Factoring Problem is proposed and its security is analyzed. The analysis results show that the scheme satisfies all necessary security properties of the proxy signature schemes. Furthermore, the original signer can't confirm the proxy signer's identity from an effective proxy signature. This scheme's capability of anti-attacking is improved evidently comparing with existing blind proxy signature schemes based on one mathematical hard problem.