Cover Image

An identification scheme based on bivariate function hard problem

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

Full description

Saved in:
Bibliographic Details
Main Authors: Tea, Boon Chian, Kamel Ariffin, Muhammad Rezal
Format: Conference or Workshop Item
Language:English
Published: Institute for Mathematical Research, Universiti Putra Malaysia 2014
Online Access:http://psasir.upm.edu.my/id/eprint/66480/1/Cryptology2014-1.pdf
http://psasir.upm.edu.my/id/eprint/66480/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.upm.eprints.66480
record_format eprints
spelling my.upm.eprints.664802019-03-03T23:54:02Z http://psasir.upm.edu.my/id/eprint/66480/ An identification scheme based on bivariate function hard problem Tea, Boon Chian Kamel Ariffin, Muhammad Rezal 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. Institute for Mathematical Research, Universiti Putra Malaysia 2014 Conference or Workshop Item PeerReviewed text en http://psasir.upm.edu.my/id/eprint/66480/1/Cryptology2014-1.pdf 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).
institution Universiti Putra Malaysia
building UPM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Putra Malaysia
content_source UPM Institutional Repository
url_provider http://psasir.upm.edu.my/
language English
description 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.
format Conference or Workshop Item
author Tea, Boon Chian
Kamel Ariffin, Muhammad Rezal
spellingShingle Tea, Boon Chian
Kamel Ariffin, Muhammad Rezal
An identification scheme based on bivariate function hard problem
author_facet Tea, Boon Chian
Kamel Ariffin, Muhammad Rezal
author_sort Tea, Boon Chian
title An identification scheme based on bivariate function hard problem
title_short An identification scheme based on bivariate function hard problem
title_full An identification scheme based on bivariate function hard problem
title_fullStr An identification scheme based on bivariate function hard problem
title_full_unstemmed An identification scheme based on bivariate function hard problem
title_sort identification scheme based on bivariate function hard problem
publisher Institute for Mathematical Research, Universiti Putra Malaysia
publishDate 2014
url http://psasir.upm.edu.my/id/eprint/66480/1/Cryptology2014-1.pdf
http://psasir.upm.edu.my/id/eprint/66480/
_version_ 1643838619615494144
score 13.211869

Similar Items