| 要約: | To address complex bilinear pairing operations and certificate management problems of existing blind proxy re-signature schemes,by using WANG’s scheme for reference,this paper proposes a partially blind proxy re-signature scheme without bilinear pairing based on hard problem of integer factorization.Also,the new formalized definition and security model of the scheme are given under different cryptosystems and the framework of partial blindness.In the random oracle model,the scheme satisfies the unforgeability and partial blindness under adaptive chosen message attacks,and is able to achieve the transparent conversion from the original signer to the proxy re-signer,so as to protect privacy of the original signer and reduce the computational complexity of the partially blind proxy re-signature algorithm,and improve the computational efficiency of the signature verification algorithm.Efficiency comparison and analysis results show that the proposed scheme can ensure applicability while effectively improving partial blindness.
|
|---|
