Algebraic Verification Algorithm

  • Areej M Abduldaim Department of Applied Sciences, University of Technology, Baghdad, Iraq


Authentication over insecure public networks or with untrusted servers raises more concerns in privacy and security.Modern algebra is one of the significantfields of mathematics. It is a combination of techniques used for a variety of applications including the process of the manipulation of the mathematical categories. In addition,modern algebra deals in depth with the study of abstractions such as groups, rings and fields,the main objective of this article is to provide a novel algebraic verification protocol using ring theory. The protocol is blind, meaning that it detects only the identity, and no additional information will be known anything about the prover (the biometric) to the authenticating server or vice-versa. More officially a blind authentication scheme is a cryptographic protocol that comprises of two parties, a user (the prover) that wants to achieve having signs on her messages, and a signer (the verifier) that is in ownership of his secret signing key. In this paper, we employ the algebraic structure called central Armendariz rings to design a neoteric algorithm for zero knowledge proof. The proposed protocol is established and illustrated through numerical example, and its soundness and completeness are proved.This method gave two important properties for the central Armendariz zero knowledge protocol compared with other known protocols.

Mar 30, 2018
How to Cite
ABDULDAIM, Areej M. Algebraic Verification Algorithm. International Journal of System Modeling and Simulation, [S.l.], v. 3, n. 1, p. 7-11, mar. 2018. ISSN 2518-0959. Available at: <>. Date accessed: 17 jan. 2019. doi: