Muhammad Zeeshan Haider
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Muhammad Zeeshan Haider has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Ghyslain Gagnon
École de technologie supérieure, Montréal, Canada
2 shared publications - Hachem Bensalem
École de technologie supérieure, Canada
2 shared publications - Kaiwen Zhang
École de technologie supérieure, Montréal, Canada
2 shared publications - Tayyaba Noreen
École de technologie supérieure, Canada
2 shared publications - Fang Luo
Key Laboratory of Industrial Ecology and Environmental Engineering (MOE), School of Environmental Science and Technology, Dalian University of Technology, Dalian 116024, China
1 shared publication - Xu Yuan
School of Software Technology, Dalian University of Technology, Dalian 116024, China
1 shared publication
Latest Publications
- Open Access
- 31 March 2026
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
Randomness in Blockchain: A Comprehensive Survey of Pseudo-Random Number Generation (PRNG) and Quantum Random Number Generation (QRNG)
Blockchain technology has grown rapidly and gained extensive adoption across various sectors due to its transparency and security benefits. Randomness plays crucial role in blockchain systems by ensuring fairness, security, and unpredictability in decentralized systems. This survey comprehensively analyzes randomness generation methods, particularly Pseudo-Random Number Generators (PRNGs) and Quantum Random Number Generators (QRNGs), in blockchain systems. PRNGs, while efficient, are vulnerable to predictability issues, whereas QRNGs offer higher security but require specialized hardware and have higher costs. The paper examines state-of-the-art randomness generation techniques, highlighting their strengths, limitations, and implications for blockchain security and efficiency. A novel taxonomy is proposed, categorizing randomness approaches into on-chain and off-chain mechanisms using PRNGs and QRNGs. By providing an in-depth exploration of existing methods and advancements, this survey enables readers to evaluate trade-offs and identify the most suitable approaches for specific blockchain applications. The survey also addresses gaps in current research and proposes future directions for secure and efficient randomness generation in decentralized systems. To the best of our knowledge, this paper is the first survey that analyses randomness techniques in blockchain using PRNG and QRNG.
- 31 March 2026
- Published by Association for Computing Machinery (ACM) in Distributed Ledger Technologies: Research and Practice
Open AccessRandomness in Blockchain: A Comprehensive Survey of Pseudo-Random Number Generation (PRNG) and Quantum Random Number Generation (QRNG)
Blockchain technology has grown rapidly and gained extensive adoption across various sectors due to its transparency and security benefits. Randomness plays crucial role in blockchain systems by ensuring fairness, security, and unpredictability in decentralized systems. This survey comprehensively analyzes randomness generation methods, particularly Pseudo-Random Number Generators (PRNGs) and Quantum Random Number Generators (QRNGs), in blockchain systems. PRNGs, while efficient, are vulnerable to predictability issues, whereas QRNGs offer higher security but require specialized hardware and have higher costs. The paper examines state-of-the-art randomness generation techniques, highlighting their strengths, limitations, and implications for blockchain security and efficiency. A novel taxonomy is proposed, categorizing randomness approaches into on-chain and off-chain mechanisms using PRNGs and QRNGs. By providing an in-depth exploration of existing methods and advancements, this survey enables readers to evaluate trade-offs and identify the most suitable approaches for specific blockchain applications. The survey also addresses gaps in current research and proposes future directions for secure and efficient randomness generation in decentralized systems. To the best of our knowledge, this paper is the first survey that analyses randomness techniques in blockchain using PRNG and QRNG.
- Open Access
- 23 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 475-484
Mitigating MEV with Verifiable Randomness: A VRF-Seeded Fair Transaction Ordering Protocol
- 23 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 475-484
Open AccessMitigating MEV with Verifiable Randomness: A VRF-Seeded Fair Transaction Ordering Protocol
- Open Access
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Efficient Byzantine Consensus Mechanism Based on Reputation in IoT Blockchain
Blockchain technology has advanced rapidly in recent years and is now widely used in a variety of fields. Blockchain appears to be one of the best solutions for managing massive heterogeneous devices while achieving advanced data security and data reputation, particularly in the field of large‐scale IoT (Internet of Things) networks. Despite the numerous advantages, there are still challenges while deploying IoT applications on blockchain systems due to the limited storage, power, and computing capability of IoT devices, and some of these problems are caused by the consensus algorithm, which plays a significant role in blockchain systems by ensuring overall system reliability and robustness. Nonetheless, most existing consensus algorithms are prone to poor node reliability, low transaction per second (TPS) rates, and scalability issues. Aiming at some critical problems in the existing consensus algorithms, this paper proposes the Efficient Byzantine Reputation‐based Consensus (EBRC) mechanism to resolve the issues raised above. In comparison to traditional algorithms, we reinvented ways to evaluate node reliability and robustness and manage active nodes. Our experiments show that the EBRC algorithm has lower consensus delay, higher throughput, improved security, and lower verification costs. It offers new reference ideas for solving the Internet of Things+blockchain+Internet court construction problem.
- 1 January 2021
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2021 (1)
Open AccessEfficient Byzantine Consensus Mechanism Based on Reputation in IoT Blockchain
Blockchain technology has advanced rapidly in recent years and is now widely used in a variety of fields. Blockchain appears to be one of the best solutions for managing massive heterogeneous devices while achieving advanced data security and data reputation, particularly in the field of large‐scale IoT (Internet of Things) networks. Despite the numerous advantages, there are still challenges while deploying IoT applications on blockchain systems due to the limited storage, power, and computing capability of IoT devices, and some of these problems are caused by the consensus algorithm, which plays a significant role in blockchain systems by ensuring overall system reliability and robustness. Nonetheless, most existing consensus algorithms are prone to poor node reliability, low transaction per second (TPS) rates, and scalability issues. Aiming at some critical problems in the existing consensus algorithms, this paper proposes the Efficient Byzantine Reputation‐based Consensus (EBRC) mechanism to resolve the issues raised above. In comparison to traditional algorithms, we reinvented ways to evaluate node reliability and robustness and manage active nodes. Our experiments show that the EBRC algorithm has lower consensus delay, higher throughput, improved security, and lower verification costs. It offers new reference ideas for solving the Internet of Things+blockchain+Internet court construction problem.