{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T00:41:38Z","timestamp":1759970498662,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:00:00Z","timestamp":1737590400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Blockchain technology, characterized by its immutability and decentralization, enables the creation of permanent and tamper-resistant records once data are uploaded, making it widely applicable in scenarios requiring data authenticity and reliability. However, the immutability of on-chain data poses significant security risks, as erroneous or illegal data become difficult to correct or remove once recorded. Editable blockchain technology offers a potential solution for on-chain data modification. Nevertheless, existing approaches face several challenges, including the impact of malicious nodes on the security and efficiency of data modification, excessive centralization in the management of modification rights and trapdoor keys, and cumulative issues in reputation-based traditional node grouping methods. To address these challenges, this study proposes an RE-TNG (Reputation Evaluation-Twice Node Grouping) node selection method and an editable blockchain scheme based on it. The RE-TNG method employs a two-stage grouping process following reputation-based node ranking. The first grouping stage uses a Fibonacci sequence-based rule to mitigate the issue of cumulative reputation values over time. The second grouping stage selects high-reputation nodes within groups to ensure the trustworthiness of selected nodes. Trapdoor keys are collaboratively generated by the high-reputation node group, achieving decentralized trapdoor management. Modification nodes are randomly chosen from the high-reputation group, ensuring both integrity and decentralization in modification authority. Comparative analyses and experimental evaluations against traditional random node selection and grouping methods demonstrate the feasibility of the proposed scheme, showcasing a superior performance in terms of security and modification efficiency.<\/jats:p>","DOI":"10.3390\/info16020083","type":"journal-article","created":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T05:49:54Z","timestamp":1737611394000},"page":"83","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Modifiable Blockchain Based on the RE-TNG Node Selection Method"],"prefix":"10.3390","volume":"16","author":[{"given":"Rongtao","family":"Chen","sequence":"first","affiliation":[{"name":"Faculty of Information, Shanghai Ocean University, Shanghai 201306, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Li","sequence":"additional","affiliation":[{"name":"Shanghai Development Center of Computer Software Technology, Shanghai 201112, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bingrong","family":"Dai","sequence":"additional","affiliation":[{"name":"Shanghai Development Center of Computer Software Technology, Shanghai 201112, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9289-3827","authenticated-orcid":false,"given":"Shaohua","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shanghai Business School, Shanghai 200235, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,1,23]]},"reference":[{"key":"ref_1","first-page":"481","article-title":"Blockchain: The state of the art and future trends","volume":"42","author":"Yuan","year":"2016","journal-title":"Acta Autom. Sin."},{"key":"ref_2","first-page":"66","article-title":"A review of key technologies and existing problems in blockchain research","volume":"58","author":"Liu","year":"2022","journal-title":"Comput. Eng. Appl."},{"key":"ref_3","first-page":"84","article-title":"The principles and core technologies of blockchain","volume":"44","author":"Cai","year":"2021","journal-title":"Chin. J. Comput."},{"key":"ref_4","first-page":"3551","article-title":"Research on improvement of DPoS blockchain consensus mechanism","volume":"38","author":"He","year":"2021","journal-title":"Appl. Res. Comput."},{"key":"ref_5","first-page":"831","article-title":"Editable blockchain: Models, techniques and methods","volume":"46","author":"Yuan","year":"2020","journal-title":"Acta Autom. Sin."},{"key":"ref_6","unstructured":"Krawczyk, H., and Rabin, T. (2023, October 05). Chameleon Hashing and Signatures. Cryptology ePrint Archive. Available online: http:\/\/eprint.iacr.org\/1998\/010."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Magri, B., Venturi, D., and Andrade, E. (2017, January 26\u201328). Redactable blockchain-or-rewriting history in bitcoin and friends. Proceedings of the 2017 IEEE European Symposium on Security and Privacy, Paris, France.","DOI":"10.1109\/EuroSP.2017.37"},{"key":"ref_8","first-page":"501","article-title":"Research on fault-correcting blockchain technology","volume":"5","author":"Li","year":"2018","journal-title":"J. Cryptologic Res."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Ashritha, K., Sindhu, M., and Lakhmy, K.V. (2019, January 15\u201316). Redactable blockchain using enhanced chameleon hash function. Proceedings of the International Conference on Advanced Computing and Communication Systems, Coimbatore, India.","DOI":"10.1109\/ICACCS.2019.8728524"},{"key":"ref_10","first-page":"2016","article-title":"Research on verifiable blockchain ledger redaction method for trusted consortium","volume":"44","author":"Lyu","year":"2021","journal-title":"Chin. J. Comput."},{"key":"ref_11","first-page":"2310","article-title":"One-time chameleon hash function and its application in redactable blockchain","volume":"58","author":"Gao","year":"2021","journal-title":"J. Comput. Res. Dev."},{"key":"ref_12","first-page":"2266","article-title":"Blockchain ledger revision scheme based on supervisor group","volume":"40","author":"Gu","year":"2023","journal-title":"Appl. Res. Comput."},{"key":"ref_13","first-page":"438","article-title":"Quantum resistant key-exposure free chameleon hash and applications in redactable blockchain","volume":"548","author":"Chun","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.ins.2019.09.001","article-title":"Efficient chameleon hash functions in the enhanced collision resistant model","volume":"510","author":"Khalili","year":"2020","journal-title":"Inf. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir","year":"1979","journal-title":"Commun. ACM"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., and Awerbuch, B. (1985, January 21\u201323). Verifiable secret sharing and achieving simultaneity in the presence of faults. Proceedings of the 26th Annual Symposium on Foundations of Computer Science, Portland, OR, USA.","DOI":"10.1109\/SFCS.1985.64"},{"key":"ref_17","first-page":"2916","article-title":"Improved PBFT consensus algorithm based on node grouping reputation model","volume":"40","author":"Chen","year":"2023","journal-title":"Appl. Res. Comput."},{"key":"ref_18","first-page":"42","article-title":"PBFT consensus algorithm based on reputation value voting and random number election","volume":"48","author":"Chen","year":"2022","journal-title":"Comput. Eng."},{"key":"ref_19","first-page":"1","article-title":"Credit-based committee consensus mechanism","volume":"1","author":"Sun","year":"2024","journal-title":"J. Comput. Appl."},{"key":"ref_20","first-page":"26","article-title":"Evaluation model of cross-chain notary mechanism based on improved PageRank algorithm","volume":"47","author":"Dai","year":"2021","journal-title":"Comput. Eng."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Zhao, L., Li, B., Zhou, Q.L., and Chen, X. (2022, January 27\u201329). Improvement and optimization of consensus algorithm based on PBFT. Proceedings of the 4th International Conference on Communications, Information System and Computer Engineering, Piscataway, NJ, USA.","DOI":"10.1109\/CISCE55963.2022.9851050"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Dodis, Y., and Yampolskiy, A. (2005). A verifiable random function with short proofs and keys. International Workshop on Public Key Cryptography, Springer.","DOI":"10.1007\/978-3-540-30580-4_28"},{"key":"ref_23","first-page":"19","article-title":"An editable and accountable blockchain scheme","volume":"7","author":"Zhao","year":"2022","journal-title":"J. Cyber Secur."},{"key":"ref_24","first-page":"413","article-title":"A Decentralized and Traceable Editable Blockchain Scheme","volume":"70","author":"Lai","year":"2024","journal-title":"J. Wuhan Univ. Sci. Ed."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/16\/2\/83\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T10:34:13Z","timestamp":1759919653000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/16\/2\/83"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,23]]},"references-count":24,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,2]]}},"alternative-id":["info16020083"],"URL":"https:\/\/doi.org\/10.3390\/info16020083","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2025,1,23]]}}}