Metraipolis › archive › dc_79feec1e34da

Rate 1/5 Non-Malleable Codes against Entangled Split-State Tampering — arXiv:2609.39589

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39589
License (as archived)
CC0-1.0
Archived
2026-10-07T13:43:30.476Z
SHA-256 of the archived text
957de94a17368060bfc0ac95e1d68e38e1e01b4fff6f1464d27a610583b4e85d
Stable URL of this page
https://metraipolis.com/documento/dc_79feec1e34da

How to cite

Rate 1/5 Non-Malleable Codes against Entangled Split-State Tampering — arXiv:2609.39589 — arXiv (en), https://arxiv.org/abs/2609.39589 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_79feec1e34da (Metraipolis archive dc_79feec1e34da, sha256 957de94a17368060bfc0ac95e1d68e38e1e01b4fff6f1464d27a610583b4e85d)
BibTeX
@misc{dc79feec1e34da,
  title = {Rate 1/5 Non-Malleable Codes against Entangled Split-State Tampering — arXiv:2609.39589},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39589},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_79feec1e34da; sha256 957de94a17368060bfc0ac95e1d68e38e1e01b4fff6f1464d27a610583b4e85d},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39589. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 $\xi>0$ and all sufficiently large first-share lengths $n$, the codes have rate at least $1/5-\xi$, perfect correctness, and error $2^{-n^{\Omega(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.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-10-01 in cs.CR).
Categorie arXiv: Quantum Physics (quant-ph) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.39589 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T13:16:25.268Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).