Efficient Multicast Authentication Batch Signature
P. Gayathri, A. Jeyamathi · 2014
Multicast (1) is defined as sending data from a single sender to a group of receivers. While multicasting the data, it should be provided with security services. Generally, security services are classified into five areas namely data integrity, data origin, authentication (2), non-repudiation and confidentiality. This project work supports the first three security services, which are implemented using a cryptographic technique called batch signature (3). Designing a batch signature protocol is quite difficult and hence certain issues have to be considered, which include efficiency, packet loss, computation latency and communication overhead. In internet, normally congestion is sure to happen at certain period which results in packet loss (4) have to be reduced. For applications like online streaming, video conferencing and online games, the quality of services is low to the end users. Therefore, MABS protocol should provide a certain level of packet loss recovery. In this paper, we have proposed two schemes namely, basic scheme and enhanced scheme. The basic scheme normally supports three algorithms namely batch RSA algorithm (5), batch BLS algorithm (6) and our batch DSA algorithm (7, 8), in which these algorithms mainly involves to address efficiency and packet loss problems in network environment (9). Enhanced scheme combines basic scheme and merkle tree generation (10) (packet filtering technique) which completely eliminates the forged packets in order to overcome the DOS (Denial of Service) attack. Hence, our comparison study predicts that MABS-E is less efficient than MABS-B due to DOS defense. In our new approach, mod-inversion operation is one of the most important factors which influence the computation time of digital signature and verification, thus improvements to this point has been proposed by implementing new approach called PDSA.