Revisiting Aggregation Sequentially with M-A-C’s and Detecting Functionality

Abstract

A cryptographic tool known as the aggregate message authentication code (aggregate MAC) can condense the MAC’Stags from several messages into a single, condensed aggregate MAC’Stag. The sequentially aggregated MAC’s may additionally verify the (sequential) order of messages in addition to the correctness of multiple messages. In this study, we provide a novel sequentially aggregated MAC’s paradigm in which an aggregation kind of algorithm creates a sequential aggregating based just on any type of various sequences officially describe type of security in this paradigm, which uses separate MAC’Stags without a secret key. Additionally, without altering the MACs’ structure, we provide a general method of building consecutive aggregate MACs beginning from any MAC. By integrating the aggregation algorithm with other MAC’s methods currently present in the given type of networks, this property is helpful to increase the efficiency of the current networks. It also offer a sequential aggregate MAC’s with detecting capabilities by expanding the SAMAC’s findings (SAMD’S). It can define a message which is valid or invalid order for a particular type of message using the SAMD’S. We propose a general type of design of SAMD’S using random type of oracle model from which any MACs and non-adaptive group can be tested and their kind of protocols with formal type of security implementation proofs. We further define the type of security of SAMD’S.