An Alliance Blockchain Modification Method Based on Chameleon Hashing and Verifiable Secret Sharing
The blockchain has the characteristics of decentralization, tamper resistance, and traceability. The existing alliance chain system will leave traces throughout the entire process after data is uploaded, which cannot be processed when sensitive information or malicious data appears or the blockchain...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2025-01-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | http://dx.doi.org/10.1155/dsn/9039209 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The blockchain has the characteristics of decentralization, tamper resistance, and traceability. The existing alliance chain system will leave traces throughout the entire process after data is uploaded, which cannot be processed when sensitive information or malicious data appears or the blockchain forks or interrupts after processing. Therefore, an alliance blockchain modification method based on chameleon hashing and verifiable secret sharing is proposed to address these issues. This method first assigns the trap gate of the chameleon hash to the identity node, isolating the initiator and actual modifier. Secondly, in order to ensure the correctness of redistribution values, the data corresponding to chameleon hashes in different time periods are set as verifiable data, the verification node uploads the commitment to verifiable data, and the proposal node verifies the secret shared value through the commitment. Finally, to prevent nodes from committing wrongdoing, a data correction method based on a reward mechanism is proposed, which increases the enthusiasm of nodes to correct the wrongdoing and reduces the possibility of wrongdoing. Experiments were conducted on the DApps dataset developed by InPlusLab, the Blockchain and Intelligent Finance Research Center at Sun Yat-sen University. The algorithm has a faster execution rate than existing solutions. |
|---|---|
| ISSN: | 1550-1477 |