Two-round multiple chameleon hash function calculation method and system

Abstract

The invention discloses a two-round multi-chameleon hash function calculation method and system, and belongs to the technical field of block chains and cryptography, and the method comprises the steps: firstly carrying out the safety setting and distributed key generation, and preparing basic data for the calculation of a multi-chameleon hash function; then performing Hash calculation by using the aggregation public key, wherein the results are (C, m, r, s): a Hash value, a message and two random numbers respectively; and then distributed collision searching is carried out: 1) each participant Pi selects v random numbers, calculates commitments (r'i, 1,..., r'i, v) and sends the commitments to other parties; the method comprises the following steps of 1, receiving n * v random numbers, 2, enabling each party to carry out linear combination on n * v random numbers, calculating a global random number r ', calculating a collision share s'i, and sending s'i to each party, and 3, enabling each party to calculate Hash collision s' by using the received n collision shares s'i. According to the method, a chameleon Hash multi-party protocol is improved, the communication round is two, and the communication complexity is reduced.

Description

technical field [0001] The invention relates to the technical fields of blockchain and cryptography, in particular to a two-round multi-chameleon hash function calculation method and system. Background technique [0002] The chameleon hash function, also known as the trapdoor hash function, was first proposed by Krawczyk and Rabin. "Chameleon" means that the owner of the trapdoor information can change the input of the function at will without changing the output of the function. In the chameleon hash function, a person who has trapdoor information can easily calculate the collision of a random input, but a person who does not have trapdoor information cannot calculate the collision. [0003] In the multiple chameleon hash algorithm proposed by the applicant, three communication rounds are used: random number commitment, random number disclosure, and calculation hash collision. In this multiple chameleon hash algorithm, three communication rounds are required, and The firs...

AI Technical Summary

Problems solved by technology

[0003] In the multiple chameleon hash algorithm proposed by the applicant, three communication rounds are used: random number commitment, random number disclosure, and calculation hash collision. In this multiple chameleon hash algorithm, three communication rounds are required, and The first round is bound to the new message to be calculated, so that the algorithm cannot be preprocessed

Images