EDBT 2026 Demo / reviewers in the wild / expert
Andrey Chudnov
dblp:94/3130
· DBLP profile ↗
7ranked-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-authorSoftware engineering, systems software and programming languages · 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 · 72% Web and mobile security · 28% | |
| Software engineering, system software, and programming languages
2 papers |
Program verification · 72% Programming languages and type systems · 28% |
Topics — the 4 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Systems and software security › information flow control
dynamic information flow control |
0.2 | 1 | 2015 | Inlined Information Flow Monitoring for JavaScript · CCS 2015 |
Web and mobile security
javascript security |
0.2 | 1 | 2015 | Inlined Information Flow Monitoring for JavaScript · CCS 2015 |
Program verification
information flow security |
0.1 | 1 | 2015 | Inlined Information Flow Monitoring for JavaScript · CCS 2015 |
Programming languages and type systems
language semantics |
0.1 | 1 | 2015 | Inlined Information Flow Monitoring for JavaScript · CCS 2015 |
Methods — techniques the papers use, named apart from their topics
no-sensitive-upgrade · 0.4inlined monitoring · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | Continuous Formal Verification of Amazon s2n
Andrey Chudnov, Nathan Collins, Byron Cook, Joey Dodds, Brian Huffman, Colm MacCárthaigh, Stephen Magill, Eric Mertens, Eric Mullen, Serdar Tasiran, Aaron Tomb, Eddy Westbrook |
CAV (2) | 1 |
| 2018 | Assuming You Know: Epistemic Semantics of Relational Annotations for Expressive Flow PoliciesabstractMany high-level security requirements are about the allowed flow of information in programs, but are difficult to make precise because they involve selective downgrading. Quite a few mutually incompatible and ad-hoc approaches have been proposed for specifying and enforcing downgrading policies. Prior surveys of these approaches have not provided a unifying technical framework. Notions from epistemic logic have emerged as a good approach to policy semantics but are considerably removed from well developed static and dynamic enforcement techniques. We develop a unified framework for expressing, giving meaning and enforcing information downgrading policies that builds on commonly known and widely deployed concepts and techniques, especially static and dynamic assertion checking. These concepts should make information flow accessible and enable developers without special training to specify precise policies. The unified framework allows to directly compare different policy specification styles and enforce them by leveraging existing techniques. Andrey Chudnov, David A. Naumann |
CSF | 1 |
| 2015 | Inlined Information Flow Monitoring for JavaScriptabstractExtant security mechanisms for web apps, notably the "same-origin policy", are not sufficient to achieve confidentiality and integrity goals for the many apps that manipulate sensitive information. The trend in web apps is "mashups" which integrate JavaScript code from multiple providers in ways that can undercut existing security mechanisms. Researchers are exploring dynamic information flow controls (IFC) for JavaScript, but there are many challenges to achieving strong IFC without excessive performance cost or impractical browser modifications. This paper presents an inlined IFC monitor for ECMAScript 5 with web support, using the no-sensitive-upgrade (NSU) technique, together with experimental evaluation using synthetic mashups and performance benchmarks. On this basis it should be possible to conduct experiments at scale to evaluate feasibility of both NSU and inlined monitoring. Andrey Chudnov, David A. Naumann |
CCS | 1 |
| 2014 | Information Flow Monitoring as Abstract Interpretation for Relational LogicabstractA number of systems have been developed for dynamic information flow control (IFC). In such systems, the security policy is expressed by labeling input and output channels, it is enforced by tracking and checking labels on data. Systems have been proven to enforce some form of noninterference (NI), formalized as a property of two runs of the program. In practice, NI is too strong and it is desirable to enforce some relaxation of NI that allows downgrading under constraints that have been classified as 'what', 'where', 'who', or 'when' policies. To encompass a broad range of policies, relational logic has been proposed as a means to specify and statically enforce policy. This paper shows how relational logic policies can be dynamically checked. To do so, we provide a new account of monitoring, in which the monitor state is viewed as an abstract interpretation of sets of pairs of program runs. Andrey Chudnov, George Kuan, David A. Naumann |
CSF | 1 |
| 2010 | Information Flow Monitor InliningabstractIn recent years it has been shown that dynamic monitoring can be used to soundly enforce information flow policies. For programs distributed in source or bytecode form, the use of just-in-time (JIT) compilation makes it difficult to implement monitoring by modifying the language runtime system. An inliner avoids this problem and also serves to provide monitoring for more than one runtime. We show how to inline an information flow monitor, specifically a flow sensitive one previously proved to enforce termination insensitive noninterference. We prove that the inlined version is observationally equivalent to the original. Andrey Chudnov, David A. Naumann |
CSF | 1 |
| 2009 | Lightweight self-protecting JavaScriptabstractThis paper introduces a method to control JavaScript execution. The aim is to prevent or modify inappropriate behaviour caused by e.g. malicious injected scripts or poorly designed third-party code. The approach is based on modifying the code so as to make it self-protecting: the protection mechanism (security policy) is embedded into the code itself and intercepts security relevant API calls. The challenges come from the nature of the JavaScript language: any variables in the scope of the program can be redefined, and code can be created and run on-the-fly. This creates potential problems, respectively, for tamper-proofing the protection mechanism, and for ensuring that no security relevant events bypass the protection. Unlike previous approaches to instrument and monitor JavaScript to enforce or adjust behaviour, the solution we propose is lightweight in that (i) it does not require a modified browser, and (ii) it does not require any run-time parsing and transformation of code (including dynamically generated code). As a result, the method has low run-time overhead compared to other methods satisfying (i), and the lack of need for browser modifications means that the policy can even be applied on the server to mitigate some effects of cross-site scripting bugs. Phu H. Phung, David Sands 0001, Andrey Chudnov |
AsiaCCS | 3 |
| 2009 | Tracking Information Flow in Dynamic Tree Structures
Alejandro Russo, Andrei Sabelfeld, Andrey Chudnov |
ESORICS | 3 |