Homomorphic signature method for intra-generation/inter-generation attack resistance

Abstract

The invention, which relates to the technical field of network coding, discloses a homomorphic signature method for intra-generation / inter-generation attack resistance. The method is formed by four polynomial time algorithms of parameter setup, message signing Sign, message combination Combine, and message verification Verify. To be specific, the method comprises: at a preparation stage, each generation of messages are written into an m*(n-1)-dimensional matrix mode, the sum of each row of data is used as a row header, an m*n-dimensional matrix is formed by transformation, and signature information is designed by using first N bits of information in a message vector according to an algorithm; parameter setting (Setup) is carried out; an operation of message signing Sign (SK, id, V'i) is carried out; an operation of message combination combine is carried out; and an operation of message operation Verifiy (id, v, sigma, PK) is carried out. Generation identifier information is applied to signature construction. The data verification algorithm is completed jointly by using a fixed private key and a generation identifier. On the basis of theoretical demonstration, the method is capable of being resistant to the intra-generation / inter-generation attack to realize independent authentication of information of all generations. The method having characteristics of low computing cost and high security is suitable for a real-time communication system.

Description

technical field [0001] The invention relates to the technical field of network coding, in particular to a homomorphic signature method against intra-generation / inter-generation attacks. Background technique [0002] Network coding is vulnerable to pollution attacks by malicious nodes in the network. Information is maliciously tampered or forged after transmission and pollutes the entire network, resulting in information sinks being unable to correctly decrypt information, and network resources may be greatly wasted. [0003] In 2000, after Cai et al. proposed the concept of network coding, network coding was widely used in wireless networks, application layer multicast, P2P file sharing, etc., which greatly improved network throughput and network transmission rate, and effectively improved Network robustness and stability. However, network codes are vulnerable to pollution attacks by malicious nodes. The source information is maliciously tampered or forged, and the code tra...

AI Technical Summary

Problems solved by technology

For the first time, Krohn et al. proposed the use of homomorphic hash functions to design a verification algorithm for homomorphic signature schemes. This method can detect modified code packets, but it needs to perform a large number of bilinear pairing operations, and cannot realize the instant transmission of data packets.

Yu et al. proposed a homomorphic signature scheme based on RSA, which can greatly reduce the computational complexity of homomorphic signatures, but there are still a large number of modular exponent operations, and there is a serious problem of intergenerational pollution.

The homomorphic signature scheme proposed by Liu et al. sets an independent and unique message generation identifier for each generation of messages, and uses the hash value generated by the message generation identifier to randomly process the key, so as to achieve the purpose of resisting intra-generation and inter-generation attacks. , but the amount of calculation is still large

Images