Raju Halder

Dr. Raju Halder


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
7 June 2019 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SSSWAGATIKA SAHOO
SWAGATIKA SAHOO
AFAkshay Fajge
Akshay Fajge
RHRaju Halder
Raju Halder
Agostino CortesiAgostino Cortesi
Agostino Cortesi
In the nine years since its launch, amid intense research, scalability is always a serious concern in blockchain, especially in case of large-scale network generating huge number of transaction-records. In this paper, we propose a hierarchical blockchain model characterized by: (1) each level maintains multiple local blockchain networks, (2) each local blockchain records local transactional activities, and (3) partial views (tunable w.r.t. precision) of different subsets of local blockchain-records are maintained in the blockchains at next level of the hierarchy. To meet this objective, we apply abstractions on a set of transaction-records in a regular time interval by following the Abstract Interpretation framework, which provides a tunable precision in various abstract domain and guarantees the soundness of the system. While this model suitably fits to the real-worlds organizational structures, the proposal is powerful enough to scale when large number of nodes participate in a network resulting into an enormous growth of the network-size and the number of transaction-records. We discuss experimental results on a small-scale network with three sub networks at lower-level and by abstracting the transaction-records in the abstract domain of intervals. The results are encouraging and clearly indicate the effectiveness of this approach to control exponential growth of blockchain size w.r.t. the total number of participants in the network.

8 March 2022 in IEEE Access
Verified
Journal Article
Open access
SRSapana Rani
Sapana Rani
RHRaju Halder
Raju Halder
Digital watermarking is considered one of the most promising techniques to verify the authenticity and integrity of digital data. It is used for a wide range of applications, e.g., copyright protection, tamper detection, traitor tracing, maintaining the integrity of data, etc. In the past two decades, a wide range of algorithms for relational database watermarking has been proposed. Even though a number of surveys exist in the literature, they are unable to provide insightful guidance to choose the right watermarking technique for a given application. In this paper, we provide an exhaustive empirical study and thorough comparative analysis of various relational database watermarking techniques in the literature. Our work is different from the existing survey papers as we consider both distortion-based and distortion-free techniques along with a rigorous experimental analysis demonstrating a detailed comparison on robustness, data usability, and computational cost with considerable empirical evidence.

22 July 2023 in Blockchain: Research and Applications
Verified
Journal Article
Open access
MGMedhasree Ghosh
Medhasree Ghosh
DGDyuti Ghosh
Dyuti Ghosh
RHRaju Halder
Raju Halder
JCJoydeep Chandra
Joydeep Chandra

1 May 2020 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
AJAngshuman Jana
Angshuman Jana
RHRaju Halder
Raju Halder
KAKalahasti Venkata Abhishekh
Kalahasti Venkata Abhishekh
SGSanjeevini Devi Ganni
Sanjeevini Devi Ganni
Agostino CortesiAgostino Cortesi
Agostino Cortesi
Dependency information (data- and/or control-dependencies) among program variables and program statements is playing crucial roles in a wide range of software-engineering activities, e.g. program slicing, security analyses, debugging, code-optimization, code-reuse, code-understanding, etc. In spite of intensive research in this area, covering several mainstream languages, researchers have paid limited attention towards database applications embedding queries and data-manipulation commands. As a result, the existing approaches are practically infeasible when to apply on data-intensive codes supporting databases. This paper extends the Abstract Interpretation framework for static analysis to the case of database applications, providing a semantics-based dependency analysis tunable with respect to precision. More specifically, we instantiate dependency computation by using various relational and non-relational abstract domains, yielding to a detailed comparative analysis with respect to precision and efficiency. We present experimental evaluation results to establish the effectiveness of our approach.

11 July 2023 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
SCSujit Chowdhury
Sujit Chowdhury
AMArnab Mukherjee
Arnab Mukherjee
RHRaju Halder
Raju Halder
This paper introduces ${\sf FedRLChain}$ , a novel framework for blockchain-based secure federated deep reinforcement learning, which allows users to securely and collaboratively train a Deep Reinforcement Learning (DRL) model by plugging appropriate aggregation and verification algorithms for specific problems. Unlike existing systems, ${\sf FedRLChain}$ adopts (1) a novel verification algorithm to prevent malicious clients, (2) an aggregation weight scheme from preventing the global model from getting biased toward any client, and (3) a variant of traditional FedAverage algorithm to accelerate the convergence process. We perform a rigorous experimental evaluation of ${\sf FedRLChain}$ considering the classic cart-pole problem, and we show a significant improvement in the number of epochs and time required for model convergence w.r.t. the state-of-the-art frameworks – DDQL, BAFFLE, and BASE-PIoT.

7 July 2022 in IEEE Access
Verified
Journal Article
Open access
SNSatyendra R. Nishad
Satyendra R. Nishad
RHRaju Halder
Raju Halder
GBGourinath Banda
Gourinath Banda
ATAtul Thakur
Atul Thakur
This paper presents the design, fabrication, and control of a quadruped wall-climbing robot. The robot’s kinematics is inspired by lizards, which use trot-gait for the locomotion. The key features of this robot are its pressure-sensitive adhesive (PSA) enabled adhesion and peeling mechanism and the locomotion controller capable of straight and turning motion. We obtained an average vertical climbing speed of 1.35 cm/s without payload and 1.25 cm/s with a payload of 20 gm. Rapid prototyping techniques namely 3D-printing and 2D-LASER cutting are used to fabricate the entire structure of the robot, allowing easy replication of the entire robot in case a swarm of such robots is needed. This paper also reports climbing stability criteria for the developed robot expressed in terms of the pitching moment. We envisage that the developed robot can be deployed in surveillance, reconnaissance, cleaning, and repairing applications.