DTDeepnarayan Tiwari

Deepnarayan Tiwari

*This is an algorithmically generated author record based on publicly available information.

Deepnarayan Tiwari has a total of 4 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Boolean Similarity Measure for Assessing Temporal Variation in the Network Attack Surface

    by Ghanshyam S. Bopche, Deepnarayan Tiwari, Gopal N. Rai

    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.


  • RcAMA - An Recursive Composition Algebra-based Framework for Detection of Multistage Attacks

    by Ghanshyam S. Bopche, Gopal N. Rai, Deepnarayan Tiwari

    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.


  • ACDAS: Authenticated controlled data access and sharing scheme for cloud storage

    by Deepnarayan Tiwari, Gayatri K Chaturvedi, G. R. Gangadharan

    Summary: Cloud storage services require cost‐effective, scalable, and self‐managed secure data management functionality. Public cloud storage always enforces users to adopt the restricted generic security consideration provided by the cloud service provider. On the contrary, private cloud storage gives users the opportunity to configure a self‐managed and controlled authenticated data security model to control the accessing and sharing of data in a private cloud. However, this introduces several new challenges to data security. One critical issue is how to enable a secure, authenticated data storage model for data access with controlled data accessibility. In this paper, we propose an authenticated controlled data access and sharing scheme called ACDAS to address this issue. In our proposed scheme, we employ a biometric‐based authentication model for secure access to data storage and sharing. To provide flexible data sharing under the control of a data owner, we propose a variant of a proxy reencryption scheme where the cloud server uses a proxy reencryption key and the data owner generates a credential token during decryption to control the accessibility of the users. The security analysis shows that our proposed scheme is resistant to various attacks, including a stolen verifier attack, a replay attack, a password guessing attack, and a stolen mobile device attack. Further, our proposed scheme satisfies the considered security requirements of a data storage and sharing system. The experimental results demonstrate that ACDAS can achieve the security goals together with the practical efficiency of storage, computation, and communication compared with other related schemes.


  • SecCloudSharing: Secure data sharing in public cloud using ciphertext‐policy attribute‐based proxy re‐encryption with revocation

    by Deepnarayan Tiwari, G. R. Gangadharan

    Summary: An efficient cryptography mechanism should enforce an access control policy over the encrypted data to provide flexible, fine‐grained, and secure data access control for secure sharing of data in cloud storage. To make a secure cloud data sharing solution, we propose a ciphertext‐policy attribute‐based proxy re‐encryption scheme. In the proposed scheme, we design an efficient fine‐grained revocation mechanism, which enables not only efficient attribute‐level revocation but also efficient policy‐level revocation to achieve backward secrecy and forward secrecy. Moreover, we use a multiauthority key attribute center in the key generation phase to overcome the single‐point performance bottleneck problem and the key escrow problem. By formal security analysis, we illustrate that our proposed scheme achieves confidentiality, secure key distribution, multiple collusions resistance, and policy‐ or attribute‐revocation security. By comprehensive performance and implementation analysis, we illustrate that our proposed scheme improves the practical efficiency of storage, computation cost, and communication cost compared to the other related schemes.