Learn More
This paper proposes a new intelligent transportation system (ITS) that uses not only integrated cellular and wireless multihop relaying technologies but vehicles’ mobility profiles to provide quality yet affordable services as well. It focuses on a subsystem where cellular bandwidth is mostly used for control signals, and a wireless mesh network called ad(More)
Capability acquisition graphs (CAGs) provide a powerful framework for modeling insider threats, network attacks and system vulnerabilities. However, CAG-based security modeling systems have yet to be deployed in practice. This paper demonstrates the feasibility of applying CAGs to insider threat analysis. In particular, it describes the design and operation(More)
1389-1286/$ see front matter Published by Elsevie doi:10.1016/j.comnet.2011.02.006 ⇑ Corresponding author. Tel.: +1 505 6670176; fa E-mail address: ghyan@lanl.gov (G. Yan). 1 Los Alamos National Laboratory Publication No. L 2 This work was done when Duc T. Ha was wo National Laboratory. Botnets have emerged as one of the most severe cyber-threats in recent(More)
Recently, peer-to-peer (P2P) networks have emerged as a covert communication platform for malicious programs known as bots. As popular distributed systems, they allow bots to communicate easily while protecting the botmaster from being discovered. Existing work on P2P-based botnets mainly focuses on measurement-based studies of botnet behaviors. In this(More)
Insider attacks constitute one of the most potent, yet difficult to detect threats to information security in the cyber-domain. Malicious actions perpetrated by privileged insiders usually circumvent intrusion detection systems (IDS) and other mechanisms designed to detect and prevent unauthorized activity. In this paper, we present an architectural(More)
Inspired by the Flash worm paper [1], we formulate and investigate the problem of finding a fast and resilient propagation topology and propagation schedule for Flash worms and similar malcodes. Resiliency means a very large proportion of infectable targets are still infected no matter which fraction of targets are not infectable. There is an intrinsic(More)
We study the hardness of approximation for the MINIMUM HACKING problem, which roughly can be described as the problem of finding the best way to compromise some target nodes given a few initial compromised nodes in a network. We give three reductions to show that MINIMUM HACKING is not approximable to within where , for any ! " $#% . In particular, the(More)
BACKGROUND The Rapid Emergency Medicine Score (REMS) and Worthing Physiological Scoring system (WPS) have been developed for predicting in-hospital mortality in nonsurgical emergency department (ED) patients. The prognostic performance of the scoring systems in independent populations has not been clear. The aim of the study is to evaluate the prognostic(More)
We show that it is possible to design botnet structures called CRESTBOT based on extractor graphs which are highly resilient to command-and-control (C&C) take-downs, yet do not require significant changes to existing botnet designs and codes, and do not suffer from the implementation complexity of P2P-based and hybrid structures. The UDP family of CRESTBOT(More)
We analyze crosstalk-free widesense nonblocking multicast multi-log networks. Widesense nonblocking strikes a balance between strictly nonblocking and rearrangeably nonblocking both in terms of cost-effectiveness and route establishment efficiency. The problem is important as cost-effective and efficient crosstalk-free multicast photonic switching networks(More)