Rate 1/5 Non-Malleable Codes against Entangled Split-State Tampering
Abstract
We construct efficient information-theoretic non-malleable codes for classical messages that are secure against two noncommunicating local quantum tampering operations with arbitrary pre-shared entanglement. For every sufficiently small fixed ξ>0 and all sufficiently large first-share lengths n, the codes have rate at least 1/5−ξ, perfect correctness, and error 2−nΩ(1). Security holds for every message, with a single message-independent simulator for each attack. This resolves the constant-rate question for worst-case classical messages in the entangled two-split-state model. Our construction builds on the permutation-based two-split construction of Batra, Boddu, and Jain, which achieves rate approaching 1/5 for uniformly random messages. We retain their architecture but replace the uniform message input to the permutation with a prescribed message concatenated with fresh uniform padding. Our main contribution is a worst-case security reduction for this modification.
Related
- One-sided-DIQKD using any pure bipartite entangled state secure against all attacks
- SPLIT: Loosely-coherent inference of long-inspiral gravitational-wave sources for robustness against modeling and data outliers
- Entangled Merged Pairs: The Observation-Boundary Principle
- Simulation of quantum entangled states by classical probabilistic models
- Quantum matter is weakly entangled at low energies
BibTeX
@misc{boddu2026rate,
title = {{Rate 1/5 Non-Malleable Codes against Entangled Split-State Tampering}},
author = {Naresh Goud Boddu},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.39589},
eprint = {2609.39589},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.39589},
}
RIS
TY - UNPB
TI - Rate 1/5 Non-Malleable Codes against Entangled Split-State Tampering
AU - Naresh Goud Boddu
PY - 2026
DA - 2026/09/30
PB - arXiv
DO - 10.48550/arxiv.2609.39589
UR - https://arxiv.org/abs/2609.39589
AB - We construct efficient information-theoretic non-malleable codes for classical messages that are secure against two noncommunicating local quantum tampering operations with arbitrary pre-shared entanglement. For every sufficiently small fixed ξ>0 and all sufficiently large first-share lengths n, the codes have rate at least 1/5−ξ, perfect correctness, and error 2^−n^Ω(1). Security holds for every message, with a single message-independent simulator for each attack. This resolves the constant-rate question for worst-case classical messages in the entangled two-split-state model. Our construction builds on the permutation-based two-split construction of Batra, Boddu, and Jain, which achieves rate approaching 1/5 for uniformly random messages. We retain their architecture but replace the uniform message input to the permutation with a prescribed message concatenated with fresh uniform padding. Our main contribution is a worst-case security reduction for this modification.
ER -