Research on Fail-Stop Signature Schemes

Security of ordinary digital signature schemes almost relies on a computational assumption.To prevent a forger with unlimited computational power from forging a signature and protect the signer's benefit,a new and efficient fail-stop signature scheme was proposed.Two hard problems were used,discrete logarithm and factorization,as the basis of receiver's security.The scheme provides provable security against adaptively chosen plaintext attack.As is shown that it is the most optimal scheme with respect to the ratio of the message length to the signature length and is efficient in signing long messages based on the results of analyzing and comparing.