Implementation of one-time editable blockchain chameleon hash function construction scheme

Under the premise of ensuring the security and integrity of the blockchain, the editable blockchain realizes the correction operation of the data on the chain, but the number of edits is not limited, so that malicious users can modify the data on the chain infinitely in the case of obtaining a trapdoor. Based on this, a function construction scheme that combines the Elliptic Curve Discrete Logarithm Problem difficulty assumption with a cryptographic primitive called one-time chameleon hash function is proposed.A controllable variable is introduced for the hash generation part of the chameleon hash function, so that the same hash value can find two preimages without revealing trapdoor information, However, when searching for the third pre-image, the secondary use of the set controllable variable results in "access failure", i.e., satisfying the secondary collision resistance, The security of the scheme under the assumption of Elliptic Curve Discrete Logarithm Problem is proved in the random oracle model, and a chameleon hash algorithm that is also resistant to secondary editing is selected for experimental comparative analysis. The results show that the scheme in this paper reduces the number of modal operations, which makes the algorithm complexity reduced. It is able to improve the computing efficiency of hash generation algorithm and hash collision algorithm significantly with the same security strength. The combination of the amendment privilege restriction of the chameleon hash function and the efficiency of its algorithm is realized, which provides a technical reference for the amendment privilege management of editable blockchain.