An improved fail-stop signature scheme based on dual complexities

The basic design supposition for digital signatures in the cryptology domain is that the attacking and victimized computers have comparable resources. The operation of electronic commerce is based on this assumption, but the advent of accumulated networked resources and the changing computing landscape have elevated this risk. However, if an attacker has powerful computing capabilities compared with the victim, the attacker will, in given time, crack his password and gain the ability to fraudulently use the victim's identity. To avoid this threat, this study presents a plan that is based on the complexity of the fail-stop signature (FSS) scheme and the discrete logarithm and factorization of 2 mathematical problems of the digital signature algorithm. The scheme can be implemented in e-commerce information security environments and provides the user with the possibility of preventing attacks and enhancing system safety. This fail-stop scheme can assert a victim's innocence without exposing the n = p×q secret and guards against malicious behavior.