Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Jeff Rowe is active.

Publication


Featured researches published by Jeff Rowe.


security of ad hoc and sensor networks | 2003

A specification-based intrusion detection system for AODV

Chin-Yang Tseng; Poornima Balasubramanyam; Calvin Ko; Rattapon Limprasittiporn; Jeff Rowe; Karl N. Levitt

The Ad hoc On-Demand Distance Vector (AODV) routing protocol, designed for mobile ad hoc networks, offers quick adaptation to dynamic link conditions, low processing and memory overhead, and low network utilization. However, without keeping in mind the security issues in the protocol design, AODV is vulnerable to various kinds of attacks. This paper analyzes some of the vulnerabilities, specifically discussing attacks against AODV that manipulate the routing messages. We propose a solution based on specification-based intrusion detection to detect attacks on AODV. Briefly, our approach involves the use of finite state machines for specifying correct AODV routing behavior and distributed network monitors for detecting run-time violation of the specifications. In addition, one additional field in the protocol message is proposed to enable the monitoring. We illustrate that our algorithm, which employs a tree data structure, can effectively detect most of the serious attacks in real time and with minimum overhead.


workshop on rapid malcode | 2004

A hybrid quarantine defense

Phillip A. Porras; Linda Briesemeister; Keith Skinner; Karl N. Levitt; Jeff Rowe; Yu-Cheng Allen Ting

We study the strengths, weaknesses, and potential synergies of two complementary worm quarantine defense strategies under various worm attack profiles. We observe their abilities to delay or suppress infection growth rates under two propagation techniques and three scan rates, and explore the potential synergies in combining these two complementary quarantine strategies. We compare the performance of the individual strategies against a hybrid combination strategy, and conclude that the hybrid strategy yields substantial performance improvements, beyond what either technique provides independently. This result offers potential new directions in hybrid quarantine defenses.


IEEE Communications Magazine | 2015

Security vulnerabilities of connected vehicle streams and their impact on cooperative driving

Mani Amoozadeh; Arun Raghuramu; Chen-Nee Chuah; Dipak Ghosal; H. Michael Zhang; Jeff Rowe; Karl N. Levitt

Autonomous vehicles capable of navigating unpredictable real-world environments with little human feedback are a reality today. Such systems rely heavily on onboard sensors such as cameras, radar/LIDAR, and GPS as well as capabilities such as 3G/4G connectivity and V2V/V2I communication to make real-time maneuvering decisions. Autonomous vehicle control imposes very strict requirements on the security of the communication channels used by the vehicle to exchange information as well as the control logic that performs complex driving tasks such as adapting vehicle velocity or changing lanes. This study presents a first look at the effects of security attacks on the communication channel as well as sensor tampering of a connected vehicle stream equipped to achieve CACC. Our simulation results show that an insider attack can cause significant instability in the CACC vehicle stream. We also illustrate how different countermeasures, such as downgrading to ACC mode, could potentially be used to improve the security and safety of the connected vehicle streams.


recent advances in intrusion detection | 2001

System Health and Intrusion Monitoring Using a Hierarchy of Constraints

Calvin Ko; Paul Brutch; Jeff Rowe; Guy Tsafnat; Karl N. Levitt

This paper presents a new approach to run-time security monitoring that can detect system abnormalities including attacks, faults, or operational errors. The approach, System Health and Intrusion Monitoring (SHIM), employs a hierarchy of constraints to describe correct operation of a system at various levels of abstraction. The constraints capture static behavior, dynamic behavior, and time-critical behavior of a system. A system in execution will be monitored for violation of the constraints, which may indicate potential security problems in the system. SHIM is based on specification-based intrusion detection, but it attempts to provide a systematic framework for developing the specifications/ constraints. SHIM does not detect directly the intrusive actions in an attack, but their manifestations as violations of constraints. In this paper, we describe the constraint model and the methodology for developing the constraints. In addition, we present preliminary results on the constraints developed for host programs and network protocols. By bounding the behavior of various system components at different levels of abstraction, SHIM has a high chance of detecting different types of attacks and their variants.


acm special interest group on data communication | 2006

A distributed host-based worm detection system

Senthilkumar G. Cheetancheri; John Mark Agosta; Denver Dash; Karl N. Levitt; Jeff Rowe; Eve M. Schooler

We present a method for detecting large-scale worm attacks using only end-host detectors. These detectors propagate and aggregate alerts to cooperating partners to detect large-scale distributed attacks in progress. The properties of the host-based detectors may in fact be relatively poor in isolation but when taken collectively result in a high-quality distributed worm detector. We implement a cooperative alert sharing protocol coupled with distributed sequential hypothesis testing to generate global alarms about distributed attacks. We evaluate the systems response in the presence of a variety of false alarm conditions and in the presence of an Internet worm attack. Our evaluation is conducted with agents on the Emulab and DETER emulated testbeds using real operating systems and computing platforms.


Physics Letters B | 1992

Evidence for hard scattering of hadronic constituents of photons in photon-photon collisions of TRISTAN

R. Tanaka; T. Kojima; T. Sasaki; K. Tomioka; S. Matsumoto; Y. Oshi; K. Miyano; H. Miyata; P. Kirk; J. Lim; R.R. McNeil; S. S. Myung; C.P. Cheng; W.X. Gao; P. Gu; W.G. Yan; M.H. Ye; A. Abashian; K. Gotow; K.P. Hu; A.Z. Lai; E.H. Low; M. E. Mattson; L. E. Piilonen; K.L. Sterner; S. Lusin; C. Rosenfeld; A.T.M. Wang; S. Wilson; M. Frautschi

Abstract We present results of an experimental study of e + e − + hadrons in the kinematic regime for which the process is interpreted as hadron production in collisions of almost-real photons. The data sample corresponds to an integrated luminosity of 27.5 pb − and covers center-of-mass energies from 55 to 61.4 GeV. We observe more events than expected from the incoherent sum of quark-parton and vector-meson-dominance models, and we give a quantitative explanation of the excess by including the hard scattering of the hadronic constituents of the photons calculated with QCD.


recent advances in intrusion detection | 2003

Learning unknown attacks - a start

James E. Just; James C. Reynolds; Larry A. Clough; Melissa Danforth; Karl N. Levitt; Ryan Maglich; Jeff Rowe

Since it is essentially impossible to write large-scale software without errors, any intrusion tolerant system must be able to tolerate rapid, repeated unknown attacks without exhausting its redundancy. Our system provides continued application services to critical users while under attack with a goal of less than 25% degradation of productivity. Initial experimental results are promising. It is not yet a general open solution. Specification-based behavior sensors (allowable actions, objects, and QoS) detect attacks. The system learns unknown attacks by relying on two characteristics of network-accessible software faults: attacks that exploit them must be repeatable (at least in a probabilistic sense) and, if known, attacks can be stopped at component boundaries. Random rejuvenation limits the scope of undetected errors. The current system learns and blocks single-stage unknown attacks against a protected web server by searching and testing service history logs in a Sandbox after a successful attack. We also have an initial class-based attack generalization technique that stops web-server buffer overflow attacks. We are working to extend both techniques.


Physics Letters B | 1990

A measurement of the photon structure function F2

Takashi Sasaki; Y. Yamagishi; R. Tanaka; T. Kojima; S. Matsumoto; T. Yasuda; Y. Ishi; K. Miyano; H. Miyata; P. Kirk; J. Lim; R.R. McNeil; W. Metcalf; S. S. Myung; C.P. Cheng; P. Gu; M.H. Ye; Y.C. Zhu; A. Abashian; K. Gotow; K.P. Hu; A.Z. Lai; E.H. Low; M. E. Mattson; L. E. Piilonen; K.L. Sterner; Y.K. Li; S. Lusin; C. Rosenfeld; A.T.M. Wang

Abstract The photon structure function F2 has been measured at average Q2 values of 73,160 and 390 ( GeV c ) 2 . We compare the x dependence of the Q2 = 73 ( GeV c ) 2 data with theoretical expectations based on QCD. In addition we present results on the Q2 evolution of the structure function for the intermediate x range (0.3⩽ x ⩽0.8). The results are consistent with QCD.


Argument & Computation | 2014

Argument schemes for reasoning about trust

Simon Parsons; Katie Atkinson; Zimi Li; Peter McBurney; Elizabeth Sklar; Munindar P. Singh; Karen Zita Haigh; Karl N. Levitt; Jeff Rowe

Trust is a natural mechanism by which an autonomous party, an agent, can deal with the inherent uncertainty regarding the behaviours of other parties and the uncertainty in the information it shares with those parties. Trust is thus crucial in any decentralised system. This paper builds on recent efforts to use argumentation to reason about trust. Specifically, a set of schemes is provided, and abstract patterns of reasoning that apply in multiple situations geared towards trust. Schemes are described in which one agent, A, can establish arguments for trusting another agent, B, directly, as well as schemes that A can use to construct arguments for trusting C, where C is trusted by B. For both sets of schemes, a set of critical questions is offered that identify the situations in which these schemes can fail.


Physics Letters B | 1995

A high-Q2 measurement of the photon structure function F2γ

S.K. Sahu; S. Ebara; T. Nozaki; S. Behari; H. Fujimoto; S. Kobayashi; A. Murakami; M. Yang; S. Matsumoto; Kazuo Abe; Y. Fujii; Y. Kurihara; Melissa Lee; F. Liu; A. Maki; T. Omori; H. Sagawa; Y. Sakai; T. Sasaki; Y. Sugimoto; Y. Takaiwa; S. Terada; P. Kirk; T. Wang; A. Abashian; K. Gotow; M. E. Mattson; L. E. Piilonen; K.L. Sterner; S.-K. Choi

Abstract The photon structure function F 2 γ has been measured at average Q 2 values of 73 and 390 GeV 2 using data collected by the AMY detector at the TRISTAN e + e − collider. F 2 γ is observed to be increasing as ln Q 2 . The x -dependence of F 2 γ , where x is the momentum fraction carried by the parton inside the photon, is also measured. The measurements are compared with several parton density models.

Collaboration


Dive into the Jeff Rowe's collaboration.

Top Co-Authors

Avatar

Karl N. Levitt

University of California

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

P. Kirk

Louisiana State University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

C. Rosenfeld

University of South Carolina

View shared research outputs
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge