Summary: | 碩士 === 輔仁大學 === 資訊管理學系 === 89 === Most of proposed multi-proxy signature schemes based on discrete logarithm. In this paper, we hope to combine discrete logarithm with factorization, that strengthen the security of multi-proxy. Both of discrete logarithm and factorization are the hard problem of computational complexity.
In execution of multi-proxy signature, we have to think over the problem of proxy change, for example quit job, sickness, or death. Then, in the paper, we hope to improve multi-proxy signature scheme for the problem of proxyies append and delete by Rabin’s scheme.
|