Vimal Kumar

Dr. Vimal Kumar

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
1 March 2014 in IEEE Software
Verified
Journal Article
Closed access
SMSanjay Madria
Sanjay Madria
VKVimal Kumar
Vimal Kumar
RDRashmi Dalvi
Rashmi Dalvi
Newer models for interacting with wireless sensors such as Internet of Things and Sensor Cloud aim to overcome restricted resources and efficiency. The Missouri S&T (science and technology) sensor cloud enables different networks, spread in a huge geographical area, to connect together and be employed simultaneously by multiple users on demand. Virtual sensors, which are at the core of this sensor cloud architecture, assist in creating a multiuser environment on top of resource-constrained physical wireless sensors and can help in supporting multiple applications.

2 March 2024 in International Journal of Information Security
Verified
Journal Article
Open access
PDF file
CCChristopher Jun Wen Chew
Christopher Jun Wen Chew
VKVimal Kumar
Vimal Kumar
PPPanos Patros
Panos Patros
RMRobi Malik
Robi Malik
Ransomware, particularly crypto ransomware, has emerged as the go-to malware for threat actors aiming to compromise data on Android devices as well as in general. In this paper, we present a ransomware detection technique based on behaviours observed in the system calls performed by the malware. We first describe our repeatable and extensible methodology for extracting the system call log and patterns. We then identify and present some common high-level system call behavioural patterns exhibited by crypto ransomware, and evaluate these patterns. We further describe the implementation of a streaming implementation that utilises regular expressions for modelling malware behaviours and finite state machines for detecting crypto ransomware behaviours in real time. The success of our proof of concept evaluation allows us to envision our proposed technique applied as part of a self-protection system on Android phones against malware.

1 January 2011 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
NPNayot Poolsappasit
Nayot Poolsappasit
VKVimal Kumar
Vimal Kumar
SMSanjay Madria
Sanjay Madria
SCSriram Chellappan
Sriram Chellappan

1 July 2012
Verified
Conference Paper
Closed access
VKVimal Kumar
Vimal Kumar
SMSanjay Kumar Madria
Sanjay Kumar Madria
Secure data aggregation in wireless sensor networks has two contrasting objectives, i) Efficiently collecting and aggregating data and ii) Aggregating the data securely. Many schemes do not take into account the possibility of corrupt aggregators and allow the aggregator to decrypt data in hop by hop algorithms. On the other hand using public key cryptography for providing end to end security is not energy efficient. In this paper we present and analyze the performance of the secure hierarchical data aggregation algorithm which uses an efficient public key cryptosystem (elliptic curve cryptography) to achieve end to end security. Unlike many other secure data aggregation algorithms which require separate phases for secure aggregation and integrity verification, the secure hierarchical data aggregation algorithm does not require an additional phase for verification. This saves energy by avoiding additional transmissions and computational overhead on the sensor nodes. We present and implement the secure data aggregation algorithm on Mica2 and TelosB sensor network platforms and measure the execution time and energy consumption of various cryptographic functions. We have also simulated our algorithms to analyze how an end to end scheme increases the network life time. We experimentally analyze our algorithms based on parameters like throughput, end to end delay and resilience to node failures.

1 September 2013
Verified
Conference Paper
Closed access
VKVimal Kumar
Vimal Kumar
SMSanjay Madria
Sanjay Madria
With the exponential rise of pervasive computing applications, data privacy has become much more of an important issue than before. When data is aggregated at each hop in a sensor network, it becomes harder to protect its privacy. A number of privacy preserving data aggregation algorithms have recently appeared for wireless sensor networks (WSNs), very few of them however also address the issue of data integrity along with privacy. Data privacy and integrity are two contrasting objectives to achieve in general. In a privacy preserved data aggregation, it becomes easier for an attacker to inject false data hence, we suggest that both privacy and integrity of data should be treated together. In this paper, we present an energy efficient, privacy preserving data aggregation algorithm which also preserves data integrity in WSNs. We analyze the security of the algorithm and provide proofs for confidentiality and integrity. We enhance this algorithm further to localize, to a certain degree, the corrupt aggregator. We provide the results of our implementation of the algorithm on TelosB motes, illustrating that both the computational overhead and the energy consumption are very low. Finally, we compare our algorithm with other schemes having similar objectives demonstrating that our algorithm performs better in terms of band with usage and energy consumption in a WSN environment.

7 November 2024 in International Journal of Information Security
Verified
Journal Article
Closed access
PDF file
ZZZijing Zhang
Zijing Zhang
VKVimal Kumar
Vimal Kumar
BPBernhard Pfahringer
Bernhard Pfahringer
Albert BifetAlbert Bifet
Albert Bifet