失败-停止签名方案研究

普通的数字签名方案的安全性几乎都依赖于一个计算假设。为了防止具有无限计算能力的攻击者成功伪造签名，以保护签名者的利益，提出了一个新的更为高效的失败-停止签名方案。方案中使用了两个数学上的困难问题：离散对数和因子分解，从而为接收者提供安全性。该方案具有可证明的安全性以抵抗自适应选择明文攻击。分析比较结果表明该方案在消息长度与签名长度比率方面是最优的，对长消息签名是高效的。

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.