Cryptographic Undeniable Signature System Using DLCSFP Over Semiring

Chaum and Van first introduced the Undeniable Signature Scheme (USS) in 1989. A significant advantage of the USS scheme is that the signer participates in the verification process. In this study, we present the Discrete Logarithm Conjugacy Search Factor Problem (DLCSFP) and provide an evaluation of its security and complexity. We then propose an undeniable signature method based on DLCSFP and evaluate the security and complexity of this new scheme.