Taint Analysis for Graph APIs Focusing on Broken Access Control
Leen Lambers, Lucas Sakizloglou, Taisiya Khakharova, Fernando Orejas

TL;DR
This paper introduces a systematic static and dynamic taint analysis approach for Graph APIs to detect broken access control issues, combining graph transformation modeling and Critical Pair Analysis to identify both direct and indirect tainted information flows.
Contribution
It presents the first combined static and dynamic taint analysis method specifically designed for Graph APIs, enabling systematic detection of broken access control vulnerabilities.
Findings
Successfully applied to GitHub GraphQL API
Detected cases of unauthorized data access and manipulation
Supported design of targeted security tests
Abstract
We present the first systematic approach to static and dynamic taint analysis for Graph APIs focusing on broken access control. The approach comprises the following. We taint nodes of the Graph API if they represent data requiring specific privileges in order to be retrieved or manipulated, and identify API calls which are related to sources and sinks. Then, we statically analyze whether a tainted information flow between API source and sink calls occurs. To this end, we model the API calls using graph transformation rules. We subsequently use Critical Pair Analysis to automatically analyze potential dependencies between rules representing source calls and rules representing sink calls. We distinguish direct from indirect tainted information flow and argue under which conditions the Critical Pair Analysis is able to detect not only direct, but also indirect tainted flow. The static…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
