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!