Paper 2026/2898
LEASH: When LaBRADOR’s Guarantees Go Astray
Abstract
Succinct arguments enable efficient verification of large computations, while lattice-based constructions offer a promising path toward post-quantum security. LaBRADOR advances this direction through recursive reductions of knowledge that achieve compact proofs. However, these reductions require careful control of witness norms, relation preservation, and knowledge extraction to maintain their claimed guarantees. In this paper, we revisit the correctness and security analysis of LaBRADOR. We construct explicit counterexamples showing that its concrete parameter-selection strategy can fail to preserve completeness, even for valid binary R1CS witnesses. We further identify inconsistencies in recursive relation transformations and inaccuracies in the probability bounds underlying its knowledge extraction analysis. We develop targeted repairs and provide corresponding mathematical analyses, examining how changes to norm bounds, decomposition parameters, and challenge distributions affect the resulting security and efficiency guarantees. Our results highlight the importance of rigorous parameterization and compositional reasoning in lattice-based succinct proof systems.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- LaBRADORRecursive Reductions of KnowledgeCompletenessKnowledge SoundnessModule-SISSecurity AnalysisLattice-Based
- Contact author(s)
-
ee wangx24 @ gzu edu cn
xianggg0111 @ gmail com - History
- 2026-11-19: approved
- 2026-11-15: received
- See all versions
- Short URL
- https://ia.cr/2026/2898
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2026/2898,
author = {Xiang Wang and Ji Xiang},
title = {{LEASH}: When {LaBRADOR}’s Guarantees Go Astray},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/2898},
year = {2026},
url = {https://eprint.iacr.org/2026/2898}
}