Non-malleable codes are fundamental objects at the intersection of cryptography and coding theory. These codes provide security guarantees even in settings where error correction and detection are impossible, and have found applications to several other cryptographic tasks. One of the strongest and most well-studied adversarial tampering models is 2-split-state tampering. Here, a codeword is split into two parts which are stored in physically distant servers, and the adversary can then independently tamper with each part using arbitrary functions. This model can be naturally extended to the secret sharing setting with several parties by having the adversary independently tamper with each share. Previous works on non-malleable coding and secret sharing in the split-state tampering model only considered the encoding of classical messages. Furthermore, until recent work by Aggarwal, Boddu, and Jain (IEEE Trans. Inf. Theory 2024 & arXiv 2022), adversaries with quantum capabilities and shared entanglement had not been considered, and it is a priori not clear whether previous schemes remain secure in this model. In this work, we introduce the notions of split-state non-malleable codes and secret sharing schemes for quantum messages secure against quantum adversaries with shared entanglement. Then, we present explicit constructions of such schemes that achieve low-error non-malleability. More precisely, for some constant
c>0, we construct efficiently encodable and decodable split-state non-malleable codes and secret sharing schemes for quantum messages preserving entanglement with external systems and achieving security against quantum adversaries having shared entanglement with codeword length n, any message length at most
nc, and error
ε=2−nc. In the easier setting of average-case non-malleability, we achieve efficient non-malleable coding with rate close to
1/11.
Non-malleable codes introduced by Dziembowski, Pietrzak and Wichs [1] encode a classical messageSin a manner such that the tampered codeword either decodes to the original messageSor a message that is unrelated/independent ofS. Constructing non-malleable codes for various tampering function families has received significant attention in the recent years. We consider the well studied (2-part)split-statemodel, in which the messageSis encoded into two partsXandY, and the adversary is allowed to arbitrarily tamper with eachXandYindividually. Non-malleable codes in the split-state model have found applications in other important security notions likenon-malleable commitmentsandnon-malleable secret sharing. Thus, it is vital to understand if such non-malleable codes are secure against quantum adversaries. We consider the security of non-malleable codes in the split-state model when the adversary is allowed to make use of arbitrary entanglement to tamper the partsXandY. We construct explicit quantum secure non-malleable codes in the split-state model. Our construction of quantum secure non-malleable codes is based on the recent construction of quantum secure 2-source non-malleable extractorsby Boddu, Jain and Kapshikar [2]. • We extend the connection of Cheraghchi and Guruswami [3] between 2-source non-malleable extractors and non-malleable codes in the split-state model in the classical setting to the quantum setting, i.e. we show that explicit quantum secure 2-source non-malleable extractors in (k1,k2)-qpa-state framework of [2] give rise to explicit quantum secure non-malleable codes in the split-state model. • We construct the first quantum secure non-malleable code with efficient encoding and decoding procedures for message lengthm=nΩ(1), error ε = 2-nΩ(1)and codeword of size 2n. Prior to this work, it remained open to provide such quantum secure non-malleable code even for a single bit message in the split-state model. • We also study its natural extension when the tampering of the codeword is performedt-times. We construct quantum secure one-many non-malleable code with efficient encoding and decoding procedures fort=nΩ(1), message lengthm=nΩ(1), error ε = 2-nΩ(1)and codeword of size 2n. • As an application, we also construct the first quantum secure 2-out-of-2 non-malleable secret sharing scheme for message/secret lengthm=nΩ(1), error ε = 2-nΩ(1)and share of sizen.
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.