Cryptographic Signature Scheme for Mobile Edge Computing Using DLFP Over Semiring

Authors

Sethupathi S Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology, Vellore, India https://orcid.org/0009-0004-4757-472X
Manimaran A Department of Mathematics, School of Advanced Sciences, Vellore Institute of Technology, Vellore, India https://orcid.org/0000-0001-6717-1152

DOI:

https://doi.org/10.37256/cm.5220244061

Keywords:

semiring, centralizer, discrete logarithm problem, factor problem, undeniable signature, mobile edge computing

Abstract

The Undeniable Signature Scheme (USS) was first introduced by Chaum and Van in 1989. The advantage of the (USS) scheme is the signer’s co-operation during the verification process. In this paper, the Discrete Logarithm Problem with Factor Problem (DLFP) is introduced. It’s security and complexity is analyzed. Then, based on (DLFP), a key exchange protocol is given. An undeniable signature scheme based on DLFP over semiring is proposed, with an illustration. Additionally, the application of the proposed USS in Mobile Edge Computing (MEC) is provided. Then the proposed scheme’s security and complexity are examined.

Downloads

Published

2024-04-25

How to Cite

S S, A M. Cryptographic Signature Scheme for Mobile Edge Computing Using DLFP Over Semiring. Contemp. Math. [Internet]. 2024 Apr. 25 [cited 2026 Jan. 8];5(2):2353-75. Available from: https://ojs.wiserpub.com/index.php/CM/article/view/4061

Download Citation

Issue

Contemporary Mathematics, Volume 5 Issue 2 (2024), 1122-2592

Section

Research Article

License

This work is licensed under a Creative Commons Attribution 4.0 International License.