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...
| Main Authors: | , |
|---|---|
| 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 |
| _version_ | 1825933143586111488 |
|---|---|
| author | Tea, Boon Chian Kamel Ariffin, Muhammad Rezal |
| author_facet | Tea, Boon Chian Kamel Ariffin, Muhammad Rezal |
| author_sort | Tea, Boon Chian |
| collection | UPM |
| 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. |
| first_indexed | 2024-03-06T09:52:45Z |
| format | Conference or Workshop Item |
| id | upm.eprints-66480 |
| institution | Universiti Putra Malaysia |
| language | English |
| last_indexed | 2024-03-06T09:52:45Z |
| publishDate | 2014 |
| publisher | Institute for Mathematical Research, Universiti Putra Malaysia |
| record_format | dspace |
| spelling | 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). |
| spellingShingle | Tea, Boon Chian Kamel Ariffin, Muhammad Rezal An identification scheme based on bivariate function hard problem |
| title | 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_short | An identification scheme based on bivariate function hard problem |
| title_sort | identification scheme based on bivariate function hard problem |
| url | http://psasir.upm.edu.my/id/eprint/66480/1/Cryptology2014-1.pdf |
| work_keys_str_mv | AT teaboonchian anidentificationschemebasedonbivariatefunctionhardproblem AT kamelariffinmuhammadrezal anidentificationschemebasedonbivariatefunctionhardproblem AT teaboonchian identificationschemebasedonbivariatefunctionhardproblem AT kamelariffinmuhammadrezal identificationschemebasedonbivariatefunctionhardproblem |