Archana Raghuvamshi

Work place: Adkavi Nannaya University /CSE Department, Rajahmundry, 533296, India

E-mail: archana_anur@yahoo.in

Website:

Research Interests: Computer Science & Information Technology, Information Security, Network Security, Information Systems

Biography

Archana Raghuvamshi she received her Bachelor’s Degree BSc (M.S.Cs), Master’s Degrees M.C.A and M.Tech(CSE) from Osmania University, Hyderabad. She did course work in ADS and WMN in IITM (Indian Institute of Technology, Madras). She is perusing PhD (CSE) in JNTUK, Kakinada. She has published four research papers in IEEE Digital library and another four research papers in various peer reviewed International Journals. Her research interest includes Cryptography and Information Security, Security in Cloud Computing etc.

 

Professional Bodies:

She is a,

  1. Professional Member of ACM
  2. Member of Professional Body IAENG
  3. Member of IACSIT
  4. Associate Member of theIRED

 

Work Experience:

She is having 13+ year of teaching experience. She is working as an Assistant Professor in Dept. of CSE, UCOE, Adikavi Nannaya University, Rajahmundry, India.

Author Articles
Verifier-based Password Authenticated 3P-EKE Protocol using PCLA Keys

By Archana Raghuvamshi Premchand Parvataneni

DOI: https://doi.org/10.5815/ijcnis.2016.06.07, Pub. Date: 8 Jun. 2016

This paper endeavors to present a novel framework for the generic structure of a verifier-based password authenticated Three-Party Encrypted Key Exchange (3P-EKE) protocol which yields more efficient protocol than the ones knew before. A previous framework presented by Archana and Premchand is more secured against all types of attacks like password guessing, replay, pre-play, man-in-the-middle attack etc. But unfortunately, this protocol does not solve the problem of a server compromise. These proofs help as inspiration to search for another framework. The framework we offer produces more efficient 3P-EKE protocol, and, in addition, delivers perceptive clarification about the existing attacks that do not solve in the previous framework. Moreover, it allows direct change from a class of verge private-key encryption to a hybrid (symmetric & Asymmetric) one without significant overhead.

[...] Read more.
Design of a Robust, Computation-Efficient and Secure 3P-EKE Protocol using Analogous Message Transmission

By Archana Raghuvamshi Premchand Parvataneni

DOI: https://doi.org/10.5815/ijcnis.2016.05.02, Pub. Date: 8 May 2016

In this modern era of digital communication even a trivial task needs to be performed over internet which is not secure. Many cryptographic algorithms existed to provide security which facilitates secure communication through internet. As these algorithms need a secret session key, it is required to interchange this key in a secure way. In two-party communication, two clients initially share a low random (entropy) password through a secure channel to establish a secret session key. But this paradigm necessitates high maintenance of passwords, since each communicating pair requires separate passwords to establish a secure session key. In three-party communication network, each communication party shares a password with the trusted third-party (server) to exchange a secret session key. The beauty of this setting is that, even a server does not know the session key. The Password Authenticated Encrypted Key Exchange (PA-EKE) protocols have attracted a lot of curiosity to authors to propose various two-party and three-party PA-EKE protocols. Security flaws in various protocols proposed by Chang-Chang, Yoon-Yoo, PSRJ and Raj et al. inspired to design a robust, computationally efficient and highly secure protocol. This paper is an attempt to propose a secure and novel Password Authenticated 3P-EKE protocol using XOR operations and analogous (parallel) message transmission. The proposed protocol is easy to design and more secured against all types of attacks like password guessing, replay, pre-play, server spoofing etc. which made this protocol special.

[...] Read more.
Other Articles