Malaysian Journal of Mathematical Sciences, August 2013, Vol. 7(S)
Special Issue: The 3rd International Conference on Cryptology & Computer Security 2012 (CRYPTOLOGY2012)
An Efficient Identification Scheme in Standard Model Based on the Diophantine Equation Hard Problem
B. C. Tea, M. R. K. Ariffin and J. J. Chin
Corresponding Email: rezal@putra.upm.edu.my
Received date: -
Accepted date: -
Abstract:
Recently the Diophantine Equation Hard Problem (DEHP) was proposed. It is utilized to design a standard identification scheme model. Since the computation involves only simple addition and multiplication steps, the efficiency and the time cost are greatly improved as compared to the existing identification schemes. In this paper, we propose a zero-knowledge identification scheme based upon the DEHP. With the assumption that DEHP is intractable, we provide the security analysis on the impersonation against non-adaptive passive attack (imp-pa) and show that our new proposed scheme is more desirable due to high efficiency in terms of time computation.
Keywords: Diophantine Equation Hard Problem, standard identification scheme model, impersonation against non-adaptive passive attack
Indexing
