mlsanityData to 14 Oct 2026

ZeroLeak: Using LLMs for Scalable and Cost Effective Side-Channel Patching

arXiv 2308.13062 ↗First posted 24 Aug 2023cs.CR cs.LG cs.SEcited by 6

Not on the map. Why?

Abstract (arXiv)

Security critical software, e.g., OpenSSL, comes with numerous side-channel leakages left unpatched due to a lack of resources or experts. The situation will only worsen as the pace of code development accelerates, with developers relying on Large Language Models (LLMs) to automatically generate code. In this work, we explore the use of LLMs in generating patches for vulnerable code with microarchitectural side-channel leakages. For this, we investigate the generative abilities of powerful LLMs by carefully crafting prompts following a zero-shot learning approach. All generated code is dynamically analyzed by leakage detection tools, which are capable of pinpointing information leakage at the instruction level leaked either from secret dependent accesses or branches or vulnerable Spectre gadgets, respectively. Carefully crafted prompts are used to generate candidate replacements for vulnerable code, which are then analyzed for correctness and for leakage resilience. From a cost/performance perspective, the GPT4-based configuration costs in API calls a mere few cents per vulnerability fixed. Our results show that LLM-based patching is far more cost-effective and thus provides a scalable solution. Finally, the framework we propose will improve in time, especially as vulnerability detection tools and LLMs mature.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 27 of its 54 references that are in the map. First posted on arXiv 24 Aug 2023.

Builds on

27 of 54 references.

References · 27

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  3. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
  4. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  5. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
  6. 2022The Stack: 3 TB of permissively licensed source codecited by 359
  7. 2021AI Chains: Transparent and Controllable Human-AI Interaction by Chaining Large Language Model Promptscited by 268
  8. 2022PromptChainer: Chaining Large Language Model Prompts through Visual Programmingcited by 134
  9. 2021Examining Zero-Shot Vulnerability Repair with Large Language Modelscited by 105
  10. 2021Break-It-Fix-It: Unsupervised Learning for Program Repaircited by 71
  11. 2023How Effective Are Neural Networks for Fixing Security Vulnerabilitiescited by 52
  12. 2018Spectre Attacks: Exploiting Speculative Executioncited by 47
15 more
  1. 2023A New Era in Software Security: Towards Self-Healing Software via Large Language Models and Formal Verificationcited by 42
  2. 2023(Security) Assertions by Large Language Modelscited by 32
  3. 2019Learning to Fix Build Errors with Graph2Diff Neural Networkscited by 26
  4. 2023Fixing Hardware Security Bugs with Large Language Modelscited by 24
  5. 2023RAPGen: An Approach for Fixing Code Inefficiencies in Zero-Shotcited by 14
  6. 2018oo7: Low-overhead Defense against Spectre Attacks via Program Analysiscited by 4
  7. 2018A Systematic Evaluation of Transient Execution Attacks and Defensescited by 4
  8. 2019ZombieLoad: Cross-Privilege-Boundary Data Samplingcited by 3
  9. 2019SpecFuzz: Bringing Spectre-type vulnerabilities to the surfacecited by 3
  10. 2018Eliminating Timing Side-Channel Leaks using Program Repaircited by 2
  11. 2018MicroWalk: A Framework for Finding Side Channels in Binariescited by 2
  12. 2018SPECTECTOR: Principled Detection of Speculative Information Flowscited by 2
  13. 2019Constant-Time Foundations for the New Spectre Eracited by 1
  14. 2021SoK: Practical Foundations for Software Spectre Defensescited by 1
  15. 2022Microwalk-CI: Practical Side-Channel Analysis for JavaScript Applicationscited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 4; 2025: 1.

6 papers.