Ari Moesriami Barmawi
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ari Moesriami Barmawi has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
Agung Toto Wibowo
Informatics Department, Telkom University, Bandung, Indonesia
3 shared publicationsAdeva Oktoveri
Informatics Department, Telkom University, Bandung, Indonesia
2 shared publicationsAhmad Whafa Azka Al Azkiyai
Telkom University
1 shared publication- Ali Muhammad
Department of Computer Science, Air University, Pakistan
1 shared publication Anditya Arifianto
Informatics Department Telkom University Bandung, Indonesia
1 shared publication- Arildha Rahma Savitri
PoltekSSN
1 shared publication
Latest Publications
- Open Access
- 31 August 2025
- Published by Politeknik Siber dan Sandi Negara in Info Kripto
- Vol. 19 (2) , 109-122
Implementasi Digital Signature Algorithm (DSA) dengan SHA-512 pada Citra Digital Menggunakan Metode Reversible Image Steganography berbasis Pixel Value Ordering (PVO)
Distribusi data digital melalui media elektronik rentan terhadap berbagai ancaman keamanan. Untuk menjamin keamanan transmisi, kriptografi digunakan sebagai mekanisme proteksi, tanda tangan digital digunakan untuk memastikan integritas dan otentikasi, sementara steganografi mencegah nilai tanda tangan dikirim secara terpisah. Penelitian ini mengimplementasikan Digital Signature Algorithm (DSA) dengan SHA-512 pada citra digital menggunakan metode reversible image steganography berbasis Pixel Value Ordering (PVO). Keunikan penelitian ini terletak pada pemanfaatan algoritma Scale Invariant Feature Transform (SIFT) untuk mengekstraksi fitur citra sebelum proses hashing, sehingga tanda tangan digital yang dihasilkan lebih tahan terhadap variasi citra. Proses meliputi pembangkitan kunci DSA, ekstraksi fitur citra, hashing dengan SHA-512, penandatanganan digital, serta penyisipan tanda tangan ke dalam citra menggunakan PVO. Hasil penelitian menunjukkan bahwa DSA dan SHA-512 dapat diimplementasikan pada citra digital baik jenis Grayscale ataupun RGB tanpa batasan ukuran pixel serta menunjukkan nilai signature yang disembunyikan tidak menyebabkan perubahan apapun terhadap cover-image. Hasil evaluasi performa dan analisis uji ketahanan metode steganografi PVO pada penelitian ini menunjukkan hasil Detection Rate, BPP, MSE, dan PSNR yang cukup baik.
- 31 August 2025
- Published by Politeknik Siber dan Sandi Negara in Info Kripto
- Vol. 19 (2) , 109-122
Open AccessImplementasi Digital Signature Algorithm (DSA) dengan SHA-512 pada Citra Digital Menggunakan Metode Reversible Image Steganography berbasis Pixel Value Ordering (PVO)
Distribusi data digital melalui media elektronik rentan terhadap berbagai ancaman keamanan. Untuk menjamin keamanan transmisi, kriptografi digunakan sebagai mekanisme proteksi, tanda tangan digital digunakan untuk memastikan integritas dan otentikasi, sementara steganografi mencegah nilai tanda tangan dikirim secara terpisah. Penelitian ini mengimplementasikan Digital Signature Algorithm (DSA) dengan SHA-512 pada citra digital menggunakan metode reversible image steganography berbasis Pixel Value Ordering (PVO). Keunikan penelitian ini terletak pada pemanfaatan algoritma Scale Invariant Feature Transform (SIFT) untuk mengekstraksi fitur citra sebelum proses hashing, sehingga tanda tangan digital yang dihasilkan lebih tahan terhadap variasi citra. Proses meliputi pembangkitan kunci DSA, ekstraksi fitur citra, hashing dengan SHA-512, penandatanganan digital, serta penyisipan tanda tangan ke dalam citra menggunakan PVO. Hasil penelitian menunjukkan bahwa DSA dan SHA-512 dapat diimplementasikan pada citra digital baik jenis Grayscale ataupun RGB tanpa batasan ukuran pixel serta menunjukkan nilai signature yang disembunyikan tidak menyebabkan perubahan apapun terhadap cover-image. Hasil evaluasi performa dan analisis uji ketahanan metode steganografi PVO pada penelitian ini menunjukkan hasil Detection Rate, BPP, MSE, dan PSNR yang cukup baik.
- Open Access
- 17 August 2025
- Published by Sunan Gunung Djati State Islamic University of Bandung in Jurnal Online Informatika
- Vol. 10 (2) , 384-394
Modified Hash to Obtain Random Subset-Tree (MHORST) Using Merkle Tree and Mersenne Twister
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.
- 17 August 2025
- Published by Sunan Gunung Djati State Islamic University of Bandung in Jurnal Online Informatika
- Vol. 10 (2) , 384-394
Open AccessModified Hash to Obtain Random Subset-Tree (MHORST) Using Merkle Tree and Mersenne Twister
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.
- Open Access
- 9 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 24257-24280
Improving ANiTW Performance Using Bigrams Character Encoding and Identity-Based Signature
Several threats, such as misinformation and hoax, exist in social media as a frequently used technology to exchange information. These threats can be prevented if the reader can verify the message’s content integrity and source authenticity. One recent solution to overcome these threats was proposed by Ahvanooey et al. called ANiTW. ANiTW uses an invisible text watermarking scheme to verify social media message integrity and identify the message source. However, ANiTW is still vulnerable to undetected malicious text modification. Moreover, ANiTW has no tools to authenticate the extracted message source. The proposed method aims to overcome those vulnerabilities and improve ANiTW performance as a tool to verify message content integrity and message source authenticity in social media. To overcome vulnerabilities in ANITW, a part of the message hash and IBS-based signature is introduced as the watermark. The message integrity is verifiable by using part of the message hash as a watermark to detect any malicious. Moreover, implementing an IBS-based signature enables any reader to verify the message source’s authenticity easily. In addition, to improve ANITW performance in embedding capacity and invisibility, a novel bigram-based character encoding and embedding rule are also introduced. Based on the experiment and analysis result, it is proven that the proposed method can perform better than ANiTW in the security, embedding capacity, and invisibility aspects.
- 9 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 11, 24257-24280
Open AccessImproving ANiTW Performance Using Bigrams Character Encoding and Identity-Based Signature
Several threats, such as misinformation and hoax, exist in social media as a frequently used technology to exchange information. These threats can be prevented if the reader can verify the message’s content integrity and source authenticity. One recent solution to overcome these threats was proposed by Ahvanooey et al. called ANiTW. ANiTW uses an invisible text watermarking scheme to verify social media message integrity and identify the message source. However, ANiTW is still vulnerable to undetected malicious text modification. Moreover, ANiTW has no tools to authenticate the extracted message source. The proposed method aims to overcome those vulnerabilities and improve ANiTW performance as a tool to verify message content integrity and message source authenticity in social media. To overcome vulnerabilities in ANITW, a part of the message hash and IBS-based signature is introduced as the watermark. The message integrity is verifiable by using part of the message hash as a watermark to detect any malicious. Moreover, implementing an IBS-based signature enables any reader to verify the message source’s authenticity easily. In addition, to improve ANITW performance in embedding capacity and invisibility, a novel bigram-based character encoding and embedding rule are also introduced. Based on the experiment and analysis result, it is proven that the proposed method can perform better than ANiTW in the security, embedding capacity, and invisibility aspects.
- 2 March 2023
- Published by Springer Nature
- p. 521-540
Authentication Scheme Using Honey Sentences
- Open Access
- 1 December 2022
- Published by Association for Computing Machinery (ACM)
- p. 69-76
Activity Attribute-Based User Behavior Model for Continuous User Authentication
In general, authentication using a username and password has been used to manage access to the system. This way, it can be arranged so that only authorized people can access a system. However, it does not rule out the possibility of several spoofing attacks. User behavior can be used instead of a password to solve this problem. Given that user behavior is unique, the behavior can be used for the authentication process. One of the authentication processes is to continuously use weblogs, as proposed by Leslie et al. However, the method used by Leslie et al. still has a drawback with the Leslie method. Only the user's role is identified. So, the attacker's identity cannot be known if an attack occurs. A continuous authentication method using weblogs and user attributes such as user id, DateTime, event, category, and products is used to overcome this problem. Using this method, the user's identity can be identified immediately after the role is known. In addition, using the proposed method, the accuracy of user identity authentication obtained is, on average, 95.08%, which means it is greater than the accuracy of user role authentication using the Leslie method, which is 46%..
- 1 December 2022
- Published by Association for Computing Machinery (ACM)
- p. 69-76
Open AccessActivity Attribute-Based User Behavior Model for Continuous User Authentication
In general, authentication using a username and password has been used to manage access to the system. This way, it can be arranged so that only authorized people can access a system. However, it does not rule out the possibility of several spoofing attacks. User behavior can be used instead of a password to solve this problem. Given that user behavior is unique, the behavior can be used for the authentication process. One of the authentication processes is to continuously use weblogs, as proposed by Leslie et al. However, the method used by Leslie et al. still has a drawback with the Leslie method. Only the user's role is identified. So, the attacker's identity cannot be known if an attack occurs. A continuous authentication method using weblogs and user attributes such as user id, DateTime, event, category, and products is used to overcome this problem. Using this method, the user's identity can be identified immediately after the role is known. In addition, using the proposed method, the accuracy of user identity authentication obtained is, on average, 95.08%, which means it is greater than the accuracy of user role authentication using the Leslie method, which is 46%..
- Open Access
- 31 August 2022
- Published by The Institute for Research and Community Services (LPPM) ITB in Journal of ICT Research and Applications
- Vol. 16 (2) , 101-122
Strengthening INORMALS Using Context-based Natural Language Generation
The noiseless steganography method that has been proposed by Wibowo can embed up to six characters in the provided cover text, but more than 59% of Indonesian words have a length of more than six characters, so there is room to improve Wibowo?s method. This paper proposes an improvement of Wibowo?s method by modifying the shifting codes and using context-based language generation. Based on 300 test messages, 99% of messages with more than six characters could be embedded by the proposed method, while using Wibowo?s method this was only 34%. Wibowo?s method can embed more than six characters only if the number of shifting codes is less than three, while the proposed method can embed more than six characters even if there are more than three shifting codes. Furthermore, the security for representing the number of code digits is increased by introducing a private key with the probability of guessing less than 1, while in Wibowo?s method this is 1. The naturalness of the cover sentences generated by the proposed method was maintained, which was about 99% when using the proposed method, while it was 98.61% when using Wibowo?s method.
- 31 August 2022
- Published by The Institute for Research and Community Services (LPPM) ITB in Journal of ICT Research and Applications
- Vol. 16 (2) , 101-122
Open AccessStrengthening INORMALS Using Context-based Natural Language Generation
The noiseless steganography method that has been proposed by Wibowo can embed up to six characters in the provided cover text, but more than 59% of Indonesian words have a length of more than six characters, so there is room to improve Wibowo?s method. This paper proposes an improvement of Wibowo?s method by modifying the shifting codes and using context-based language generation. Based on 300 test messages, 99% of messages with more than six characters could be embedded by the proposed method, while using Wibowo?s method this was only 34%. Wibowo?s method can embed more than six characters only if the number of shifting codes is less than three, while the proposed method can embed more than six characters even if there are more than three shifting codes. Furthermore, the security for representing the number of code digits is increased by introducing a private key with the probability of guessing less than 1, while in Wibowo?s method this is 1. The naturalness of the cover sentences generated by the proposed method was maintained, which was about 99% when using the proposed method, while it was 98.61% when using Wibowo?s method.
- Open Access
- 2 July 2022
- Published by Faculty of Computer Science, Universitas Indonesia in Jurnal Ilmu Komputer dan Informasi
- Vol. 15 (2) , 81-91
Bimodal Keystroke Dynamics-Based Authentication for Mobile Application Using Anagram
Currently, most of the smartphones recognize uses based on static biometrics, such as face and fingerprint. However, those traits were vulnerable against spoofing attack. For overcoming this problem, dynamic biometrics like the keystroke and gaze are introduced since it is more resistant against spoofing attack. This research focuses on keystroke dynamics for strengthening the user recognition system against spoofing attacks. For recognizing a user, the user keystrokes feature used in the login process is compared with keystroke features stored in the keystroke features database. For evaluating the accuracy of the proposed system, words generated based on the Indonesian anagram are used. Furthermore, for conducting the experiment, 34 participants were asked to type a set of words using the smartphone keyboard. Then, each user’s keystroke is recorded. The keystroke dynamic feature consists of latency and digraph which are extracted from the record. According to the experiment result, the error of the proposed method is decreased by 23.075% of EER with FAR and FRR are decreased by 16.381% and 10.41% respectively, compared with Kim’s method. It means that the proposed method is successful increase the biometrics performance by reducing the error rates
- 2 July 2022
- Published by Faculty of Computer Science, Universitas Indonesia in Jurnal Ilmu Komputer dan Informasi
- Vol. 15 (2) , 81-91
Open AccessBimodal Keystroke Dynamics-Based Authentication for Mobile Application Using Anagram
Currently, most of the smartphones recognize uses based on static biometrics, such as face and fingerprint. However, those traits were vulnerable against spoofing attack. For overcoming this problem, dynamic biometrics like the keystroke and gaze are introduced since it is more resistant against spoofing attack. This research focuses on keystroke dynamics for strengthening the user recognition system against spoofing attacks. For recognizing a user, the user keystrokes feature used in the login process is compared with keystroke features stored in the keystroke features database. For evaluating the accuracy of the proposed system, words generated based on the Indonesian anagram are used. Furthermore, for conducting the experiment, 34 participants were asked to type a set of words using the smartphone keyboard. Then, each user’s keystroke is recorded. The keystroke dynamic feature consists of latency and digraph which are extracted from the record. According to the experiment result, the error of the proposed method is decreased by 23.075% of EER with FAR and FRR are decreased by 16.381% and 10.41% respectively, compared with Kim’s method. It means that the proposed method is successful increase the biometrics performance by reducing the error rates
- 6 July 2021
- Published by Springer Nature
- p. 851-867
Improving the Imperceptibility of Pixel Value Difference and LSB Substitution Based Steganography Using Modulo Encoding
- 6 July 2021
- Published by Springer Nature
- p. 851-867
Improving the Imperceptibility of Pixel Value Difference and LSB Substitution Based Steganography Using Modulo Encoding
- Open Access
- 31 December 2019
- Published by The Institute for Research and Community Services (LPPM) ITB in Journal of ICT Research and Applications
- Vol. 13 (3) , 257-282
Paraphrasing Method Based on Contextual Synonym Substitution
Paraphrasing Method Based on Contextual Synonym Substitution
- 31 December 2019
- Published by The Institute for Research and Community Services (LPPM) ITB in Journal of ICT Research and Applications
- Vol. 13 (3) , 257-282
Open AccessParaphrasing Method Based on Contextual Synonym Substitution
Paraphrasing Method Based on Contextual Synonym Substitution
- Open Access
- 30 April 2018
- Published by The Institute for Research and Community Services (LPPM) ITB in Journal of ICT Research and Applications
- Vol. 12 (1) , 87-102
Overcoming Alignment Problem in Non-Identical Mathematical Support Visual Cryptography Schemes
An important problem in visual cryptography is the alignment problem. Although Liu, et al. have proposed a method for aligning the shares, there is still a problem with the non-identical mathematical support visual cryptography schemes. For overcoming this problem, the Three-Orthogonal-Point (3OP) method is proposed in this paper. Based on the experimental result it was proven that it can overcome the alignment problem, while the time complexity for aligning the shares is decreased significantly from O((m×A)2) to O(m×AI), for AI < A. The security is maintained, since an attacker cannot obtain any information related to the secret image.
- 30 April 2018
- Published by The Institute for Research and Community Services (LPPM) ITB in Journal of ICT Research and Applications
- Vol. 12 (1) , 87-102
Open AccessOvercoming Alignment Problem in Non-Identical Mathematical Support Visual Cryptography Schemes
An important problem in visual cryptography is the alignment problem. Although Liu, et al. have proposed a method for aligning the shares, there is still a problem with the non-identical mathematical support visual cryptography schemes. For overcoming this problem, the Three-Orthogonal-Point (3OP) method is proposed in this paper. Based on the experimental result it was proven that it can overcome the alignment problem, while the time complexity for aligning the shares is decreased significantly from O((m×A)2) to O(m×AI), for AI < A. The security is maintained, since an attacker cannot obtain any information related to the secret image.