Sonali Gupta

Sonali Gupta

Auto-generated profile, based on publicly available information

Sonali Gupta

J.C. Bose University of Science and Technology, YMCA, INDIA

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 March 2022 in Wireless Communications and Mobile Computing
Verified
Journal Article
Open access
PDF file
UIUmmer Iqbal
Ummer Iqbal
ATAditya Tandon
Aditya Tandon
SGSonali Gupta
Sonali Gupta
Arvind R YadavArvind R Yadav
Arvind R Yadav
Rahul NewareRahul Neware
Rahul Neware
FGFraol Waldamichael Gelana
Fraol Waldamichael Gelana
The integration of IoT with the cloud infrastructure is essential for designing smart applications. However, such integration may lead to security issues. Authentication and session key establishment is an essential security requirement for secure communication between IoT devices and cloud servers. For evaluating authentication key agreement schemes, the extended Canetti–Krawczyk (eCK) adversary model is regarded to be a more strict and relevant adversary model. Many schemes for authenticated key exchange between IoT devices and cloud servers have been proposed in the literature but have been assessed under Dolev and Yoa (DY) adversary model. Recently, Rostampour et al. introduced an ECC-based approach for enabling authentication between IoT devices and cloud servers that is secure and robust to various attacks under the Dolev and Yoa adversary model. In this paper, a detailed review and the automated security verification of the Rostampour et al. scheme are carried out under the eCK adversary model using Scyther-Compromise. The validation indicates that the scheme is not secure and is susceptible to various attacks under the eCK adversary model. To overcome the limitation of the Rostampour et al. scheme, a design of an ECC-based scheme for authentication between IoT devices and cloud servers under the eCK adversary model is proposed. The Scyther verification indicates that the scheme is safe under the eCK adversary model. The soundness of the correctness of the proposed scheme has been analyzed using BAN logic. Comparative analysis indicates that the scheme is resilient under the eCK adversary model with an energy overhead of 278.16 mJ for a resource constraint IoT device and a communication overhead of 1,408 bits.


15 October 2021 in International Journal of Information Retrieval Research
Verified
Journal Article
Open access
SGSonali Gupta
Sonali Gupta
KBKomal Kumar Bhatia
Komal Kumar Bhatia
The WWW contains huge amount of information from different areas. This information may be present virtually in the form of web pages, media, articles (research journals / magazine), blogs etc. A major portion of the information is present in web databases that can be retrieved by raising queries at the interface offered by the specific database and is thus called the Hidden Web. An important issue is to efficiently retrieve and provide access to this enormous amount of information through crawling. In this paper, we present the architecture of a parallel crawler for the Hidden Web that avoids download overlaps by following a domain-specific approach. The experimental results further show that the proposed parallel Hidden web crawler (PSHWC), not only effectively but also efficiently extracts and download the contents in the Hidden web databases

1 January 2012
Verified
Conference Paper
Closed access
SGS. Gupta
S. Gupta
KBK.K. Bhatia
K.K. Bhatia

13 May 2022
Verified
Book Chapter
Closed access
SGSonali Gupta
Sonali Gupta
WWW is a repository of hyperlinked data sources that contains heterogeneous data in the form of text, audio, video, and metadata. Search engines play an important role in searching information from these data sources. They offer the users an interface to retrieve the data from these resources. The search engines gather, analyze, organize, and handle the data available in these data sources and return thousands of results in the form of web pages. Often the returned web pages include a mixture of relevant and irrelevant information. To return more significant and relevant response pages, a mechanism to rank the returned pages is desirable. Page ranking algorithms play an important role in ranking web pages so that the user could get the relevant result according to the user query. The proposed technique is used to rank the hidden web pages based on the meta information of the pages downloaded by crawler and the calculated value for the chosen parameters.

6 May 2022
Verified
Book Chapter
Closed access
SGSonali Gupta
Sonali Gupta
The dark web is termed as the concealed content hidden behind interfaces offering secure chats or mailing applications on the WWW, and exploiting it for illegal practices is termed cybercrimes. As the dark web is enormously big compared to the surface web, cyber-crimes have become one of the biggest challenges to tackle. Predicting them before they actually happen is almost impossible. The work thus deals with predicting the number of cognizable crimes (physical and cybercrimes reported collectively) by National Crime Record Bureau (NCRB), the government-approved agency for maintaining crime records in India. Predicting crimes has become important as they advance to new levels of intelligence and diversification with the increased use of information and communication technology (ICT). This work presents the research based on evidences with ARIMA and LSTM time series models for predicting the cognizable crimes in India. The authors have used root mean squared error and mean absolute error as loss functions for error evaluation, and the results obtained from both the models are presented.