RBAU: Noval Redactable Model with Audit Mechanism and Key Update for Alliance Chain

Yineng Chen, Ting Guo (), Qingshan Ren, Xiwen Yang, Xiaoxuan Chen, Shukun Liu and Fanzai Zeng ()
Additional contact information
Yineng Chen: College of Information Science and Engineering, Hunan Women’s University, Changsha 410004, China
Ting Guo: College of Information Science and Engineering, Hunan Women’s University, Changsha 410004, China
Qingshan Ren: College of Information Science and Engineering, Hunan Women’s University, Changsha 410004, China
Xiwen Yang: College of Information Science and Engineering, Hunan Women’s University, Changsha 410004, China
Xiaoxuan Chen: College of Information and Intelligence, Hunan Agricultural University, Changsha 410128, China
Shukun Liu: College of Information Science and Engineering, Hunan Women’s University, Changsha 410004, China
Fanzai Zeng: College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China

Mathematics, 2025, vol. 13, issue 9, 1-24

Abstract: With the widespread application of alliance chain technology in diverse scenarios, its immutability has gradually revealed certain limitations in practical use. To address this challenge, a redactable alliance chain innovatively introduces functionalities for data modification, deletion, and updating. However, issues related to redaction permissions, auditing, and security hinder its development. To overcome these challenges, the K-medoids clustering algorithm is first employed to select a redaction center and a consensus committee. The redaction center reviews redaction requests, while the consensus committee groups redaction blocks and reaches block consensus. Next, a dual-hash function scheme is proposed, where a subkey-updatable chameleon hash function collaborates with a standard hash function. The system’s master key can revoke a user’s redaction rights by updating their subkey. Based on this framework, a block redaction strategy comprising four phases and nine execution algorithms is introduced, enabling an auditable, accountable, and subkey-updatable RBAU. Security analysis and experimental results demonstrate that the proposed model excels in correctness, resistance to collision of the original key, resistance to collision of the updated key, user subkey updatability, and master key immutability. Additionally, the algorithm’s execution time, transaction execution time, block size, and redaction time are comparable to those of the pre-improvement alliance chain.

Keywords: blockchain; redactable; chameleon hash function; K-medoids; key update (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/9/1474/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/9/1474/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:9:p:1474-:d:1646371

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().