Constructing a One-time and a Few-time Digital Signature Schemes from the Hardness of Megrelishvili Vector-Matrix Problem
Muhammad Arzaki · 2019
In this paper we develop a one-time and a few-time digital signature schemes by modifying the process of the authenticated Megrelishvili key exchange. The security of our schemes is based on the hardness of the Megrelishvili Vector-Matrix Problem (MVMP). We prove the correctness of our schemes mathematically and argue that they are at least as secure as the authenticated Megrelishvili protocol. Moreover, we demonstrate that both signature creation and verification take polynomial amount of finite field operations. Our few-time signature scheme allows a restriction to the message owner so that he can only certify at most n messages whenever the vector space Fqnis used. We consider this feature valuable when we want to limit the number of messages that can be issued by the message owner.