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 |