An efficient identification scheme based on Bivariate function hard problem
Symmetric cryptography allows faster and more secure communication between two entities using the identical pre-established secret key. However, identifying the honest entity with the same secret key before initiating symmetric encryption is vital since the communication may be impersonated. Tea and...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Published: |
Multidisciplinary Digital Publishing Institute
2022
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/100234/ |
| _version_ | 1848863270093455360 |
|---|---|
| author | Boon, Chian Tea Kamel Ariffin, Muhammad Rezal Abd Ghafar, Amir Hamzah Sapar, Siti Hasana Mohamat Johari, Mohamat Aidil |
| author_facet | Boon, Chian Tea Kamel Ariffin, Muhammad Rezal Abd Ghafar, Amir Hamzah Sapar, Siti Hasana Mohamat Johari, Mohamat Aidil |
| author_sort | Boon, Chian Tea |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | Symmetric cryptography allows faster and more secure communication between two entities using the identical pre-established secret key. However, identifying the honest entity with the same secret key before initiating symmetric encryption is vital since the communication may be impersonated. Tea and Ariffin, in 2014, proposed a new identification (ID) scheme based on the Bivariate Function Hard Problem (BFHP) that proved secure against impersonation under passive, active and concurrent attacks via the BFHP-hardness assumption. In this paper, we upgrade the ID scheme and improve some of its settings. Next, we provide the security proof against impersonation under active and concurrent attacks in the random oracle model via the hardness assumption of the One-More BFHP. Finally, we include an additional discussion about the computational efficiency of the upgraded ID scheme based on BFHP and present its comparison with other selected ID schemes. |
| first_indexed | 2025-11-15T13:30:15Z |
| format | Article |
| id | upm-100234 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-15T13:30:15Z |
| publishDate | 2022 |
| publisher | Multidisciplinary Digital Publishing Institute |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-1002342024-07-11T04:20:10Z http://psasir.upm.edu.my/id/eprint/100234/ An efficient identification scheme based on Bivariate function hard problem Boon, Chian Tea Kamel Ariffin, Muhammad Rezal Abd Ghafar, Amir Hamzah Sapar, Siti Hasana Mohamat Johari, Mohamat Aidil Symmetric cryptography allows faster and more secure communication between two entities using the identical pre-established secret key. However, identifying the honest entity with the same secret key before initiating symmetric encryption is vital since the communication may be impersonated. Tea and Ariffin, in 2014, proposed a new identification (ID) scheme based on the Bivariate Function Hard Problem (BFHP) that proved secure against impersonation under passive, active and concurrent attacks via the BFHP-hardness assumption. In this paper, we upgrade the ID scheme and improve some of its settings. Next, we provide the security proof against impersonation under active and concurrent attacks in the random oracle model via the hardness assumption of the One-More BFHP. Finally, we include an additional discussion about the computational efficiency of the upgraded ID scheme based on BFHP and present its comparison with other selected ID schemes. Multidisciplinary Digital Publishing Institute 2022-08-27 Article PeerReviewed Boon, Chian Tea and Kamel Ariffin, Muhammad Rezal and Abd Ghafar, Amir Hamzah and Sapar, Siti Hasana and Mohamat Johari, Mohamat Aidil (2022) An efficient identification scheme based on Bivariate function hard problem. Symmetry, 14 (9). art. no. 1784. pp. 1-12. ISSN 2073-8994 https://www.mdpi.com/2073-8994/14/9/1784 10.3390/sym14091784 |
| spellingShingle | Boon, Chian Tea Kamel Ariffin, Muhammad Rezal Abd Ghafar, Amir Hamzah Sapar, Siti Hasana Mohamat Johari, Mohamat Aidil An efficient identification scheme based on Bivariate function hard problem |
| title | An efficient identification scheme based on Bivariate function hard problem |
| title_full | An efficient identification scheme based on Bivariate function hard problem |
| title_fullStr | An efficient identification scheme based on Bivariate function hard problem |
| title_full_unstemmed | An efficient identification scheme based on Bivariate function hard problem |
| title_short | An efficient identification scheme based on Bivariate function hard problem |
| title_sort | efficient identification scheme based on bivariate function hard problem |
| url | http://psasir.upm.edu.my/id/eprint/100234/ http://psasir.upm.edu.my/id/eprint/100234/ http://psasir.upm.edu.my/id/eprint/100234/ |