Article Per Year (5 Year)
p-Index From 2021 - 2026
1.756
P-Index
This Author published in this journals
All Journal Jurnal Ilmu Komputer dan Informasi Journal of ICT Research and Applications Indonesian Journal on Computing (Indo-JC) JOIN (Jurnal Online Informatika) Info Kripto eProceedings of Engineering Review: Journal of Multidisciplinary in Social Sciences
Ari Moesriami Barmawi
Telkom University
Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Engineering Industrial & Manufacturing Engineering Library & Information Science Mathematics Social Sciences

Published : 16 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : JOIN (Jurnal Online Informatika)

 1 
Strengthening the Authentication Mechanism of Blockchain-Based E-Voting System Using Post-Quantum Cryptography Laia, Sonitema; Barmawi, Ari Moesriami
JOIN (Jurnal Online Informatika) Vol 9 No 2 (2024)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v9i2.1305

Abstract

Election systems often face severe challenges regarding security and trust. Threats such as vote falsification and lack of transparency in vote counting have shaken the integrity of elections in various countries. The use of blockchain technology in e-voting has been proposed as an attractive solution to overcome this problem. Several studies use blockchain for the security of electronic voting systems. The existing methods are not resistant against impersonation attacks and man-in-the-middle attacks. This research proposes a new scheme to strengthen a blockchain-based e-voting system. The blockchain used in the proposed method is Ethereum. The proposed scheme uses the modified framework and The Goldreich-Goldwasser-Halevi (GGH) signature scheme. Digital signatures generated using Goldreich-Goldwasser-Halevi (GGH) can strengthen the identity of the message sender so that enemies cannot imitate someone. In this research, the Voter's public key and anonymous ID are used by the Voter to maintain the Voter's anonymity. Based on the experimental results, it can be concluded that the proposed scheme is stronger than the previous scheme because the probability of success in impersonating the sender with the proposed scheme using an impersonation attack and man-in-the-middle attack is small.
Modified Hash to Obtain Random Subset-Tree (MHORST) Using Merkle Tree and Mersenne Twister Ahmad, Faidhil Nugrah Ramadhan; Barmawi, Ari Moesriami
JOIN (Jurnal Online Informatika) Vol 10 No 2 (2025)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v10i2.1471

Abstract

The development of quantum computing triggers new challenges in data security, particularly in addressing attacks that can solve complex mathematical problems on the fly. Several hash-based data security methods have been proposed to deal with this threat, one of them being Hash to Obtain Random Subset-Tree (HORST). However, HORST has drawbacks, such as low security, because it only uses one hash round. The security of HORST is already improved by Hash to Obtain Random Subset and Integer Composition (HORSIC). However, HORSIC’s execution time is significantly increased. The problem of this research is the low-security HORST and the high execution time of HORSIC. This research proposes a new method, Modified Hash to Obtain Random Subset-Tree (MHORST), which aims to improve the security of HORST and reduce the execution time to less than HORSI’s. MHORST uses Merkle tree, SHA-256 hashes, and Mersenne Twister to build public keys and digital signatures. Based on the experiment results, MHORST reduces the signing time by more than 3.3 times compared to HORST. MHORST reduces the verification time by more than 1.1 times HORST and 17 times HORSIC. Although the security level of MHORST decreases slightly compared to HORSIC, this method is still more secure than HORST against signature forgery.
Co-Authors Adiati, Nadia Paramita Retno Ahmad, Faidhil Nugrah Ramadhan Ali Muhammad Ariva Syam Mursalat Bhagaskoro, Dian Anggoro Putro David Martin Dian Anggoro Putro Bhagaskoro Hasmawati Hasmawati Laia, Sonitema Nugraha, Rakha Aditya Prasti Eko Yunanto Rakha Aditya Nugraha Savitri, Arildha Rahma Shofro, Puteri Awaliatush Soni Yora Widhian Bramantya