Gleipner: A benchmark for gadget chain detection in Java Deserialization Vulnerabilities
2025 (Engelska)Ingår i: Proceedings of the ACM on Software Engineering, E-ISSN 2994-970, Vol. 2, nr FSE001, s. 1-21Artikel i tidskrift (Refereegranskat) Published
Abstract [en]
While multiple recent publications on detecting Java Deserialization Vulnerabilities highlight an increasing relevance of the topic, until now no proper benchmark has been established to evaluate the individual approaches. Hence, it has become increasingly difficult to show improvements over previous tools and trade-offs that were made. In this work, we synthesize the main challenges in gadget chain detection. More specifically, this unveils the constraints program analysis faces in the context of gadget chain detection. From there, we develop Gleipner: the first synthetic, large-scale and systematic benchmark to validate the effectiveness of algorithms for detecting gadget chains in the Java programming language. We then benchmark seven previous publications in the field using Gleipner. As a result, it shows, that (1) our benchmark provides a transparent, qualitative, and sound measurement for the maturity of gadget chain detecting tools, (2) Gleipner alleviates severe benchmarking flaws which were previously common in the field and (3) state-of-the-art tools still struggle with most challenges in gadget chain detection.
Ort, förlag, år, upplaga, sidor
New York: Association for Computing Machinery (ACM), 2025. Vol. 2, nr FSE001, s. 1-21
Nyckelord [en]
Java, benchmark, deserialization, gadget chain, program analysis, vulnerabilitiy
Nationell ämneskategori
Säkerhet, integritet och kryptologi
Forskningsämne
datalogi
Identifikatorer
URN: urn:nbn:se:umu:diva-249205DOI: 10.1145/3715711OAI: oai:DiVA.org:umu-249205DiVA, id: diva2:2033796
Konferens
ACM International Conference on the Foundations of Software Engineering (FSE), Trondheim, Norway, June 23-27, 2025
Forskningsfinansiär
Wallenberg AI, Autonomous Systems and Software Program (WASP)2026-01-302026-01-302026-02-02Bibliografiskt granskad