{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:58:18Z","timestamp":1774630698440,"version":"3.50.1"},"reference-count":19,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Proxima Labs"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>Addressing the critical challenge of ensuring data integrity in decentralized systems, this paper delves into the underexplored area of data falsification probabilities within Merkle Trees, which are pivotal in blockchain and Internet of Things (IoT) technologies. Despite their widespread use, a comprehensive understanding of the probabilistic aspects of data security in these structures remains a gap in current research. Our study aims to bridge this gap by developing a theoretical framework to calculate the probability of data falsification, taking into account various scenarios based on the length of the Merkle path and hash length. The research progresses from the derivation of an exact formula for falsification probability to an approximation suitable for cases with significantly large hash lengths. Empirical experiments validate the theoretical models, exploring simulations with diverse hash lengths and Merkle path lengths. The findings reveal a decrease in falsification probability with increasing hash length and an inverse relationship with longer Merkle paths. A numerical analysis quantifies the discrepancy between exact and approximate probabilities, underscoring the conditions for the effective application of the approximation. This work offers crucial insights into optimizing Merkle Tree structures for bolstering security in blockchain and IoT systems, achieving a balance between computational efficiency and data integrity.<\/jats:p>","DOI":"10.3390\/cryptography8030033","type":"journal-article","created":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T15:26:53Z","timestamp":1722526013000},"page":"33","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Evaluating the Security of Merkle Trees: An Analysis of Data Falsification Probabilities"],"prefix":"10.3390","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2331-6326","authenticated-orcid":false,"given":"Oleksandr","family":"Kuznetsov","sequence":"first","affiliation":[{"name":"Proxima Labs, 1501 Larkin Street, Suite 300, San Francisco, CA 94102, USA"},{"name":"Department of Political Sciences, Communication and International Relations, University of Macerata, Via Crescimbeni, 30\/32, 62100 Macerata, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1586-8003","authenticated-orcid":false,"given":"Alex","family":"Rusnak","sequence":"additional","affiliation":[{"name":"Proxima Labs, 1501 Larkin Street, Suite 300, San Francisco, CA 94102, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-6380-5233","authenticated-orcid":false,"given":"Anton","family":"Yezhov","sequence":"additional","affiliation":[{"name":"Proxima Labs, 1501 Larkin Street, Suite 300, San Francisco, CA 94102, USA"}]},{"given":"Kateryna","family":"Kuznetsova","sequence":"additional","affiliation":[{"name":"Proxima Labs, 1501 Larkin Street, Suite 300, San Francisco, CA 94102, USA"}]},{"given":"Dzianis","family":"Kanonik","sequence":"additional","affiliation":[{"name":"Proxima Labs, 1501 Larkin Street, Suite 300, San Francisco, CA 94102, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1591-137X","authenticated-orcid":false,"given":"Oleksandr","family":"Domin","sequence":"additional","affiliation":[{"name":"Proxima Labs, 1501 Larkin Street, Suite 300, San Francisco, CA 94102, USA"}]}],"member":"1968","published-online":{"date-parts":[[2024,8,1]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"101037","DOI":"10.1016\/j.iot.2023.101037","article-title":"A Survey on Security and Cryptographic Perspective of Industrial-Internet-of-Things","volume":"25","author":"Mishra","year":"2024","journal-title":"Internet Things"},{"key":"ref_2","first-page":"102952","article-title":"An Improved Convolution Merkle Tree-Based Blockchain Electronic Medical Record Secure Storage Scheme","volume":"61","author":"Zhu","year":"2021","journal-title":"J. Inf. Secur. Appl."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"107903","DOI":"10.1016\/j.cie.2021.107903","article-title":"Data Security Storage Mechanism Based on Blockchain Industrial Internet of Things","volume":"164","author":"Wang","year":"2022","journal-title":"Comput. Ind. Eng."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"108847","DOI":"10.1016\/j.compeleceng.2023.108847","article-title":"Industrial Internet of Things Enabled Technologies, Challenges, and Future Directions","volume":"110","author":"Ahmed","year":"2023","journal-title":"Comput. Electr. Eng."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"(2023). Nisha; Urvashi A Systematic Literature Review of Internet of Video Things: Trends, Techniques, Datasets, and Framework. Internet Things, 24, 100906.","DOI":"10.1016\/j.iot.2023.100906"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Dodis, Y., and Shrimpton, T. (2022, January 15\u201318). Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions. Proceedings of the Advances in Cryptology\u2014CRYPTO 2022, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-031-15802-5"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Dodis, Y., and Shrimpton, T. (2022, January 15\u201318). On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damg\u00e5rd Hashing. Proceedings of the Advances in Cryptology\u2014CRYPTO 2022, Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-031-15802-5"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"101585","DOI":"10.1016\/j.cose.2019.101585","article-title":"Breaking the Binding: Attacks on the Merkle Approach to Prove Liabilities and Its Applications","volume":"87","author":"Hu","year":"2019","journal-title":"Comput. Secur."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"109543","DOI":"10.1016\/j.knosys.2022.109543","article-title":"Signature Based Merkle Hash Multiplication Algorithm to Secure the Communication in IoT Devices","volume":"253","author":"Kumari","year":"2022","journal-title":"Knowl. Based Syst."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Mitra, D., Tauz, L., and Dolecek, L. (July, January 26). Polar Coded Merkle Tree: Improved Detection of Data Availability Attacks in Blockchain Systems. Proceedings of the 2022 IEEE International Symposium on Information Theory (ISIT), Espoo, Finland.","DOI":"10.1109\/ISIT50566.2022.9834538"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1109\/JSAIT.2023.3315148","article-title":"Graph Coded Merkle Tree: Mitigating Data Availability Attacks in Blockchain Systems Using Informed Design of Polar Factor Graphs","volume":"4","author":"Mitra","year":"2023","journal-title":"IEEE J. Sel. Areas Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1109\/TSC.2017.2708116","article-title":"Dynamic Outsourced Auditing Services for Cloud Storage Based on Batch-Leaves-Authenticated Merkle Hash Tree","volume":"13","author":"Rao","year":"2020","journal-title":"IEEE Trans. Serv. Comput."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1016\/j.dam.2008.03.038","article-title":"Domain Extender for Collision Resistant Hash Functions: Improving upon Merkle\u2013Damg\u00e5rd Iteration","volume":"157","author":"Sarkar","year":"2009","journal-title":"Discret. Appl. Math."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.jnca.2018.01.014","article-title":"Dynamic Fully Homomorphic Encryption-Based Merkle Tree for Lightweight Streaming Authenticated Data Structures","volume":"107","author":"Xu","year":"2018","journal-title":"J. Netw. Comput. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"15443","DOI":"10.1109\/JIOT.2023.3264019","article-title":"MQTT-A: A Broker-Bridging P2P Architecture to Achieve Anonymity in MQTT","volume":"10","author":"Buccafurri","year":"2023","journal-title":"IEEE Internet Things J."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Buccafurri, F., De Angelis, V., and Lazzaro, S. (2024). MQTT-I: Achieving End-to-End Data Flow Integrity in MQTT. IEEE Trans. Dependable Secur. Comput., 1\u201318.","DOI":"10.1109\/TDSC.2024.3358630"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"100780","DOI":"10.1016\/j.iot.2023.100780","article-title":"Internet of Things (IoT) Security Dataset Evolution: Challenges and Future Directions","volume":"22","author":"Kaur","year":"2023","journal-title":"Internet Things"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"127017","DOI":"10.1016\/j.neucom.2023.127017","article-title":"A Review of IoT Applications in Healthcare","volume":"565","author":"Li","year":"2024","journal-title":"Neurocomputing"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Kuznetsov, O., Rusnak, A., Yezhov, A., Kuznetsova, K., Kanonik, D., and Domin, O. (2024). Merkle Trees in Blockchain: A Study of Collision Probability and Security Implications. Internet Things, 101193.","DOI":"10.1016\/j.iot.2024.101193"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/8\/3\/33\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:28:31Z","timestamp":1760110111000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/8\/3\/33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,1]]},"references-count":19,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["cryptography8030033"],"URL":"https:\/\/doi.org\/10.3390\/cryptography8030033","relation":{},"ISSN":["2410-387X"],"issn-type":[{"value":"2410-387X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,1]]}}}