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

Guardado en:
Bibliografiske detaljer
Udgivet i:Mathematics vol. 13, no. 9 (2025), p. 1474
Hovedforfatter: Chen Yineng
Andre forfattere: Guo, Ting, Ren Qingshan, Yang, Xiwen, Chen, Xiaoxuan, Liu Shukun, Zeng Fanzai
Udgivet:
MDPI AG
Fag:
Online adgang:Citation/Abstract
Full Text + Graphics
Full Text - PDF
Tags: Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!

MARC

LEADER 00000nab a2200000uu 4500
001 3203211297
003 UK-CbPIL
022 |a 2227-7390 
024 7 |a 10.3390/math13091474  |2 doi 
035 |a 3203211297 
045 2 |b d20250101  |b d20251231 
084 |a 231533  |2 nlm 
100 1 |a Chen Yineng  |u College of Information Science and Engineering, Hunan Women’s University, Changsha 410004, China; yinengchen@hunau.edu.cn (Y.C.); 
245 1 |a RBAU: Noval Redactable Model with Audit Mechanism and Key Update for Alliance Chain 
260 |b MDPI AG  |c 2025 
513 |a Journal Article 
520 3 |a 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. 
653 |a Innovations 
653 |a Supply chains 
653 |a Blockchain 
653 |a Data integrity 
653 |a Regulation 
653 |a Algorithms 
653 |a Security 
653 |a Privacy 
653 |a Hash based algorithms 
653 |a Clustering 
653 |a Traffic accidents & safety 
653 |a Efficiency 
700 1 |a Guo, Ting  |u College of Information Science and Engineering, Hunan Women’s University, Changsha 410004, China; yinengchen@hunau.edu.cn (Y.C.); 
700 1 |a Ren Qingshan  |u College of Information Science and Engineering, Hunan Women’s University, Changsha 410004, China; yinengchen@hunau.edu.cn (Y.C.); 
700 1 |a Yang, Xiwen  |u College of Information Science and Engineering, Hunan Women’s University, Changsha 410004, China; yinengchen@hunau.edu.cn (Y.C.); 
700 1 |a Chen, Xiaoxuan  |u College of Information and Intelligence, Hunan Agricultural University, Changsha 410128, China 
700 1 |a Liu Shukun  |u College of Information Science and Engineering, Hunan Women’s University, Changsha 410004, China; yinengchen@hunau.edu.cn (Y.C.); 
700 1 |a Zeng Fanzai  |u College of Computer Science and Electronic Engineering, Hunan University, Changsha 410082, China 
773 0 |t Mathematics  |g vol. 13, no. 9 (2025), p. 1474 
786 0 |d ProQuest  |t Engineering Database 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/3203211297/abstract/embedded/75I98GEZK8WCJMPQ?source=fedsrch 
856 4 0 |3 Full Text + Graphics  |u https://www.proquest.com/docview/3203211297/fulltextwithgraphics/embedded/75I98GEZK8WCJMPQ?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/3203211297/fulltextPDF/embedded/75I98GEZK8WCJMPQ?source=fedsrch