A Robust Primitive for Avoiding Data Attacks Using Cryptography
Year: 2016
Type: article
Abstract: Within our plan, a session secret is only accessible towards the interacting parties (user and server), which is unknown either to the registration center varieties. Within this paper, we first evaluate He-Wang’s plan and reveal that their plan is susceptible to a known session specific temporary information attack and impersonation attack. Additionally, we reveal that their plan doesn't provide strong user’s anonymity. In addition, He-Wang’s plan cannot supply the user revocation facility once the wise card sheds or taken or user’s authentication parameter is revealed. While using Burrows-Abadi-Needham logic, we reveal that our plan provides secure authentication. Additionally, we simulate our plan for that formal security verification while using broadly recognized and used automated validation of Internet security software methods and programs tool, and reveal that our plan is safe against passive and active attacks. Our plan provides high security together with low communication cost, computational cost, and number of security measures. Aside from these, He-Wang’s plan has some design flaws, for example wrong password login and it is effects and wrong password update during password change phase. Then we propose a brand new secure multi-server authentication protocol using biometric-based wise card and ECC with increased security benefits. Consequently, our plan is extremely appropriate for battery-limited mobile products as in comparison with He-Wang’s plan.
Authors: Nagaram Pradeep Kumar Goud, P. Ramesh Reddy
Institution: Karunya University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2584419423
