Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rajeev Gopalakrishna

dblp:55/2981 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Network security · 100%
Software engineering, system software, and programming languages
1 paper
Program analysis · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network security › intrusion detection and prevention › intrusion detection › intrusion detection system
host-based intrusion detection
0.112005
Efficient Intrusion Detection using Automaton Inlining · S&P 2005
Program analysis
static analysis
0.112005
Efficient Intrusion Detection using Automaton Inlining · S&P 2005
Network security › intrusion detection and prevention › intrusion detection
anomaly detection
0.012005
Efficient Intrusion Detection using Automaton Inlining · S&P 2005
Network security › intrusion detection and prevention
intrusion detection
0.012005
Efficient Intrusion Detection using Automaton Inlining · S&P 2005

Methods — techniques the papers use, named apart from their topics

static analysis · 0.1automaton inlining · 0.1
YearPublicationVenuePosition
2005 Efficient Intrusion Detection using Automaton Inlining
abstract
Host-based intrusion detection systems attempt to identify attacks by discovering program behaviors that deviate from expected patterns. While the idea of performing behavior validation on-the-fly and terminating errant tasks as soon as a violation is detected is appealing, existing systems exhibit serious shortcomings in terms of accuracy and/or efficiency. To gain acceptance, a number of technical advances are needed. In this paper we focus on automated, conservative, intrusion detection techniques, i.e. techniques which do not require human intervention and do not suffer from false positives. We present a static analysis algorithm for constructing a flow- and context-sensitive model of a program that allows for efficient online validation. Context-sensitivity is essential to reduce the number of impossible control-flow paths accepted by the intrusion detection system because such paths provide opportunities for attackers to evade detection. An important consideration for on-the-fly intrusion detection is to reduce the performance overhead caused by monitoring. Compared to the existing approaches, our inlined automaton model (IAM) presents a good tradeoff between accuracy and performance. On a 32K line program, the monitoring overhead is negligible. While the space requirements of a naive IAM implementation can be quite high, compaction techniques can be employed to substantially reduce that footprint.
Rajeev Gopalakrishna, Eugene H. Spafford, Jan Vitek
S&P1
2003 Poly2 Paradigm: A Secure Network Service Architecture
abstract
General-purpose operating systems provide a rich computing environment both to the user and the attacker. The declining cost of hardware and the growing security concerns of software necessitate a revalidation of the many assumptions made in network service architectures. Enforcing sound design principles while retaining usability and flexibility is key to practical security. Poly/sup 2/ is an approach to build a hardened framework for network services from commodity hardware and software. Guided by well-known security design principles such as least common mechanism and economy of mechanism, and driven by goals such as psychological acceptability and immediate usability, Poly/sup 2/ provides a secure platform for network services. It also serves as a testbed for several security-related research areas such as intrusion detection, forensics, and high availability. This paper discusses the overall design and philosophy of Poly/sup 2/, presents an initial implementation, and outlines future work.
Eric Bryant, James P. Early, Rajeev Gopalakrishna, Gregory Roth, Eugene H. Spafford, Keith Watson, Scott Yost
ACSAC3
2002 Digging For Worms, Fishing For Answers
abstract
Worms continue to be a leading security threat on the Internet. This paper analyzes several of the more widespread worms and develops a general life-cycle for them. The lifecycle, from the point of view of the victim host, consists of four stages: target selection, exploitation, infection, and propagation. While not all worms fall into this framework perfectly, by understanding them in this way, it becomes apparent that the majority of detection techniques used today focus on the first three stages. This paper presents a technique that is used in the fourth stage to detect the class of worms that use a horizontal scan to propagate. An argument is also made that detection in the fourth stage is a viable, but under-used technique.
Florian P. Buchholz, Thomas Daniels 0001, James P. Early, Rajeev Gopalakrishna, R. Patrick Gorman, Benjamin A. Kuperman, Sofie Nystrom, Addam Schroll
ACSAC4