UPM Institutional Repository

An identification scheme based on bivariate function hard problem


Tea, Boon Chian and Kamel Ariffin, Muhammad Rezal (2014) An identification scheme based on bivariate function hard problem. In: 4th International Cryptology and Information Security Conference 2014 (CRYPTOLOGY2014), 24-26 June 2014, Putrajaya, Malaysia. (pp. 48-56).


Recently, an identification scheme based on Diophantine Equation Hard Problem is proposed. The scheme was proven secure against impersonation under passive attack, assuming that solving Diophantine Equation Hard Problem is hard. However, further simulation showed that there exists non-negligible probability that the scheme can be easily impersonated without knowing the secret parameter. In this paper, another identification scheme based on Bivariate Function Hard Problem which is specific problem of Diophantine Equation Hard Problem (DEHP) is proposed. We prove by assuming that solving Bivariate Function Hard Problem is hard, our scheme is secure against the impersonation under passive, active and concurrent attacks. Also, our proposed is again more efficient than some selected schemes since the structure of our hard problem is similar to DEHP.

Download File

[img] Text
Restricted to Repository staff only

Download (590kB)

Additional Metadata

Item Type: Conference or Workshop Item (Paper)
Divisions: Faculty of Science
Institute for Mathematical Research
Publisher: Institute for Mathematical Research, Universiti Putra Malaysia
Keywords: Identification scheme; Security analysis; Diophantine equation hard problem; Bivariate function hard problem
Depositing User: Nabilah Mustapa
Date Deposited: 03 Mar 2019 23:54
Last Modified: 03 Mar 2019 23:54
URI: http://psasir.upm.edu.my/id/eprint/66480
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item