Deniable Authentication Protocol Based on Chebyshev Polynomial Over GF(q)

Deniable authentication protocol enable a recipient to verify the authenticity of a received message while keeping the sender's identity hidden from any third parties. Compared to interactive protocol, non-interactive approaches offer improved efficiency by reducing authentication overhead. This advantage has led to the proposal of numerous non-interactive deniable authentication protocols. Hence, an idea come up to develop a deniable authentication protocol that is non-interactive, secure and efficient. This paper introduces the development of deniable authentication protocol based on Chebyshev Polynomial over GF(q). An enhancement rooted in the Chebyshev Polynomial over finite fields is proposed, since Chebyshev Polynomial over GF(q) provides security of the algorithm rely on the difficulty of computing discrete logarithms over finite fields together with fast execution time. Concurrently, the proposed protocol exhibits characteristics of completeness, deniability, resistance to forgery, impersonation and man-in-the-middle attacks that has been proved.