Penerapan SHA-256 untuk Analisis Pencegahan Double Spending Pada Cryptocurrency Bitcoin
DOI:
https://doi.org/10.32493/joaiia.v7i3.62982Keywords:
SHA-256, Double Spending, Bitcoin, Proof-of-work, BlockchainAbstract
Penelitian ini bertujuan menganalisis efektivitas algoritma Secure Hash Algorithm 256-bit (SHA-256) dalam mencegah serangan double spending pada proses mining Bitcoin. Penelitian ini menggunakan pendekatan kualitatif deskriptif yang mengombinasikan studi literatur dari dokumen teknis dengan pengujian simulasi terisolasi berbasis bahasa pemrograman Python. Simulasi tersebut dirancang secara spesifik untuk mengevaluasi parameter pembentukan hash, perhitungan persentase avalanche effect saat terjadi manipulasi data, pembentukan rantai blok, pencarian nonce pada proof-of-work, serta skenario validasi Unspent Transaction Output (UTXO). Hasil pengujian menunjukkan bahwa SHA-256 secara mutlak menjamin integritas blok dan mendeteksi manipulasi secara instan, yang ditunjukkan oleh penyebaran perubahan bit yang merata. Meskipun demikian, fungsi algoritma ini terbukti tidak secara langsung bertindak menolak transaksi ganda yang memakai input identik. Kesimpulannya, SHA-256 merupakan fondasi kriptografis esensial untuk mempertahankan struktur antarblok dan komputasi jaringan, sedangkan efektivitas penolakan double spending secara utuh mutlak membutuhkan integrasi berlapis antara fungsi hash, pemeriksaan status ketersediaan UTXO, dan protokol konsensus.
References
[1] S. Han, “Revolutionizing finance with bitcoin and blockchain : a literature review and research agenda,” vol. 26, no. 4, pp. 413–430, 2026, doi: 10.1108/CAFR-04-2023-0044.
[2] C. Yu, W. Yang, F. Xie, and J. He, “Technology and Security Analysis of Cryptocurrency Based on Blockchain,” vol. 2022, 2022, doi: 10.1155/2022/5835457.
[3] N. A. Akbar, A. Muneer, N. Elhakim, and S. M. Fati, “Distributed Hybrid Double-Spending Attack Prevention Mechanism for Proof-of-Work and Proof-of-Stake Blockchain Consensuses,” 2021.
[4] D. Melo, S. E. Pomares-hernández, L. M. Rodríguez-henríquez, and J. C. Pérez-sansalvador, “DiFastBit : Transaction Differentiation Scheme to Avoid Double-Spending for Fast Bitcoin Payments,” pp. 1–33, 2024.
[5] A. F. Elessawy, I. Gad, H. Abdul-kader, and A. Elsaid, “Double Spending Attacks in Decentralized Digital Currencies : Challenges and Countermeasures,” vol. 10, 2023.
[6] H. Hashim, A. R. Alzighaibi, A. F. Elessawy, I. Gad, H. Abdul-kader, and A. Elsaid, “Securing Financial Transactions with a Robust Algorithm : Preventing Double-Spending Attacks,” pp. 1–17, 2023.
[7] A. G. Gad, D. T. Mosa, L. Abualigah, and A. A. Abohany, “Emerging Trends in Blockchain Technology and Applications : A Review and Outlook,” J. King Saud Univ. - Comput. Inf. Sci., vol. 34, no. 9, pp. 6719–6742, 2022, doi: 10.1016/j.jksuci.2022.03.007.
[8] R. K. Salih and A. H. Kashmar, “Enhancing Blockchain Security by Developing the SHA256 Algorithm SHA256 ةيمزراوخ ريوطت للاخ نم لتكلا ةلسلس ن ا مأ زيزعت,” vol. 65, no. 10, pp. 5678–5693, 2024, doi: 10.24996/ijs.2024.65.10.30.
[9] C. E. B. Santos, L. M. D. Silva, M. F. Torquato, S. N. Silva, and M. A. C. Fernandes, “SHA-256 Hardware Proposal for IoT Devices in the Blockchain Context,” pp. 1–25, 2024.
[10] P. K. Yien, K. Malik, and S. N. Ramli, “Comparative Study on Hash Function Algorithms for Blockchain Technology,” vol. 5, no. 1, pp. 16–33, 2024.
[11] S. Shahrizoda, “INTERNATIONAL JOURNAL OF ARTIFICIAL INTELLIGENCE,” vol. 05, no. 03, pp. 1660–1664, 2025.
[12] J. Stinner and M. Tyrell, “Proof-of-work Consensus Under Exogenous Distress : Evidence from Bitcoin Mining Shocks ∗,” pp. 1–53, 2025.
[13] D. Bazzanella and A. Gangemi, “Bitcoin : a new proof ‑ of ‑ work system with reduced variance,” Financ. Innov., 2023, doi: 10.1186/s40854-023-00505-2.
[14] O. Kuznetsov, A. Yezhov, V. Yusiuk, and K. Kuznetsova, “Scalable Zero-Knowledge Proofs for Verifying Cryptographic Hashing in Blockchain Applications,” vol. 6326, pp. 0–3, 2024.
[15] J. Ye, “Analyzing Blockchain Consensus Mechanisms for Double-Spending Attack Prevention,” no. Daml 2024, pp. 432–437, 2025, doi: 10.5220/0013525500004619.
