Ashutosh Bhatia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Ashutosh Bhatia has a total of 67 co-authors. Here are the top co-authors by number of shared publications:
- Kamlesh Tiwari
Birla Institute of Technology and Science, Pilani
23 shared publications - Ankit Agrawal
Department of CSIS, Birla Institute of Technology and Science, Pilani Campus, Pilani, India
10 shared publications - Sainath Bitragunta
Department of Electrical and Electronics Engineering, BITS Pilani, Pilani, Rajasthan, India
5 shared publications - Haribabu Kotakula
SDN Lab, Department of Computer Science and Information Systems, Birla Institute of Technology & Science - Pilani (BITS-Pilani), Pilani Campus, Pilani, India
3 shared publications - Arti Jha
School of Computer Science, UPES, Dehradun, India
2 shared publications - Geetika Arora
Birla Institute of Technology and Science Pilani
2 shared publications
Latest Publications
- 16 October 2026
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 85 (11) , 812
FrDPalmNet: Dual attention and densely connected blocks with fractional weighted skip connections for palmprint-based human authentication
- 16 October 2026
- Published by Springer Nature in Multimedia Tools and Applications
- Vol. 85 (11) , 812
FrDPalmNet: Dual attention and densely connected blocks with fractional weighted skip connections for palmprint-based human authentication
- 29 June 2026
- Published by Springer Nature in Quantum Information Processing
- Vol. 25 (7) , 233
A modified BBM92 protocol with Bell test-assisted parameter estimation
- 29 June 2026
- Published by Springer Nature in Quantum Information Processing
- Vol. 25 (7) , 233
A modified BBM92 protocol with Bell test-assisted parameter estimation
- 3 June 2026
- Published by Springer Nature
- p. 294-303
AlzNET: An Alzheimer Classification Network Using Action Identification
- 3 June 2026
- Published by Springer Nature
- p. 294-303
AlzNET: An Alzheimer Classification Network Using Action Identification
- 31 May 2026
- Published by Taylor & Francis in Journal of Internet Commerce
- Vol. 25 (4) , 640-683
Search Engine Advertising: A Systematic Literature Review and Future Research Agenda
Introduced by GoTo.com in 1998, search engine advertising (SEA) has evolved into a strategic and technological cornerstone of digital marketing (Jafarzadeh et al. 2015). Over the years, platforms s...
- 31 May 2026
- Published by Taylor & Francis in Journal of Internet Commerce
- Vol. 25 (4) , 640-683
Search Engine Advertising: A Systematic Literature Review and Future Research Agenda
Introduced by GoTo.com in 1998, search engine advertising (SEA) has evolved into a strategic and technological cornerstone of digital marketing (Jafarzadeh et al. 2015). Over the years, platforms s...
- Open Access
- 20 November 2025
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 164
Hierarchical Bayesian Deep Learning for return on advertising spend prediction: A probabilistic approach to e-commerce advertising
- 20 November 2025
- Published by Elsevier in Engineering Applications of Artificial Intelligence
- Vol. 164
Open AccessHierarchical Bayesian Deep Learning for return on advertising spend prediction: A probabilistic approach to e-commerce advertising
- Open Access
KTBox: A Modular LaTeX Framework for Semantic Color, Structured Highlighting, and Scholarly Communication
The communication of technical insight in scientific manuscripts often relies on ad-hoc formatting choices, resulting in inconsistent visual emphasis and limited portability across document classes. This paper introduces ktbox, a modular LaTeX framework that unifies semantic color palettes, structured highlight boxes, taxonomy trees, and author metadata utilities into a coherent system for scholarly writing. The framework is distributed as a set of lightweight, namespaced components: ktcolor.sty for semantic palettes, ktbox.sty for structured highlight and takeaway environments, ktlrtree.sty for taxonomy trees with fusion and auxiliary annotations, and ktorcid.sty for ORCID-linked author metadata. Each component is independently usable yet interoperable, ensuring compatibility with major templates such as IEEEtran, acmart, iclr conference, and beamer. Key features include auto-numbered takeaway boxes, wide-format highlights, flexible taxonomy tree visualizations, and multi-column layouts supporting embedded tables, enumerations, and code blocks. By adopting a clear separation of concerns and enforcing a consistent naming convention under the kt namespace, the framework transforms visual styling from cosmetic add-ons into reproducible, extensible building blocks of scientific communication, improving clarity, portability, and authoring efficiency across articles, posters, and presentations.
Open AccessKTBox: A Modular LaTeX Framework for Semantic Color, Structured Highlighting, and Scholarly Communication
The communication of technical insight in scientific manuscripts often relies on ad-hoc formatting choices, resulting in inconsistent visual emphasis and limited portability across document classes. This paper introduces ktbox, a modular LaTeX framework that unifies semantic color palettes, structured highlight boxes, taxonomy trees, and author metadata utilities into a coherent system for scholarly writing. The framework is distributed as a set of lightweight, namespaced components: ktcolor.sty for semantic palettes, ktbox.sty for structured highlight and takeaway environments, ktlrtree.sty for taxonomy trees with fusion and auxiliary annotations, and ktorcid.sty for ORCID-linked author metadata. Each component is independently usable yet interoperable, ensuring compatibility with major templates such as IEEEtran, acmart, iclr conference, and beamer. Key features include auto-numbered takeaway boxes, wide-format highlights, flexible taxonomy tree visualizations, and multi-column layouts supporting embedded tables, enumerations, and code blocks. By adopting a clear separation of concerns and enforcing a consistent naming convention under the kt namespace, the framework transforms visual styling from cosmetic add-ons into reproducible, extensible building blocks of scientific communication, improving clarity, portability, and authoring efficiency across articles, posters, and presentations.
- Open Access
- 14 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. PP, 1-12
Adaptive RIS Design and Optimization for Cooperative RIS-Assisted Wireless Systems
We propose an adaptive RIS-based cooperative transmission strategy that jointly selects one of two RIS paths and dynamically optimizes the number of active meta-atoms to maximize physical layer (PHY) secrecy capacity under a total average power constraint. Unlike existing approaches that fix the RIS size or assume identical fading on all links, our framework uses long-term statistics to probabilistically choose between two RISs (upper or lower) with arbitrary first-hop fading, and leverages instantaneous channel state information (CSI) on the selected path to solve a convex Ksizing problem via a Lagrangian multiplier approach. We derive and present the solution for optimal K, and numerically evaluate the average PHY secrecy capacity and average PHY secrecy efficiency for the proposed optimal strategy. Numerical results show that the proposed optimal$K$ strategy achieves up to 35% higher average PHY secrecy capacity and 50% improvement in average PHY secrecy efficiency compared to a fixedK benchmark strategy across moderate power thresholds. Furthermore, we present an insightful asymptotic analysis for average PHY secrecy capacity in an interesting scaling regime. Our findings demonstrate the practical benefits of adaptive RIS for cooperative PHY secure and energy-efficient beyond fifth generation (B5G) wireless systems.
- 14 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. PP, 1-12
Open AccessAdaptive RIS Design and Optimization for Cooperative RIS-Assisted Wireless Systems
We propose an adaptive RIS-based cooperative transmission strategy that jointly selects one of two RIS paths and dynamically optimizes the number of active meta-atoms to maximize physical layer (PHY) secrecy capacity under a total average power constraint. Unlike existing approaches that fix the RIS size or assume identical fading on all links, our framework uses long-term statistics to probabilistically choose between two RISs (upper or lower) with arbitrary first-hop fading, and leverages instantaneous channel state information (CSI) on the selected path to solve a convex Ksizing problem via a Lagrangian multiplier approach. We derive and present the solution for optimal K, and numerically evaluate the average PHY secrecy capacity and average PHY secrecy efficiency for the proposed optimal strategy. Numerical results show that the proposed optimal$K$ strategy achieves up to 35% higher average PHY secrecy capacity and 50% improvement in average PHY secrecy efficiency compared to a fixedK benchmark strategy across moderate power thresholds. Furthermore, we present an insightful asymptotic analysis for average PHY secrecy capacity in an interesting scaling regime. Our findings demonstrate the practical benefits of adaptive RIS for cooperative PHY secure and energy-efficient beyond fifth generation (B5G) wireless systems.
- Open Access
- 30 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 4923-4942
PUF-AQKD: A Hardware-Assisted Quantum Key Distribution Protocol for Man-in-the-Middle Attack Mitigation
The Quantum Key Distribution (QKD) protocol utilizes quantum mechanics principles for cryptographic key exchange, ensuring absolute secrecy. Current QKD techniques are susceptible to man-in-the-middle (MITM) attacks due to the absence of an inherent mechanism for identity verification within the quantum channel. For authentication, these systems rely on classical or post-quantum cryptography, which diminishes the perfect security advantage provided by QKD. We present a Physical Unclonable Function (PUF)-based authenticated QKD protocol (PUF-AQKD), which avoids the necessity for authenticated classical channels and is useful in mitigating MITM attacks. The fundamental concept of PUF-AQKD is to implement a phase shift in the basis used for polarizing the transmitted qubits. The phase shift is dictated by PUFs, which are anticipated to result in analogous (correlated) responses for devices manufactured under similar conditions but dissimilar responses in different conditions. An adversary lacking a correlated PUF response shared by Alice and Bob would inadvertently increase the Quantum Bit Error Rates (QBER) observed at Bob’s end. We present a mathematical model to assess the efficacy of the proposed PUF-AQKD method and perform simulations utilizing the NetSquid simulator. The mathematical analysis and simulation findings indicate that PUF-AQKD can efficiently identify eavesdroppers, even during incomplete measurements, without the necessity of an authorized classical channel.
- 30 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 4923-4942
Open AccessPUF-AQKD: A Hardware-Assisted Quantum Key Distribution Protocol for Man-in-the-Middle Attack Mitigation
The Quantum Key Distribution (QKD) protocol utilizes quantum mechanics principles for cryptographic key exchange, ensuring absolute secrecy. Current QKD techniques are susceptible to man-in-the-middle (MITM) attacks due to the absence of an inherent mechanism for identity verification within the quantum channel. For authentication, these systems rely on classical or post-quantum cryptography, which diminishes the perfect security advantage provided by QKD. We present a Physical Unclonable Function (PUF)-based authenticated QKD protocol (PUF-AQKD), which avoids the necessity for authenticated classical channels and is useful in mitigating MITM attacks. The fundamental concept of PUF-AQKD is to implement a phase shift in the basis used for polarizing the transmitted qubits. The phase shift is dictated by PUFs, which are anticipated to result in analogous (correlated) responses for devices manufactured under similar conditions but dissimilar responses in different conditions. An adversary lacking a correlated PUF response shared by Alice and Bob would inadvertently increase the Quantum Bit Error Rates (QBER) observed at Bob’s end. We present a mathematical model to assess the efficacy of the proposed PUF-AQKD method and perform simulations utilizing the NetSquid simulator. The mathematical analysis and simulation findings indicate that PUF-AQKD can efficiently identify eavesdroppers, even during incomplete measurements, without the necessity of an authorized classical channel.
- Open Access
- 15 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 86413-86429
Bayesian Deep Learning Meets Self-Attention: A Risk-Aware Approach to Advertisement Optimization
In the highly competitive landscape of e-commerce advertising, maximizing Return on Advertising Spend (ROAS) is critical, yet remains inherently uncertain due to auction-based bidding dynamics and fluctuating market conditions. Traditional deterministic models fail to capture this uncertainty, necessitating a probabilistic approach that balances predictive accuracy with interpretability. To address this challenge, the paper proposes a novel Hierarchical Bayesian Deep Learning framework that integrates a Bayesian Belief Network (BBN) for structured probabilistic reasoning and a Mixture Density Network (MDN) for full distributional modeling of ROAS. The BBN models dependencies among campaign variables, offering interpretable insights, while the hierarchical deep learning architecture overcomes scalability limitations in high-dimensional settings through self-attention mechanisms. Experiments demonstrate up to 22.8% lower RMSE and 27.4% better Negative Log Likelihood (NLL) and up to 31.2% lower Kullback-Leibler divergence (KLD) than state-of-the-art methods (DeepAR, Prophet, NGBoost), achieving an R² of 98% with an inference speed of 5.2 ms per campaign, making real-time bidding feasible. Ablation studies confirm that attention-driven feature selection and calibrated uncertainty quantification significantly enhance both predictive performance and explainability, identifying key drivers of campaign success. By providing precise, uncertainty-aware, and explainable predictions, this approach enables adaptive bidding strategies, optimized budget allocation, and risk management, setting a new benchmark for intelligent decision-making in digital advertising.
- 15 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 13, 86413-86429
Open AccessBayesian Deep Learning Meets Self-Attention: A Risk-Aware Approach to Advertisement Optimization
In the highly competitive landscape of e-commerce advertising, maximizing Return on Advertising Spend (ROAS) is critical, yet remains inherently uncertain due to auction-based bidding dynamics and fluctuating market conditions. Traditional deterministic models fail to capture this uncertainty, necessitating a probabilistic approach that balances predictive accuracy with interpretability. To address this challenge, the paper proposes a novel Hierarchical Bayesian Deep Learning framework that integrates a Bayesian Belief Network (BBN) for structured probabilistic reasoning and a Mixture Density Network (MDN) for full distributional modeling of ROAS. The BBN models dependencies among campaign variables, offering interpretable insights, while the hierarchical deep learning architecture overcomes scalability limitations in high-dimensional settings through self-attention mechanisms. Experiments demonstrate up to 22.8% lower RMSE and 27.4% better Negative Log Likelihood (NLL) and up to 31.2% lower Kullback-Leibler divergence (KLD) than state-of-the-art methods (DeepAR, Prophet, NGBoost), achieving an R² of 98% with an inference speed of 5.2 ms per campaign, making real-time bidding feasible. Ablation studies confirm that attention-driven feature selection and calibrated uncertainty quantification significantly enhance both predictive performance and explainability, identifying key drivers of campaign success. By providing precise, uncertainty-aware, and explainable predictions, this approach enables adaptive bidding strategies, optimized budget allocation, and risk management, setting a new benchmark for intelligent decision-making in digital advertising.
- Open Access
- 29 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Computer Society
- Vol. 6, 586-598
Sybil-Resilient Publisher Selection Mechanism in Blockchain-Based MCS Systems
In Blockchain-based Mobile CrowdSensing (BMCS) systems, publishers (data collectors) can exploit the ability to create multiple blockchain identities, enabling Sybil attacks. Selfish, malicious, and collusive Sybil behaviors undermine both reward and majority-based data validation mechanisms, discouraging honest participation and threatening system integrity. Existing solutions often fail to address these issues, particularly in environments dominated by selfish or malicious publishers. This paper proposes a novel two-phase publisher selection mechanism to mitigate Sybil attacks in BMCS systems. Phase-I employs a modified Proof-of-Stake (PoS) mechanism with carefully calibrated parameters, including staked amount, coinage, reputation, and randomness. The strategic combination of staked amount and coinage increases the difficulty of Sybil attacks as the system scales over time. Phase-II introduces a lightweight, reputation-based Proof-of-Work (PoW) mechanism tailored for Mobile CrowdSensing (MCS) environments, where puzzle difficulty adjusts dynamically based on the publisher's reputation. Reputation and penalization mechanisms are central to the proposed mechanism, ensuring robust prevention of task domination, selfish behavior, and malicious activities while fostering honest participation. Comprehensive on-chain and off-chain simulations demonstrate the proposed mechanism's effectiveness in mitigating Sybil attacks, reducing their impact, and promoting fair participation.
- 29 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Computer Society
- Vol. 6, 586-598
Open AccessSybil-Resilient Publisher Selection Mechanism in Blockchain-Based MCS Systems
In Blockchain-based Mobile CrowdSensing (BMCS) systems, publishers (data collectors) can exploit the ability to create multiple blockchain identities, enabling Sybil attacks. Selfish, malicious, and collusive Sybil behaviors undermine both reward and majority-based data validation mechanisms, discouraging honest participation and threatening system integrity. Existing solutions often fail to address these issues, particularly in environments dominated by selfish or malicious publishers. This paper proposes a novel two-phase publisher selection mechanism to mitigate Sybil attacks in BMCS systems. Phase-I employs a modified Proof-of-Stake (PoS) mechanism with carefully calibrated parameters, including staked amount, coinage, reputation, and randomness. The strategic combination of staked amount and coinage increases the difficulty of Sybil attacks as the system scales over time. Phase-II introduces a lightweight, reputation-based Proof-of-Work (PoW) mechanism tailored for Mobile CrowdSensing (MCS) environments, where puzzle difficulty adjusts dynamically based on the publisher's reputation. Reputation and penalization mechanisms are central to the proposed mechanism, ensuring robust prevention of task domination, selfish behavior, and malicious activities while fostering honest participation. Comprehensive on-chain and off-chain simulations demonstrate the proposed mechanism's effectiveness in mitigating Sybil attacks, reducing their impact, and promoting fair participation.