RSA-based fail-stop signature schemes

Fail-stop signatures provide security for a sender against a forger with unlimited computational power. In this paper we present an efficient fail-stop signature based on RSA algorithm with the property that the proof of forgery is by revealing non-trivial factors of RSA modulus. We also present a variant which allows a more efficient proof of forgery by revealing the plaintext of an RSA encrypted ciphertext. We will show that our fail-stop signature scheme works in the two commonly used models of signature schemes, with or without a trusted authority.