Publication

Abstract : Rapid-growth in wireless communication technologies and increasing demand smart devices are enabling users to access various services in remote areas. However, security and privacy are the two key attributes of wireless communication. To establish secure channel, various anonymous authentication schemes have been proposed based on classical number-theoretic hard assumptions ( discrete logarithm or factorization ) have been introduced in the last two or three decades. Due to Shor’s algorithm, a scheme based on number-theoretic assumptions could be broken by post-quantum computers in polynomial time. Therefore, we have proposed learning with errors based anonymous authentication protocol using ideal in some lattice. The security proof of the proposed technique ensures provable-security in the random oracle under learning with errors problem in some lattice. Furthermore, an informal security discussion and performance analysis show that our LWESM protocol is efficient and could be used in various applications.