Articles written in Sadhana
Volume 45 All articles Published: January 2020 Article ID 0015 Original Article(Computer Sciences)
The accelerated growth of internet technologies has offered various services to users, although the access to data comes with a greater encumbrance as data are transferred via a public channel. To ensure authorised and secure data access, various authenticated key agreement protocols have been designed and analysed in recent years. Most of the existing protocols face the efficiency issue. A scheme could be made efficient using lightweight cryptographic operations such as hash functions, XOR operation, etc. However, to control the leakage of password, a biometric-based authentication approach can be adopted. Keeping the focus on these points, the proposed scheme is designed. It has attributes of secure communication, mutual authentication and efficient computation, as well as user anonymity. The security proof is proclaimed using the widely recognised random oracle model, which indicates that the proposed scheme is provably secure under any probabilistic polynomial-time adversary. Moreover, the proposed scheme achieves all desirable security attributes of authentication protocols, which is justified using informal security analysis. The simulation of the proposed scheme is done using the automated validation of internet security protocols and applications tool,which shows that the proposed scheme is safe. Furthermore, the proposed scheme is found to be computationally efficient when compared with the related schemes.
Volume 45 All articles Published: 19 August 2020 Article ID 0209
Oblivious transfer (OT) is a fundamental cryptographic primitive. It is developed for the efficient and feasible implementation of most advanced cryptographic tasks. Today, most of the existing OT protocols’ security is based on number-theoretic assumptions. However, many number-theoretical problems are solvable by a quantum computer in polynomial time. Therefore, OT protocols with post-quantum cryptography approach are required. Multivariate cryptographic constructions are one of the potential candidates for post-quantum cryptographyas they are speedy and require only modest computational resources. This paper presents constructions of OT protocols utilizing multivariate public key cryptography (MPKC). Security of our schemes is achieved under the hardness of multivariate quadratic (MQ) problem. To the best of our knowledge, our designs are the first MPKC-based post-quantum OT protocols.