NDLI: Extending logical attack graphs for efficient vulnerability analysis

Please wait, while we are loading the content...

The good, the bad, and the provable

Spamalytics: an empirical analysis of spam marketing conversion

Efficient and extensible security enforcement using dynamic data flow analysis

Robust defenses for cross-site request forgery

Computational soundness of observational equivalence

Building castles out of mud: practical access pattern privacy and correctness on untrusted storage

Verifiable functional purity in java

Mitigating DNS DoS attacks

Enforcing authorization policies using transactional memory introspection

FairplayMP: a system for secure multi-party computation

A formal framework for reflective database access control policies

Dependent link padding algorithms for low latency anonymity systems

Type-checking zero-knowledge

Tupni: automatic reverse engineering of input formats

Identity-based encryption with efficient revocation

Authenticated hash tables

Reconsidering physical key secrecy: teleduplication via optical decoding

Traitor tracing with constant size ciphertext

Machine learning attacks against the Asirra CAPTCHA

Code injection attacks on harvard-architecture devices

Ether: malware analysis via hardware virtualization extensions

SOMA: mutual approval for included content in web pages

Unbounded verification, falsification, and characterization of security protocols by pattern refinement

Location privacy of distance bounding protocols

Trust management for secure information flows

Revocation games in ephemeral networks

Towards practical biometric key generation with randomized biometric templates

Information leaks in structured peer-to-peer anonymous communication systems

A class of probabilistic models for role engineering

PEREA: towards practical TTP-free revocation in anonymous authentication

Towards automated proofs for asymmetric encryption schemes in the random oracle model

Rootkit-resistant disks

Black-box accountable authority identity-based encryption

Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma

RFIDs and secret handshakes: defending against ghost-and-leech attacks and unauthorized reads with context-aware communications

Multi-use unidirectional proxy re-signatures

A low-cost attack on a Microsoft captcha

When good instructions go bad: generalizing return-oriented programming to RISC

Extending logical attack graphs for efficient vulnerability analysis

OMash: enabling secure web mashups via object abstractions

Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach

Increased DNS forgery resistance through 0x20-bit encoding: security via leet queries

Towards automatic reverse engineering of software security configurations

Privacy oracle: a system for finding application leaks with black box differential testing

Assessing query privileges via safe and efficient permission composition

Efficient attributes for anonymous credentials

EON: modeling and analyzing dynamic access control systems with logic programs

Cryptographically verified implementations for TLS

Constructions of truly practical secure protocols using standardsmartcards

Efficient security primitives derived from a secure aggregation algorithm

BootJacker: compromising computers using forced restarts

A look in the mirror: attacks on package managers

Extending logical attack graphs for efficient vulnerability analysis

Content Provider	ACM Digital Library
Author	Saha, Diptikalyan
Abstract	Attack graph illustrates all possible multi-stage, multi-host attacks in an enterprise network and is essential for vulnerability analysis tools. Recently, researchers have addressed the problem of scalable generation of attack graph by logical formulation of vulnerability analysis in an existing framework called MulVAL. In this paper, we take a step further to make attack graph-based vulnerability analysis useful and practical for real networks. Firstly, we extend the MulVAL framework to include more complex security policies existing in advanced operating systems. Secondly, we present an expressive view of the attack graph by including negation in the logical characterization, and we present an algorithm to generate it. Finally, we present an incremental algorithm which efficiently recomputes the attack graph in response to the changes in the inputs of the vulnerability analysis framework. This is particularly useful for mutation or "what-if" analysis, where network administrators want to view the effect of network or host parameter changes to the attack graph before pushing the changes on the network. Preliminary experiments demonstrate the effectiveness of our algorithms.
Starting Page	63
Ending Page	74
Page Count	12
File Format	PDF
ISBN	9781595938107
DOI	10.1145/1455770.1455780
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2008-10-27
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Incremental analysis Logic programming Attack graphs
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Extending logical attack graphs for efficient vulnerability analysis.

Boosting Logical Attack Graph for Efficient Security Control

A Simplified Model for Attack Paths Construction in Multiple Hosts

Quick Incremental Routing Logic for Dynamic Network Graphs

Scalable Attack Graph Generation

Metrics suite for network attack graph analytics

A Scalable Approach to Attack Graph Generation (2006)

Toward measuring network security using attack graphs

Managing attack graph complexity through visual hierarchical aggregation

Extending logical attack graphs for efficient vulnerability analysis

Similar Documents

Extending logical attack graphs for efficient vulnerability analysis.

Boosting Logical Attack Graph for Efficient Security Control

A Simplified Model for Attack Paths Construction in Multiple Hosts

Quick Incremental Routing Logic for Dynamic Network Graphs

Scalable Attack Graph Generation

Metrics suite for network attack graph analytics

A Scalable Approach to Attack Graph Generation (2006)

Toward measuring network security using attack graphs

Managing attack graph complexity through visual hierarchical aggregation

Extending logical attack graphs for efficient vulnerability analysis