An efficient identification scheme in standard model based on the diophantine equation hard problem
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 identif...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute for Mathematical Research, Universiti Putra Malaysia
2013
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/30256/1/30256.pdf http://psasir.upm.edu.my/id/eprint/30256/ http://einspem.upm.edu.my/journal/volume7s.php |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|