Md. Mainul Islam

dblp:200/0820 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
4since 2021 · last 2026
0000-0002-9686-5994ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 3 · 3 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Lightweight Defense Against Data Consistency Attacks in Distributed DC Optimal Power Flow
Md. Mainul Islam, Muhammad Ismail 0001, Hasan Kurban, Xiang Huo, Erchin Serpedin
IEEE Trans Autom. Sci. Eng.1
2025 Proof of Random Leader: A Fast and Manipulation-Resistant Proof-of-Authority Consensus Algorithm for Permissioned Blockchains Using Verifiable Random Function
abstract
Proof of Authority (PoA) is a widely adopted consensus algorithm for permissioned blockchain networks, where a group of trusted entities governs the network. PoA is known for achieving rapid consensus with minimal computational and energy requirements. However, existing PoA variants such as Aura and Clique suffer from low transaction throughput in high workload conditions and provide limited randomness in leader selection. They are also vulnerable to time and order manipulation attacks. To overcome these limitations, this paper introduces a novel PoA-based consensus algorithm called Proof of Random Leader (PoRL), which utilizes a verifiable random function to enhance transaction throughput, improve scalability, and ensure fair and unpredictable leader selection. The proposed PoRL algorithm was implemented in Python and evaluated using a network of six consensus nodes with varying computational capabilities. The performance of PoRL was assessed based on key metrics, including security, consistency, availability, fault tolerance, block time, and transaction throughput. Experimental results indicate that PoRL achieves lower consensus times and higher transaction throughput compared to Aura and Clique, making it a more efficient solution for permissioned blockchain networks. The findings of this study provide valuable insights for blockchain practitioners in selecting the most suitable PoA implementation based on their specific network requirements.
Md. Mainul Islam, Mpyana Mwamba Merlec, Hoh Peter In
IEEE Trans. Serv. Comput.1
2023 A Privacy-Preserving Transparent Central Bank Digital Currency System Based on Consortium Blockchain and Unspent Transaction Outputs
abstract
There is rising global demand for the deployment of a central bank digital currency (CBDC) system to achieve financial stability. However, striking a balance between privacy, transparency, and auditability in such a system is technically difficult. We propose a CBDC system based on a consortium blockchain that adopts a privacy-preserving, transparent unspent transaction output (UTXO) model. The proposed system satisfies the travel rule of payment, unlike existing cryptocurrencies. Unlike the conventional UTXO approach, users use wallet-linked addresses for transactions rather than their actual wallet addresses. Each transacting address is generated using two keys: a random private key computed by the sender and the recipient's public key. The final private key is known only to the recipient, and it is required to spend the UTXO received using the address. Thus, each user holds only a single authorized public key and address, which eases regulatory compliance in the network without compromising anonymity and privacy. To manage the blockchain, the central bank and several certificate authorities execute the energy-efficient Clique consensus algorithm. Only the central bank supplies money to the network. A prototype of the system was implemented using Python-Flask, and it outperformed the state-of-the-art systems by providing a smaller transaction size (665 B) and lower verification time (9 ms).
Md. Mainul Islam, Hoh Peter In
IEEE Trans. Serv. Comput.1
2023 A Low-Cost Cross-Border Payment System Based on Auditable Cryptocurrency With Consortium Blockchain: Joint Digital Currency
abstract
Due to the involvement of a large number of intermediaries across different time zones in the correspondent banking process, existing interbank payment systems cannot provide cost-effective cross-border transactions. They also suffer from lack of transparency and long transaction delays. These issues can be solved by designing a cryptocurrency in an auditable manner using a permissioned blockchain where a group of authorities can govern the network. In this paper, we propose a low-cost, seamless cross-border payment system based on an auditable cryptocurrency that enables unspent transaction output-based transactions in a consortium blockchain network. To manage the blockchain, participating countries execute the energy-efficient proof of authority consensus algorithm with equal rights. Unlike conventional cryptocurrencies, dynamic decentralized identifiers (DIDs) are used as transacting addresses so that self-manageable authentication can be performed on-chain without any interaction with a trusted third party. The identity of transacting parties is known to respective DID issuers only. This approach enables peer-to-peer transactions while protecting user privacy and ensuring transparency without jeopardizing auditability. For user convenience, multi-party computation and multi-signature protocols are also provided. The system was implemented in Python, and the transaction mechanism was tested. This paper can help with ongoing research on blockchain-based cross-border payment solutions worldwide.
Md. Mainul Islam, Md. Shahjalal, Mostafa Zaman Chowdhury, Yeong Min Jang
IEEE Trans. Serv. Comput.1
2017 A binary variant of lightning search algorithm: BLSA
Md. Mainul Islam, Hussain Shareef, Azah Mohamed, Addy Wahyudie
Soft Comput.1