An efficient fail-stop signature scheme based on factorization
Willy Susilo, Reihaneh Safavi–Naini · 2003
Abstract. Fail-stop signature (FSS) schemes protect a signer against a forger with unlimited computational power by enabling the signer to provide a proof of forgery, if it occurs. In this paper, we show a flaw in a previously proposed fail-stop signature that is based on the difficulty of factorization, and then describe a secure scheme based on the same assumption. 1.