Multisender authentication code was firstly constructed by Gilbert et al. [1] in 1974. Multisender authentication system refers towho a groupof senders, cooperatively send amessage to a receiver; then the receiver should be able to ascertain that the message is authentic. About this case, many scholars and researchers had made great contributions to multisender authentication codes, such as [2–...

A two-phase content-based image authentication scheme is constructed based on a combination of hard and soft authentication implementing previous existing generic approximate message authentication codes which is a error-correcting codes with cryptographic message authentication codes and symmetric encryption techniques. The message authentication codes which used for hard authentication. The t...

Advanced metering infrastructure (AMI) is a key part of the smart grid; thus, one of the most important concerns is to offer a secure mutual authentication.  This study focuses on communication between a smart meter and a server on the utility side. Hence, a mutual authentication mechanism in AMI is presented based on the elliptic curve cryptography (ECC) and one time signature (OTS) consists o...

Ad-hoc Networks are using multicast protocol to broadcast the messages. Multicast authentication in ad-hoc networks are very challenging based on below mentioned multiple factors such as nodes have limited computing, bandwidth, and energy resources. Additionally, frequent packet loss errors require a security solution that can tolerate missed packets. The existing cryptography techniques are in...

Tag-based message authentication is a popular cryptographic technique to digitally sign messages. However, for short messages, it often incurs additional costs due to large tags. In this paper, we propose a new scheme that achieves tagless message authentication. The scheme leverages a trade-off between character support and complexity of forgery to provide information security and authenticity.

In this paper, we propose a new primitive called non interactive deniable ring authentication: it is possible to convince a verifier that a member of an ad hoc collection of participants is authenticating a message m without revealing which one and the verifier V cannot convince any third party that the message m was indeed authenticated in a non-interactive way. Unlike the deniable ring authen...