Demo Data from EDBT 2026 / reviewers in the wild / expert
Jarin Firose Moon
dblp:186/8462
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2021
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 since 2021
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 |
Systems and software security · 67% Cryptographic primitives and cryptanalysis · 33% | |
| 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
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Systems and software security › exploitation
memory disclosure attacks |
0.5 | 1 | 2021 | DynPTA: Combining Static and Dynamic Analysis for Practical Selective Data Protection · SP 2021 |
Systems and software security
memory safety |
0.5 | 1 | 2021 | DynPTA: Combining Static and Dynamic Analysis for Practical Selective Data Protection · SP 2021 |
Cryptographic primitives and cryptanalysis › encryption
selective encryption |
0.5 | 1 | 2021 | DynPTA: Combining Static and Dynamic Analysis for Practical Selective Data Protection · SP 2021 |
Program analysis › static analysis
pointer analysis |
0.1 | 1 | 2021 | DynPTA: Combining Static and Dynamic Analysis for Practical Selective Data Protection · SP 2021 |
Methods — techniques the papers use, named apart from their topics
static analysis · 1.0pointer analysis · 1.0dynamic data flow tracking · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | DynPTA: Combining Static and Dynamic Analysis for Practical Selective Data ProtectionabstractAs control flow hijacking attacks become more challenging due to the deployment of various exploit mitigation technologies, the leakage of sensitive process data through the exploitation of memory disclosure vulnerabilities is becoming an increasingly important threat. To make matters worse, recently introduced transient execution attacks provide a new avenue for leaking confidential process data. As a response, various approaches for selectively protecting subsets of critical in-memory data have been proposed, which though either require a significant code refactoring effort, or do not scale for large applications.In this paper we present DynPTA, a selective data protection approach that combines static analysis with scoped dynamic data flow tracking (DFT) to keep a subset of manually annotated sensitive data always encrypted in memory. DynPTA ameliorates the inherent overapproximation of pointer analysis—a significant challenge that has prevented previous approaches from supporting large applications—by relying on lightweight label lookups to determine if potentially sensitive data is actually sensitive. Labeled objects are tracked only within the subset of value flows that may carry potentially sensitive data, requiring only a fraction of the program’s code to be instrumented for DFT. We experimentally evaluated DynPTA with real-world applications and demonstrate that it can prevent memory disclosure (Heartbleed) and transient execution (Spectre) attacks from leaking the protected data, while incurring a modest runtime overhead of up to 19.2% when protecting the private TLS key of Nginx with OpenSSL. Tapti Palit, Jarin Firose Moon, Fabian Monrose, Michalis Polychronakis |
SP | 2 |