UPM Institutional Repository

An efficient identification scheme in standard model based on the diophantine equation hard problem


Citation

Tea, Boon Chian and Kamel Ariffin, Muhammad Rezal and Chin, Ji Jian (2013) An efficient identification scheme in standard model based on the diophantine equation hard problem. Malaysian Journal of Mathematical Sciences, 7 (spec.). pp. 87-99. ISSN 1823-8343; ESSN: 2289-750X

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 such 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.


Download File

[img]
Preview
PDF
30256.pdf

Download (133kB) | Preview
Official URL or Download Paper: http://einspem.upm.edu.my/journal/volume7s.php

Additional Metadata

Item Type: Article
Divisions: Faculty of Science
Institute for Mathematical Research
Publisher: Institute for Mathematical Research, Universiti Putra Malaysia
Notes: Special Issue: The 3rd International Conference on Cryptology & Computer Security 2012 (CRYPTOLOGY2012)
Keywords: Diophantine equation hard problem; Impersonation against non-adaptive passive attack; Standard identification scheme model
Depositing User: Umikalthom Abdullah
Date Deposited: 10 Sep 2014 06:45
Last Modified: 23 Jan 2019 00:34
URI: http://psasir.upm.edu.my/id/eprint/30256
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item