VLDB 2026 Research / reviewers in the wild / expert
Timothy L. Hinrichs
dblp:h/TimothyLHinrichs · also Tim Hinrichs
· DBLP profile ↗
10ranked-venue papers
4as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 7 · 1 first-authorArtificial intelligence and machine learning · 2 · 2 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorTheory of computation · 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
2 papers |
Systems and software security · 60% Web and mobile security · 40% | |
| Theoretical computer science
2 papers |
Logic in computer science · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Systems and software security
vulnerability discovery |
0.2 | 2 | 2011 | WAPTEC: whitebox analysis of web applications for parameter tampering exploit construction · CCS 2011 NoTamper: automatic blackbox detection of parameter tampering opportunities in web applications · CCS 2010 |
Web and mobile security
web application vulnerability |
0.2 | 2 | 2011 | WAPTEC: whitebox analysis of web applications for parameter tampering exploit construction · CCS 2011 NoTamper: automatic blackbox detection of parameter tampering opportunities in web applications · CCS 2010 |
Systems and software security › exploitation
exploit generation |
0.1 | 1 | 2011 | WAPTEC: whitebox analysis of web applications for parameter tampering exploit construction · CCS 2011 |
Logic in computer science
classical logic |
0.1 | 1 | 2008 | Injecting the How into the What: Investigating a Finite Classical Logic · KR 2008 |
Logic in computer science
modal logic |
0.1 | 1 | 2005 | Axiom Schemata as Metalevel Axioms: Model Theory · AAAI 2005 |
Logic in computer science
model theory |
0.1 | 1 | 2005 | Axiom Schemata as Metalevel Axioms: Model Theory · AAAI 2005 |
Methods — techniques the papers use, named apart from their topics
symbolic execution · 0.1static analysis · 0.1input validation analysis · 0.1black-box testing · 0.1axiom schemata · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | An actor-based, application-aware access control evaluation frameworkabstractTo date, most work regarding the formal analysis of access control schemes has focused on quantifying and comparing the expressive power of a set of schemes. Although expressive power is important, it is a property that exists in an *absolute* sense, detached from the application context within which an access control scheme will ultimately be deployed. By contrast, we formalize the access control *suitability analysis problem*, which seeks to evaluate the degree to which a set of candidate access control schemes can meet the needs of an application-specific workload. This process involves both reductions to assess whether a scheme is *capable* of implementing a workload (qualitative analysis), as well as cost analysis using ordered measures to quantify the *overheads* of using each candidate scheme to service the workload (quantitative analysis). We formalize the two-facet suitability analysis problem, which formally describes this task. We then develop a mathematical framework for this type of analysis, and evaluate this framework both formally, by quantifying its efficiency and accuracy properties, and practically, by exploring an academic program committee workload. William C. Garrison III, Adam J. Lee, Timothy L. Hinrichs |
SACMAT | 3 |
| 2014 | Automated detection of parameter tampering opportunities and vulnerabilities in web applicationsabstractParameter tampering attacks are dangerous to a web application whose server fails to replicate the validation of user-supplied data that is performed by the client in web forms. Malicious users who circumvent the client can capitalize on the missing server validation. In this paper, we provide a formal description of parameter tampering vulnerabilities and a high level approach for their detection. We specialize this high level approach to develop complementary detection solutions in two interesting settings: blackbox (only analyze client-side code in web forms) and whitebox (also analyze server-side code that processes submitted web forms). This paper presents interesting challenges encountered in realizing the high level approach for each setting and novel technical contributions that address these challenges. We also contrast utility, difficulties and effectiveness issues in both settings and provide a quantitative comparison of results. Our experiments with real world and open source applications demonstrate that parameter tampering vulnerabilities are prolific (total 47 in 9 applications), and their exploitation can have serious consequences including unauthorized transactions, account hijacking and financial losses. We conclude this paper with a discussion on countermeasures for parameter tampering attacks and present a detailed survey of existing defenses and their suitability. Prithvi Bisht, Timothy L. Hinrichs, Nazari Skrupsky, V. N. Venkatakrishnan |
J. Comput. Secur. | 2 |
| 2013 | TamperProof: a server-agnostic defense for parameter tampering attacks on web applicationsabstractParameter tampering attacks are dangerous to a web application whose server performs weaker data sanitization than its client. This paper presents TamperProof, a methodology and tool that offers a novel and efficient mechanism to protect Web applications from parameter tampering attacks. TamperProof is an online defense deployed in a trusted environment between the client and server and requires no access to, or knowledge of, the server side codebase, making it effective for both new and legacy applications. The paper reports on experiments that demonstrate TamperProof's power in efficiently preventing all known parameter tampering vulnerabilities on ten different applications. Nazari Skrupsky, Prithvi Bisht, Timothy L. Hinrichs, V. N. Venkatakrishnan, Lenore D. Zuck |
CODASPY | 3 |
| 2013 | Application-Sensitive Access Control Evaluation Using Parameterized ExpressivenessabstractAccess control schemes come in all shapes and sizes, which makes choosing the right one for a particular application a challenge. Yet today's techniques for comparing access control schemes completely ignore the setting in which the scheme is to be deployed. In this paper, we present a formal framework for comparing access control schemes with respect to a particular application. The analyst's main task is to evaluate an access control scheme in terms of how well it implements a given access control workload (a formalism that we introduce to represent an application's access control needs). One implementation is better than another if it has stronger security guarantees, and in this paper we introduce several such guarantees: correctness, homomorphism, AC-preservation, safety, administration-preservation, and compatibility. The scheme that admits the implementation with the strongest guarantees is deemed the best fit for the application. We demonstrate the use of our framework by evaluating two workloads on ten different access control schemes. Timothy L. Hinrichs, Diego Martinoia, William C. Garrison III, Adam J. Lee, Alessandro Panebianco, Lenore D. Zuck |
CSF | 1 |
| 2012 | The need for application-aware access control evaluationabstractAccess control is an area where one size does not fit all. However, previous work in access control has focused solely on expressiveness as an absolute measure. Thus, we discuss and justify the need for a new type of evaluation framework for access control, one that is application-aware. To this end, we apply previous work in access control evaluation, as well as lessons learned from evaluation frameworks used in other domains. We describe the analysis components required by such a framework, the challenges involved in building it, and our preliminary work in realizing this ambitious goal. We then theorize about other areas within the security domain that display a similar absence of such evaluation tools, and consider ways in which we can adapt our framework to analyze these broader types of security workloads. William C. Garrison III, Adam J. Lee, Timothy L. Hinrichs |
NSPW | 3 |
| 2011 | WAPTEC: whitebox analysis of web applications for parameter tampering exploit constructionabstractParameter tampering attacks are dangerous to a web application whose server fails to replicate the validation of user-supplied data that is performed by the client. Malicious users who circumvent the client can capitalize on the missing server validation. In this paper, we describe WAPTEC, a tool that is designed to automatically identify parameter tampering vulnerabilities and generate exploits by construction to demonstrate those vulnerabilities. WAPTEC involves a new approach to whitebox analysis of the server's code. We tested WAPTEC on six open source applications and found previously unknown vulnerabilities in every single one of them. Prithvi Bisht, Timothy L. Hinrichs, Nazari Skrupsky, V. N. Venkatakrishnan |
CCS | 2 |
| 2011 | Plato: A Compiler for Interactive Web Forms
Timothy L. Hinrichs |
PADL | 1 |
| 2010 | NoTamper: automatic blackbox detection of parameter tampering opportunities in web applicationsabstractWeb applications rely heavily on client-side computation to examine and validate form inputs that are supplied by a user (e.g., "credit card expiration date must be valid"). This is typically done for two reasons: to reduce burden on the server and to avoid latencies in communicating with the server. However, when a server fails to replicate the validation performed on the client, it is potentially vulnerable to attack. In this paper, we present a novel approach for automatically detecting potential server-side vulnerabilities of this kind in existing (legacy) web applications through blackbox analysis. We discuss the design and implementation of NoTamper, a tool that realizes this approach. NoTamper has been employed to discover several previously unknown vulnerabilities in a number of open-source web applications and live web sites. Prithvi Bisht, Timothy L. Hinrichs, Nazari Skrupsky, Radoslaw Bobrowicz, V. N. Venkatakrishnan |
CCS | 2 |
| 2008 | Injecting the How into the What: Investigating a Finite Classical Logic
Timothy L. Hinrichs, Michael R. Genesereth |
KR | 1 |
| 2005 | Axiom Schemata as Metalevel Axioms: Model Theory
Timothy L. Hinrichs, Michael R. Genesereth |
AAAI | 1 |