Confidence Elicitation: A New Attack Vector for Large Language Models

Brian Formento, Chuan-Sheng Foo, See-Kiong Ng
2/12/2026

No official code found. Best implementation: Aniloid2/Confidence_Elicitation_Attacks (6 stars, last commit 2025-03-04).

Abstract

A fundamental issue in deep learning has been adversarial robustness. As these systems have scaled, such issues have persisted. Currently, large language models (LLMs) with billions of parameters suffer from adversarial attacks just like their earlier, smaller counterparts. However, the threat models have changed. Previously, having gray-box access, where input embeddings or output logits/probabilities were visible to the user, might have been reasonable. However, with the introduction of closed-source models, no information about the model is available apart from the generated output. This means that current black-box attacks can only utilize the final prediction to detect if an attack is successful. In this work, we investigate and demonstrate the potential of attack guidance, akin to using output probabilities, while having only black-box access in a classification setting. This is achieved through the ability to elicit confidence from the model. We empirically show that the elicited confidence is calibrated and not hallucinated for current LLMs. By minimizing the elicited confidence, we can therefore increase the likelihood of misclassification. Our new proposed paradigm demonstrates promising state-of-the-art results on three datasets across two models (LLaMA-3-8B-Instruct and Mistral-7B-Instruct-V0.3) when comparing our technique to existing hard-label black-box attack methods that introduce word-level substitutions.

View on arXivView PDF

Code Implementations(1)

[ICLR 2025] Confidence Elicitation: A New Attack Vector for Large Language Models

60Shell, PythonSep 19, 20241 years ago

Similar Papers

Cite this paper

@article{formento2026confidence,
  title  = {Confidence Elicitation: A New Attack Vector for Large Language Models},
  author = {Brian Formento and Chuan-Sheng Foo and See-Kiong Ng},
  year   = {2026},
  eprint = {2502.04643},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2502.04643},
  journal = {ICLR 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.04643.svg)](https://codeofpaper.com/paper/2502.04643)

Discussion