A method for managing message processing in anonymous peer-to-peer networks

Abstract

The article considers the problem of message source authentication in anonymous peer-to-peer networks implemented on the basis of a low-bandwidth wireless communication channel (LoRaWAN). A promising method of message authentication for such networks is the use of coding in the block chaining mode, which provides higher reliability in comparison with block methods under conditions of a limited size of the message authentication code field. The article describes the development of an approach based on the exclusion during authentication of a part of messages based on a certain codogram describing the ordinal number of the message in the sequence of messages from a specific source to the receiver. Presenting the results of intermediate calculations and comparisons of message authentication codes in the form of a tree graph, it is proposed to select messages generated by the target source without additional verification based on the structure of such a graph. This allows, due to graph reduction, to reduce both the probability of authentication code collisions and the number of comparison operations of such codes upon receipt of the next message and its addition to the graph.