GAUGE: A Formal Framework for Measuring Cryptographic Security under Heterogeneous Adversary Cost Models

• URL: http://arxiv.org/abs/2609.17281v1
• Date: Tue, 15 Sep 2026 14:55:29 GMT
• Title: GAUGE: A Formal Framework for Measuring Cryptographic Security under Heterogeneous Adversary Cost Models
• Abstract summary: Standards bodies report cryptographic security as a single number of bits.<n>Different conventions produce different rankings of cryptographic schemes.<n>GAUGE provides an explicit and auditable framework for reporting cryptographic security under competing cost models.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Standards bodies report cryptographic security as a single number of bits, but this value depends on the adversary cost model used to price time, memory, and quantum resources. Different conventions can therefore produce different rankings of cryptographic schemes. GAUGE represents security as a function over admissible cost models, called a security profile. Comparisons then become comparisons between profiles, and ranking reversals become an explicit structural property rather than a measurement error. We formalize price functionals over a cone of adversary cost models, show that security profiles are piecewise-linear and concave, and prove a rating trilemma: when two profiles cross, no rating can simultaneously be faithful to underlying costs, total over comparable pairs, and independent of the chosen cost model. We provide a polynomial-time linear-programming procedure that certifies whether the ranking of two schemes is robust, reverses under admissible models, or is genuinely incomparable. We extend GAUGE with a two-layer risk measure combining stochastic cryptanalytic decay with uncertainty over the appropriate cost model. We evaluate the framework on NIST post-quantum standards, classical anchors, and a 25-year chronology of cryptanalytic breaks. The analysis certifies a ranking reversal for ML-KEM-512 versus AES-128 from a 4-5% shift in memory pricing, and measures a lattice-sieving cost drift of 9.79 bits per year over eight years. A hybrid X25519 + ML-KEM-768 handshake reduces combined-break probability twenty-fold at a 2.3 kilobyte cost. The artifact reproduces all tables and figures in under seven seconds. GAUGE provides an explicit and auditable framework for reporting cryptographic security under competing cost models.

Related papers

• FUSE: An Evaluating Framework for Dangerous Capabilities of LLMs [24.30721158142313]
  Fragmented safety evaluation undermines the governance of dangerous AI capabilities.<n>We present a modular framework that evaluates each model through three orthogonal pipelines---Knowledge, Defense, and Harm.<n>Our first contribution is a horizontal comparison of dangerous capability across models and model families.<n>The second is a temporal analysis of capability evolution: tracking $K$, $D$, and $H$ against model release dates reveals that dangerous capability has not monotonically declined.
  arXiv  Detail & Related papers  (2026-09-02T06:31:39Z)
• Best-Arm Identification with Generative Proxy [10.674965991983974]
  We study fixed-confidence best-arm identification in which each costly reward pull is paired with a cheap but correlated proxy score.<n>We propose PROBE, a phase-elimination algorithm that maintains an upper certificate on the residual variance with an ordinary least squares fit.<n>We prove that PROBE is $$-PAC and attains the known-correlation oracle sample complexity up to a constant multiplicative factor and a constant additive calibration cost.
  arXiv  Detail & Related papers  (2026-07-08T00:41:43Z)
• Beyond Value Benchmarks: Measuring Value-Structure Alignment in Large Language Models via Symmetric Q-Sorts [47.02978329409663]
  We propose a symmetric human-LLM evaluation framework, grounded in Q methodology, to measure value-structure alignment.<n>Under our protocol, humans and models sort an identical 140-item moral statement set into a shared nine-column forced distribution.<n>We evaluate 12 LLMs across four model families via 240 replicated Q-sorts at two temperature settings.
  arXiv  Detail & Related papers  (2026-06-20T08:15:41Z)
• SILMARILS: Information-Theoretic and Quantum-Secure Designated-Verifier Signatures [4.985913181990347]
  SILMARILS is built from a minimal algebraic core over $mathbbF_p$ using true randomness and perfect $2$-out-of-$2$ Shamir secret sharing.<n>In the two-party setting, SILMARILS realizes a transferable designated-verifier (TDV) signature scheme.<n>In the three-party mode, adopting the broadcast model of Fitzi et al., we obtain a statistically secure signature protocol with simulation-based security and error$1/p$.
  arXiv  Detail & Related papers  (2026-05-04T23:48:01Z)
• Byzantine-Robust and Differentially Private Federated Optimization under Weaker Assumptions [89.52532304099522]
  Federated Learning (FL) enables clients to collaboratively train a shared model without centralizing their raw data, offering an inherent level of privacy.<n> gradients and model updates can still leak sensitive information, while malicious servers may mount adversarial attacks such as Byzantine manipulation.<n>These vulnerabilities highlight the need to address differential privacy (DP) and Byzantine robustness within a unified framework.<n>We propose Byz-Clip21-SGD2M, a new algorithm that integrates robust aggregation with double momentum and carefully designed clipping.
  arXiv  Detail & Related papers  (2026-03-24T17:39:09Z)
• Spectral Sentinel: Scalable Byzantine-Robust Decentralized Federated Learning via Sketched Random Matrix Theory on Blockchain [0.0]
  Byzantine clients poison gradients under heterogeneous (Non-IID) data.<n>We propose Spectral Sentinel, a Byzantine detection and aggregation framework.<n>We implement the full system with blockchain integration on Polygon networks.
  arXiv  Detail & Related papers  (2025-12-14T09:43:03Z)
• OVERT: A Benchmark for Over-Refusal Evaluation on Text-to-Image Models [91.55634905861827]
  Over-refusal is a phenomenon known as $textitover-refusal$ that reduces the practical utility of T2I models.<n>We present OVERT ($textbfOVE$r-$textbfR$efusal evaluation on $textbfT$ext-to-image models), the first large-scale benchmark for assessing over-refusal behaviors.
  arXiv  Detail & Related papers  (2025-05-27T15:42:46Z)
• Economic Security of Multiple Shared Security Protocols [5.335834405397044]
  We formalize the Multiple SSP Problem and analyze two architectures.<n>An isolated fragmented model called Model $mathbbM$ and a shared unified model called Model $mathbbS$ are studied.<n>Our results show that while Model $mathbbM$ offers deployment flexibility, it inherits lowest-cost attack vulnerabilities, whereas Model $mathbbS$ achieves tighter security guarantees through single validator sets and aggregated slashing logic.
  arXiv  Detail & Related papers  (2025-05-05T08:40:16Z)
• Are You Getting What You Pay For? Auditing Model Substitution in LLM APIs [71.7892165868749]
  Commercial Large Language Model (LLM) APIs create a fundamental trust problem.<n>Users pay for specific models but have no guarantee that providers deliver them faithfully.<n>We formalize this model substitution problem and evaluate detection methods under realistic adversarial conditions.<n>We propose and evaluate the use of Trusted Execution Environments (TEEs) as one practical and robust solution.
  arXiv  Detail & Related papers  (2025-04-07T03:57:41Z)
• Risk-limiting Financial Audits via Weighted Sampling without Replacement [47.189919138260066]
  Given $N$ transactions, the goal is to estimate the total misstated monetary fraction to a given accuracy. We do this by constructing new confidence sequences for the weighted average of $N$ unknown values. We show that when the side information is sufficiently predictive, it can directly drive the sampling.
  arXiv  Detail & Related papers  (2023-05-08T17:34:06Z)
• Robustness Certificates for Implicit Neural Networks: A Mixed Monotone Contractive Approach [60.67748036747221]
  Implicit neural networks offer competitive performance and reduced memory consumption. They can remain brittle with respect to input adversarial perturbations. This paper proposes a theoretical and computational framework for robustness verification of implicit neural networks.
  arXiv  Detail & Related papers  (2021-12-10T03:08:55Z)
• Towards Assessment of Randomized Smoothing Mechanisms for Certifying Adversarial Robustness [50.96431444396752]
  We argue that the main difficulty is how to assess the appropriateness of each randomized mechanism. We first conclude that the Gaussian mechanism is indeed an appropriate option to certify $ell$-norm. Surprisingly, we show that the Gaussian mechanism is also an appropriate option for certifying $ell_infty$-norm, instead of the Exponential mechanism.
  arXiv  Detail & Related papers  (2020-05-15T03:54:53Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.