Demo Data from EDBT 2026 / reviewers in the wild / expert
Umesh Shankar
dblp:52/6554
· DBLP profile ↗
9ranked-venue papers
6as first author
0since 2021 · last 2007
0009-0003-1539-4428ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 8 · 5 first-authorComputer networks · 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
6 papers |
Privacy and data protection · 33% Web and mobile security · 26% Systems and software security · 25% | |
| Software engineering, system software, and programming languages
2 papers |
Program analysis · 38% Programming languages and type systems · 38% Program verification · 23% |
Topics — the 11 heaviest of 15, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Web and mobile security › browser security
same-origin policy |
0.1 | 1 | 2007 | Dynamic pharming attacks and locked same-origin policies for web browsers · CCS 2007 |
Privacy and data protection › web privacy
browser privacy |
0.1 | 1 | 2006 | Doppelganger: Better browser privacy without the bother · CCS 2006 |
Privacy and data protection › web tracking
cookie tracking |
0.1 | 1 | 2006 | Doppelganger: Better browser privacy without the bother · CCS 2006 |
Systems and software security › data integrity
data-flow integrity |
0.1 | 1 | 2006 | Toward Automated Information-Flow Integrity Verification for Security-Critical Applications · NDSS 2006 |
Privacy and data protection
web tracking |
0.1 | 1 | 2006 | Doppelganger: Better browser privacy without the bother · CCS 2006 |
Network security › intrusion detection and prevention
intrusion detection |
0.0 | 1 | 2003 | Active Mapping: Resisting NIDS Evasion without Altering Traffic · S&P 2003 |
Systems and software security
vulnerability discovery |
0.0 | 1 | 2001 | Detecting Format String Vulnerabilities with Type Qualifiers · USENIX Security Symposium 2001 |
Program analysis
static analysis |
0.0 | 1 | 2001 | Detecting Format String Vulnerabilities with Type Qualifiers · USENIX Security Symposium 2001 |
Programming languages and type systems › type systems › refinement types
type qualifiers |
0.0 | 1 | 2001 | Detecting Format String Vulnerabilities with Type Qualifiers · USENIX Security Symposium 2001 |
Program verification › security property verification
information flow verification |
0.0 | 1 | 2006 | Toward Automated Information-Flow Integrity Verification for Security-Critical Applications · NDSS 2006 |
Network measurement and analytics › device fingerprinting
OS fingerprinting |
0.0 | 1 | 2003 | Active Mapping: Resisting NIDS Evasion without Altering Traffic · S&P 2003 |
Methods — techniques the papers use, named apart from their topics
session replay · 0.1automated policy exploration · 0.1host profiling · 0.1active mapping · 0.1x.509 certificates · 0.1DNS rebinding · 0.1type qualifiers · 0.1static analysis · 0.1side-channel analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Dynamic pharming attacks and locked same-origin policies for web browsersabstractWe describe a new attack against web authentication, which we call dynamic pharming. Dynamic pharming works by hijacking DNS and sending the victim's browser malicious Javascript, which then exploits DNS rebinding vulnerabilities and the name-based same-origin policy to hijack a legitimate session after authentication has taken place. As a result, the attack works regardless of the authentication scheme used. Dynamic pharming enables the adversary to eavesdrop on sensitive content, forge transactions, sniff secondary passwords, etc. To counter dynamic pharming attacks, we propose two locked same-origin policies for web browsers. In contrast to the legacy same-origin policy, which regulates cross-object access control in browsers using domain names, the locked same-origin policies enforce access using servers' X.509 certificates and public keys. We show how our policies help two existing web authentication mechanisms, client-side SSL and SSL-only cookies, resist both pharming and stronger active attacks. Also, we present a deployability analysis of our policies based on a study of 14651 SSL domains. Our results suggest one of our policies can be deployed today and interoperate seamlessly with the vast majority of legacy web servers. For our other policy, we present a simple incrementally deployable opt-in mechanism for legacy servers using policy files, and show how web sites can use policy files to support self-signed and untrusted certificates, shared subdomain objects, and key updates. Chris Karlof, Umesh Shankar, J. D. Tygar, David A. Wagner 0001 |
CCS | 2 |
| 2006 | Doppelganger: Better browser privacy without the botherabstractWe introduce Doppelganger, a novel system for creating and enforcing fine-grained, privacy preserving browser cookie policies with low manual effort. Browser cookies pose privacy risks, since they can be used to track users' actions in detail, but some cookies also enable useful functionality, like personalization features. Web browsers currently lack an effective cookie management mechanism. Users must choose between two unpalatable options: a permissive, privacy-compromising policy for every site they visit, or a seemingly endless series of questions to which they must supply underinformed opinions. Doppelganger takes a big step forward: it makes automated determinations of cookies' value to enable a cost-benefit analysis, and offers an automated recovery system when that mechanism---or the user---makes an incorrect judgment. Doppelganger leverages client-side parallelism to automatically and simultaneously explore multiple cookie policies, enabling each user to create her ideal cookie policy. We tackle important and difficult subproblems along the way: mechanisms for recording and replaying web sessions; improved handling of third-party cookies; and enforcing fine-grained, per-site cookie mediation. We implemented Doppelganger as a Firefox extension; we discuss experimental results comparing it to various browser settings, as well as lessons learned from the real-world engineering challenges we faced in our implementation. Umesh Shankar, Chris Karlof |
CCS | 1 |
| 2006 | Preventing Secret Leakage from fork(): Securing Privilege-Separated ApplicationsabstractIf trusted processes' secrets or privileged system objects such as file handles are leaked to an untrusted process, the result could be the loss of secrecy and integrity of the data produced by the program. The advent of privilege-separated programs has led to an additional risk: sensitive data or system objects may be leaked when the trusted process of the privilege-separated application forks an untrusted child process. We have identified several channels by which information may flow to the child process: memory, the environment, memory mappings, filesystem information, and file descriptors. We propose fixes for each of these leaks. Some are handled by a novel static source code analysis of the target privilege-separated application's source code, but some require modifications to the kernel or compiler. As a proof of concept, we applied our technique to privilege-separated OpenSSH running on the Linux 2.6 kernel. Using our tools, we were able to verify easily that it does not leak secrets from its trusted components to its untrusted components; all sensitive data is erased or downgraded appropriately before being inherited by untrusted components. This suggests that our method is a useful way of reasoning about privilege-separated programs. Umesh Shankar, David A. Wagner 0001 |
ICC | 1 |
| 2006 | Toward Automated Information-Flow Integrity Verification for Security-Critical Applications
Umesh Shankar, Trent Jaeger, Reiner Sailer |
NDSS | 1 |
| 2006 | PRIMA: policy-reduced integrity measurement architectureabstractWe propose an integrity measurement approach based on information flow integrity,which we call the Policy-Reduced Integrity Measurement Architecture (PRIMA).The recent availability of secure hardware has made it practical for a system to measure its own integrity, such that it can generate an integrity proof for remote parties. Various approaches have been proposed,but most simply measure the loaded code and static data to approximate runtime system integrity.We find that these approaches suffer from two problems: (1)the load-time measurements of code alone do not accurately reflect runtime behaviors,such as the use of untrusted network data,and (2) they are ineficient,requiring all measured entities to be known and fully trusted even if they have no impact on the target application.Classical integrity models are based on information flow,so we design the PRIMA approach to enable measurement of information flow integrity and prove that it achieves these goals. We prove how a remote party can verify useful information flow integrity properties using PRIMA. A PRIMA prototype has been built based on the open-source Linux Integrity Measurement Architecture (IMA)using SELinux policies to provide the information flow. Trent Jaeger, Reiner Sailer, Umesh Shankar |
SACMAT | 3 |
| 2004 | Side Effects Are Not Sufficient to Authenticate Software
Umesh Shankar, Monica Chew, J. D. Tygar |
USENIX Security Symposium | 1 |
| 2003 | Active Mapping: Resisting NIDS Evasion without Altering TrafficabstractA critical problem faced by a network intrusion detection system (NIDS) is that of ambiguity. The NIDS cannot always determine what traffic reaches a given host nor how that host will interpret the traffic, and attackers may exploit this ambiguity to avoid detection or cause misleading alarms. We present a lightweight solution, active mapping, which eliminates TCP/IP-based ambiguity in a NIDS analysis with minimal runtime cost. Active mapping efficiently builds profiles of the network topology and the TCP/IP policies of hosts on the network; a NIDS may then use the host profiles to disambiguate the interpretation of the network traffic on a per-host basis. Active mapping avoids the semantic and performance problems of traffic normalization, in which traffic streams are modified to remove ambiguities. We have developed a prototype implementation of active mapping and modified a NIDS to use the active mapping-generated profile database in our tests. We found wide variation across operating systems' TCP/IP stack policies in real-world tests (about 6700 hosts), underscoring the need for this sort of disambiguation. Umesh Shankar, Vern Paxson |
S&P | 1 |
| 2002 | Multiscale Stepping-Stone Detection: Detecting Pairs of Jittered Interactive Streams by Exploiting Maximum Tolerable Delay
David L. Donoho, Ana Georgina Flesia, Umesh Shankar, Vern Paxson, Jason Coit, Stuart Staniford-Chen |
RAID | 3 |
| 2001 | Detecting Format String Vulnerabilities with Type Qualifiers
Umesh Shankar, Kunal Talwar, Jeffrey S. Foster, David A. Wagner 0001 |
USENIX Security Symposium | 1 |