Claim Missing Document
Check
Articles

Found 2 Documents
Search

A Security Enhancement to The Secure Mutual Authentication Protocol for Fog/Edge Farida, Yeni; Azzahra, Arsya Dyani; Lestari, Andriani Adi; Siswantyo, Sepha; Handayani, Annisa Dini; Priambodo, Dimas Febriyan
Jurnal Nasional Pendidikan Teknik Informatika: JANAPATI Vol. 14 No. 1 (2025)
Publisher : Prodi Pendidikan Teknik Informatika Universitas Pendidikan Ganesha

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.23887/janapati.v14i1.84725

Abstract

A secured mutual authentication protocol (SMAP Fog/Edge) has been developed for fog computing. The protocol provides secure mutual authentication which lightweight and efficient for fog computing environments. However, based on AVISPA’s verification from Azzahra research, this protocol has been found to be vulnerable to man-in-the-middle (MITM) attacks due to the absence of an authentication scheme between authentication server and the edge user. The attacks are carried out assuming that the public key of the fog server is not distributed over a secure channel. Rhim research and Lestari research successfully enhance the security level with digital signature. In line with that, we propose modified mechanism that utilizes encryption and digital signatures to substitute the secure channel for distributing the public key of the fog server and authenticating edge users by the authentication server. All modification is using authentication server for digital signature to enhance the security of SMAP Fog/Edge and make it resistant to man-in-the-middle attacks. The proposed protocol is revalidated using the AVISPA tool to determine whether the vulnerability still exists. The result indicates prototype successfully resistant to MITM
ON THE SECURITY OF GENERALIZED MULTILINEAR MAPS BASED ON WEIL PAIRING Handayani, Annisa Dini; Wijayanti, Indah Emilia; Isnaini, Uha; Fauzi, Prastudy
BAREKENG: Jurnal Ilmu Matematika dan Terapan Vol 19 No 2 (2025): BAREKENG: Journal of Mathematics and Its Application
Publisher : PATTIMURA UNIVERSITY

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30598/barekengvol19iss2pp1307-1316

Abstract

In 2017, Tran et al. proposed a multilinear map based on Weil pairings to realize the Boneh-Silverberg scheme. They proposed an algorithm to evaluate the Boneh-Silverberg multilinear map and showed that it could be used to establish a shared key in multipartite key exchange for five users. They claimed their scheme was secure and computable in establishing a shared key between 5 users. Unfortunately, they did not prove that their scheme meets three additional computational assumptions proposed by Boneh and Silverberg. In this paper, with some computational modifications, we show that the algorithm proposed by Tran et al. does not satisfy three security assumptions proposed by Boneh and Silverberg. Therefore, every user involved in this multipartite key exchange can obtain the shared key and other users' secret values. We also show that the computation to obtain a shared key is inefficient because it requires a lot of computation and time.