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

Srinivas Krishnan

dblp:70/204 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
0since 2021 · last 2018
—ORCID · none

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

Security and privacy · 6 · 4 first-authorSystems, architecture and hardware · 2 · 2 first-authorComputer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
4 papers
Digital forensics and information hiding · 50% Systems and software security · 44% Network security · 6%
Computer networks
3 papers
Datacenter networks · 58% Network measurement and analytics · 29% Content delivery and video streaming · 13%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › virtualization
network virtualization
0.312018
Andromeda: Performance, Isolation, and Velocity at Scale in Cloud Network Virtualization · NSDI 2018
Digital forensics and information hiding
digital forensics
0.322012
Trail of Bytes: New Techniques for Supporting Data Provenance and Limiting Privacy Breaches · IEEE Trans. Inf. Forensics Secur. 2012
Trail of bytes: efficient support for forensic analysis · CCS 2010
Network measurement and analytics
traffic classification
0.212013
Clear and Present Data: Opaque Traffic and its Security Implications for the Future · NDSS 2013
Systems and software security › security policy enforcement
data exfiltration prevention
0.112012
Trail of Bytes: New Techniques for Supporting Data Provenance and Limiting Privacy Breaches · IEEE Trans. Inf. Forensics Secur. 2012
Digital forensics and information hiding
data provenance
0.112012
Trail of Bytes: New Techniques for Supporting Data Provenance and Limiting Privacy Breaches · IEEE Trans. Inf. Forensics Secur. 2012
Systems and software security › exploitation › injection attacks
code injection attack
0.112011
SHELLOS: Enabling Fast Detection and Forensic Analysis of Code Injection Attacks · USENIX Security Symposium 2011
Systems and software security › system auditing
audit logs
0.112010
Trail of bytes: efficient support for forensic analysis · CCS 2010
Content delivery and video streaming › content adaptation
video adaptation
0.112007
A utility-driven framework for loss and encoding aware video adaptation · ACM Multimedia 2007
Network security
traffic analysis
0.012013
Clear and Present Data: Opaque Traffic and its Security Implications for the Future · NDSS 2013
Digital forensics and information hiding › digital forensics
forensic analysis
0.012011
SHELLOS: Enabling Fast Detection and Forensic Analysis of Code Injection Attacks · USENIX Security Symposium 2011
Operating systems
virtualization
0.012010
Trail of bytes: efficient support for forensic analysis · CCS 2010
Virtual and augmented reality › telepresence
3d telepresence
0.012007
A utility-driven framework for loss and encoding aware video adaptation · ACM Multimedia 2007

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

causal chain analysis · 0.2utility modeling · 0.1tamper-evident audit log · 0.1retransmission · 0.1hypervisor-based monitoring · 0.1differential encoding · 0.1
YearPublicationVenuePosition
2018 Andromeda: Performance, Isolation, and Velocity at Scale in Cloud Network Virtualization
Michael Dalton, David Schultz, Jacob Adriaens, Ahsan Arefin, Anshuman Gupta, Brian Fahs, Dima Rubinstein, Enrique Cauich Zermeno, Erik Rubow, James Alexander Docauer, Jesse Alpert, Jing Ai, Jon Olson, Kevin DeCabooter, Marc de Kruijf, Nan Hua, Nathan Lewis, Nikhil Kasinadhuni, Riccardo Crepaldi, Srinivas Krishnan, Subbaiah Venkata, Yossi Richter, Uday Naik, Amin Vahdat
NSDI20
2013 Crossing the threshold: Detecting network malfeasance via sequential hypothesis testing
abstract
The domain name system plays a vital role in the dependability and security of modern network. Unfortunately, it has also been widely misused for nefarious activities. Recently, attackers have turned their attention to the use of algorithmically generated domain names (AGDs) in an effort to circumvent network defenses. However, because such domain names are increasingly being used in benign applications, this transition has significant implications for techniques that classify AGDs based solely on the format of a domain name. To highlight the challenges they face, we examine contemporary approaches and demonstrate their limitations. We address these shortcomings by proposing an online form of sequential hypothesis testing that classifies clients based solely on the non-existent (NX) responses they elicit. Our evaluations on real-world data show that we outperform existing approaches, and for the vast majority of cases, we detect malware before they are able to successfully rendezvous with their command and control centers.
Srinivas Krishnan, Teryl Taylor, Fabian Monrose, John McHugh
DSN1
2013 Clear and Present Data: Opaque Traffic and its Security Implications for the Future
Andrew M. White 0002, Srinivas Krishnan, Michael D. Bailey, Fabian Monrose, Phillip A. Porras
NDSS2
2012 Trail of Bytes: New Techniques for Supporting Data Provenance and Limiting Privacy Breaches
abstract
Forensic analysis of computer systems requires that one first identify suspicious objects or events, and then examine them in enough detail to form a hypothesis as to their cause and effect. Sadly, while our ability to gather vast amounts of data has improved significantly over the past two decades, it is all too often the case that we lack detailed information just when we need it the most. In this paper, we attempt to improve on the state of the art by providing a forensic platform that transparently monitors and records data access events within a virtualized environment using only the abstractions exposed by the hypervisor. Our approach monitors accesses to objects on disk and follows the causal chain of these accesses across processes, even after the objects are copied into memory. Our forensic layer records these transactions in a tamper evident version-based audit log that allows for faithful, and efficient, reconstruction of the recorded events and the changes they induced. To demonstrate the utility of our approach, we provide an extensive empirical evaluation, including a real-world case study demonstrating how our platform can be used to reconstruct valuable information about the what, when, and how, after a compromise has been detected. We also extend our earlier work by providing a tracking mechanism that can monitor data exfiltration attempts across multiple disks and also block attempts to copy data over the network.
Srinivas Krishnan, Kevin Z. Snow, Fabian Monrose
IEEE Trans. Inf. Forensics Secur.1
2011 An empirical study of the performance, security and privacy implications of domain name prefetching
abstract
An increasingly popular technique for decreasing user-perceived latency while browsing the Web is to optimistically pre-resolve (or prefetch) domain name resolutions. In this paper, we present a large-scale evaluation of this practice using data collected over the span of several months, and show that it leads to noticeable increases in load on name servers-with questionable caching benefits. Furthermore, to assess the impact that prefetching can have on the deployment of security extensions to DNS (DNSSEC), we use a custom-built cache simulator to perform trace-based simulations using millions of DNS requests and responses collected campus-wide. We also show that the adoption of domain name prefetching raises privacy issues. Specifically, we examine how prefetching amplifies information disclosure attacks to the point where it is possible to infer the context of searches issued by clients.
Srinivas Krishnan, Fabian Monrose
DSN1
2011 SHELLOS: Enabling Fast Detection and Forensic Analysis of Code Injection Attacks
Kevin Z. Snow, Srinivas Krishnan, Fabian Monrose, Niels Provos
USENIX Security Symposium2
2010 Trail of bytes: efficient support for forensic analysis
abstract
For the most part, forensic analysis of computer systems requires that one first identify suspicious objects or events, and then examine them in enough detail to form a hypothesis as to their cause and effect. Sadly, while our ability to gather vast amounts of data has improved significantly over the past two decades, it is all too often the case that we tend to lack detailed information just when we need it the most. Simply put, the current state of computer forensics leaves much to be desired. In this paper, we attempt to improve on the state of the art by providing a forensic platform that transparently monitors and records data access events within a virtualized environment using only the abstractions exposed by the hypervisor. Our approach monitors accesses to objects on disk and follows the causal chain of these accesses across processes, even after the objects are copied into memory. Our forensic layer records these transactions in a version-based audit log that allows for faithful, and efficient, reconstruction of the recorded events and the changes they induced. To demonstrate the utility of our approach, we provide an extensive empirical evaluation, including a real-world case study demonstrating how our platform can be used to reconstruct valuable information about the what, when, and how, after a compromised has been detected.
Srinivas Krishnan, Kevin Z. Snow, Fabian Monrose
CCS1
2007 A utility-driven framework for loss and encoding aware video adaptation
abstract
We present a framework for multidimensional utility-driven adaptation for multi-stream video applications. A notable driving application is 3D tele-immersion. Our framework directly models the utility of video frames as well as representation dependencies that arise from differential encoding. The problem of evaluating past and future data utility in the presence of packet loss is specifically addressed and two possible approaches are described. One relies on reliability semantics of the underlying transport-level protocol in order to optimize encoding relationships. The other folds the decision to retransmit packets known to be lost into the utility framework. We quantitatively demonstrate the ability of both approaches to increase performance of a prototype application and show that the second approach is generally superior.
Srinivas Krishnan, Ketan Mayer-Patel
ACM Multimedia1