A zero-knowledge authentication scheme is a type of authentication scheme is a, which gives no knowledge beyond the authenticity identifying an entity and is probabilistic than deterministic authentication scheme. This paper proposes Diffie-Hellman and Fiat-Shamir like zero-knowledge authentication scheme on generalized near rings. The key idea of our proposal is that for a near ring one can define near ring polynomial and takes them as underlying work structure and to implement the authentication schemes. The security of the proposed schemes is based on the intractability of the near ring polynomial symmetrical decomposition problem over the given near ring. © Research India Publications.