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 46 All articles Published: 22 April 2021 Article ID 0084
Advances in communication technologies along with the availability of Internet and Internet of Things (IoT) devices enable users to acquire various services over the Internet. However, IoT devices are prone to attacks on the open communication channel. Many authenticated key agreement schemes have been introduced in the last decades to improve security, where most of the schemes are based on the classical number theoretic assumptions. Unfortunately, Shor’s algorithm provides the mechanism to solve the existing number theory-based problems such as discrete logarithm, integer factorization, etc. As a result, the hard problems based on number theory could be solved very efficiently on a quantum computer using Shor’s algorithm. Therefore, the design of a protocol is required that can resist all known attacks by quantum computers. To address the security issues raised by Shor’s algorithm, we propose a lattice-based key agreement protocol under ring learning with errors (RLWE). Security analysis of the proposed protocol is also presented, where both informal security andformal security analyses are followed. The analysis of security clearly indicates that the proposed scheme is provably secure under a random oracle model. In addition we study the performance of the proposed scheme, which shows the enhancement in terms of performance.