Assisting network contrivances with public key signatures
William Asiedu, K. O. Boateng · 2012
One of the main challenges of Securing effective computation in network devices tends to be a limitation of their computation power. They all tend to have a feature in common: limited computational capabilities and equally limited power (as most operate on batteries). Server assisted signature (SAS) scheme was recently presented as non-repudiation service for mobile and constrained devices. The scheme however made use of traditional protocols such as those based on RSA. Such protocols are computationally intensive and time consuming. In this paper we propose a scheme that is based on a modification of the RSA algorithm, ne modified algorithm has less complexity than the traditional RSA. Additionally, the proposed scheme shares the computational load between the mobile device and a server we call security mediator (SEM). Thus the mobile device effectively plays a part in the generation of public key signatures. The scheme has been evaluated against the standard RSA-based scheme and we present a result that shows that the proposed scheme leads to much faster operation.