| Summary: | 碩士 === 國立臺灣海洋大學 === 資訊工程學系 === 96 === In this thesis, a threshold Paillier proxy signature scheme is proposed. The additive homomorphism of the Paillier cryptosystem, together with the proxy mechanism and the threshold trust make it more convenient than other probabilistic cryptosystems in designing electronic voting systems or electronic auction systems. In this thesis, this scheme is proven to be unforgeabile, proxy-protected, undeniabile, secret and signer-identi?able against chosen message attackers in the random oracle model. These security properties of this scheme are based on the computational composite residuosity assumption.
|
|---|
