Ghanshyam S. Bopche
Research Subjects
Ghanshyam S. Bopche has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Gopal N. Rai
Collins Aerospace India (Pvt.) Limited,Hyderabad,India
4 shared publications - Nilin Prabhaker
National Institute of Technology
3 shared publications B. M. Mehtre
Centre of Excellence in Cyber Security, IDRBT
2 shared publications- B. M. Mehtre
IDRBT
2 shared publications - B. Ramachandra Reddy
National Institute of Technology Jamshedpur
2 shared publications Babu M. Mehtre
2 shared publications
Latest Publications
- 28 September 2026
- Published by Elsevier in Computers & Security
- Vol. 172
Enhancing cyber fraud awareness through identity-constrained AI-generated multi-panel comics
- 28 September 2026
- Published by Elsevier in Computers & Security
- Vol. 172
Enhancing cyber fraud awareness through identity-constrained AI-generated multi-panel comics
- 23 May 2025
- Published by Springer Nature
- p. 79-93
Generation of Believable Fake Integral Equations for Cyber Deception
- 23 May 2025
- Published by Springer Nature
- p. 79-93
Generation of Believable Fake Integral Equations for Cyber Deception
- 10 August 2024
- Published by Elsevier in Computers & Security
- Vol. 146
Generation and deployment of honeytokens in relational databases for cyber deception
- 10 August 2024
- Published by Elsevier in Computers & Security
- Vol. 146
Generation and deployment of honeytokens in relational databases for cyber deception
- 30 January 2024
- Published by Springer Nature
- p. 325-340
Classification of Images Extracted from Scientific Documents for Cyber Deception
- 30 January 2024
- Published by Springer Nature
- p. 325-340
Classification of Images Extracted from Scientific Documents for Cyber Deception
- 3 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 31-36
Boolean Similarity Measure for Assessing Temporal Variation in the Network Attack Surface
The network security assessment is vital for improving the overall security posture. With diverse opportunities for using networking devices and configuring them, varying software application portfolios, and the increased flexibility of using numerous applications, today's computer networks are subject to continuous evolution. Such ever-growing computer networks in size and complexity lead to information exposure to an increased threat landscape and attack surface variation. The network attack surface constitutes exploitable technical vulnerabilities, software/hardware misconfigurations (i.e., configuration gaps), vulnerable service connectivities, and service-cum-user privileges. An adversary may exploit the network attack surface to penetrate the enterprise networks incrementally. The discovery of new vulnerabilities and vague access control rules can further set off the attack surface variation. Hence, it is essential to consider the temporal aspect of network security. Attack graph, a graphical network security modeling tool, succinctly captures the attack surface of a vulnerable network in the form of initial security conditions, much needed for an adversary for successful incremental network penetration. Existing attack graph-based metrics are inadequate in capturing the variation in the attack surface. We propose to use a Boolean similarity metric to assess the similarity between the goal-oriented attack graphs generated successively for an enterprise network within the chosen sampling interval. We represent individual attack graphs as a Boolean expression to serve our purpose. A Boolean expression is a sum-of-product expression, i.e., a disjunction of attack paths, each a conjunction of initial conditions. We have conducted a set of experiments to validate the efficacy and applicability of the Boolean similarity metric. The results indicate that the Boolean similarity measure can detect the variation in the network attack surface.
- 3 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 31-36
Boolean Similarity Measure for Assessing Temporal Variation in the Network Attack Surface
The network security assessment is vital for improving the overall security posture. With diverse opportunities for using networking devices and configuring them, varying software application portfolios, and the increased flexibility of using numerous applications, today's computer networks are subject to continuous evolution. Such ever-growing computer networks in size and complexity lead to information exposure to an increased threat landscape and attack surface variation. The network attack surface constitutes exploitable technical vulnerabilities, software/hardware misconfigurations (i.e., configuration gaps), vulnerable service connectivities, and service-cum-user privileges. An adversary may exploit the network attack surface to penetrate the enterprise networks incrementally. The discovery of new vulnerabilities and vague access control rules can further set off the attack surface variation. Hence, it is essential to consider the temporal aspect of network security. Attack graph, a graphical network security modeling tool, succinctly captures the attack surface of a vulnerable network in the form of initial security conditions, much needed for an adversary for successful incremental network penetration. Existing attack graph-based metrics are inadequate in capturing the variation in the attack surface. We propose to use a Boolean similarity metric to assess the similarity between the goal-oriented attack graphs generated successively for an enterprise network within the chosen sampling interval. We represent individual attack graphs as a Boolean expression to serve our purpose. A Boolean expression is a sum-of-product expression, i.e., a disjunction of attack paths, each a conjunction of initial conditions. We have conducted a set of experiments to validate the efficacy and applicability of the Boolean similarity metric. The results indicate that the Boolean similarity measure can detect the variation in the network attack surface.
- 3 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 48-53
RcAMA - An Recursive Composition Algebra-based Framework for Detection of Multistage Attacks
The extensive use of information and communication technology in government and private organizations brings new security vulnerabilities. These vulnerabilities provide multiple opportunities for adversaries to compromise organizations' business-critical resources. Nowadays, new types of sophisticated Cyberattacks, namely “multistage attacks” keep increasing in sophistication and number. Essentially, the adversary chains together multiple vulnerabilities and exploits them to obtain incremental access to the network resources. In practice, mitigating all the identified vulnerabilities, even for a moderate-sized network, is impractical for the security administrator. Existing vulnerability scanners do not consider the causal dependency between the identified vulnerabilities. Moreover, most vulnerabilities reported by scanners are not exploitable because of the absence of enabling condition(s). Therefore, the administrators' absolute reliance on vulnerability scanners makes the vulnerability patching process ineffective. Attack graph, a popular graphical network security model, depicts potential multistage, multi-host attacks for a vulnerable network configuration and thereby helps the administrator harden the network effectively. We propose a framework based on recursive composition algebra to explore the additional advantages of using an attack graph for proactive network hardening. The algebra generates an attack graph (free from attack cycles) for a vulnerable network configuration. Moreover, the proposed framework classifies the identified vulnerabilities. The vulnerability classes help the administrator prioritize the network hardening activities. We have validated the effectiveness and applicability of our framework through a case study.
- 3 January 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 48-53
RcAMA - An Recursive Composition Algebra-based Framework for Detection of Multistage Attacks
The extensive use of information and communication technology in government and private organizations brings new security vulnerabilities. These vulnerabilities provide multiple opportunities for adversaries to compromise organizations' business-critical resources. Nowadays, new types of sophisticated Cyberattacks, namely “multistage attacks” keep increasing in sophistication and number. Essentially, the adversary chains together multiple vulnerabilities and exploits them to obtain incremental access to the network resources. In practice, mitigating all the identified vulnerabilities, even for a moderate-sized network, is impractical for the security administrator. Existing vulnerability scanners do not consider the causal dependency between the identified vulnerabilities. Moreover, most vulnerabilities reported by scanners are not exploitable because of the absence of enabling condition(s). Therefore, the administrators' absolute reliance on vulnerability scanners makes the vulnerability patching process ineffective. Attack graph, a popular graphical network security model, depicts potential multistage, multi-host attacks for a vulnerable network configuration and thereby helps the administrator harden the network effectively. We propose a framework based on recursive composition algebra to explore the additional advantages of using an attack graph for proactive network hardening. The algebra generates an attack graph (free from attack cycles) for a vulnerable network configuration. Moreover, the proposed framework classifies the identified vulnerabilities. The vulnerability classes help the administrator prioritize the network hardening activities. We have validated the effectiveness and applicability of our framework through a case study.
- 1 October 2021
- Published by Springer Nature in Wireless Personal Communications
- Vol. 123 (1) , 785-812
Credit Scoring Models Using Ensemble Learning and Classification Approaches: A Comprehensive Survey
- 1 October 2021
- Published by Springer Nature in Wireless Personal Communications
- Vol. 123 (1) , 785-812
Credit Scoring Models Using Ensemble Learning and Classification Approaches: A Comprehensive Survey
- 26 April 2020
- Published by Springer Nature in Communications in Computer and Information Science
- p. 41-59
A Proximity-Based Measure for Quantifying the Risk of Vulnerabilities
- 26 April 2020
- Published by Springer Nature in Communications in Computer and Information Science
- p. 41-59
A Proximity-Based Measure for Quantifying the Risk of Vulnerabilities
- 3 December 2019
- Published by Springer Nature
- p. 324-344
Differential Attack Graph-Based Approach for Assessing Change in the Network Attack Surface
- 3 December 2019
- Published by Springer Nature
- p. 324-344
Differential Attack Graph-Based Approach for Assessing Change in the Network Attack Surface
- 24 January 2019
- Published by Springer Nature
- p. 53-66
Inter-path Diversity Metrics for Increasing Networks Robustness Against Zero-Day Attacks
- 24 January 2019
- Published by Springer Nature
- p. 53-66
Inter-path Diversity Metrics for Increasing Networks Robustness Against Zero-Day Attacks