Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Continuously Non-Malleable Codes in the Split-State Model from Minimal Assumptions

Rafail Ostrovsky, Giuseppe Persiano, Daniele Venturi, Ivan Visconti

Published Jan 1, 2018• 29 citations
Publisher
DOI
10.1007/978-3-319-96878-0_21

Related papers

Information Theoretic Continuously Non-Malleable Codes in the Constant Split-State Model.

Nico Döttling, Jesper Buus Nielsen, Maciej Obremski

Electronic colloquium on computational complexity•Jan 1, 2017•4 citations

Split-State Non-malleable Codes and Secret Sharing Schemes for Quantum Messages

Naresh Goud Boddu, Vipul Goyal, Rahul Jain +1 more

Lecture notes in computer science•Nov 27, 2024•4 citations

Upper and Lower Bounds for Continuous Non-Malleable Codes

Dana Dachman-Soled, Mukul Kulkarni

Lecture notes in computer science•Jan 1, 2019•11 citations

Near Optimal Non-malleable Codes and Leakage Resilient Secret Sharing Schemes

Sruthi Sekar

•Sep 13, 2021•0 citations

Interactive Non-malleable Codes

Nils Fleischhacker, Vipul Goyal, Abhishek Jain +2 more

Lecture notes in computer science•Jan 1, 2019•4 citations

Rate 1/5 Non-Malleable Codes against Entangled Split-State Tampering

Naresh Goud Boddu

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.

quant-pharXiv:2609.39589•Oct 1, 2026•0 citations
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ξ>0ξ>0 and all sufficiently large first-share lengths nnn, the codes have rate at least 1/5−ξ1/5-ξ1/5−ξ, perfect correctness, and error 2−nΩ(1)2^{-n^{Ω(1)}}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/51/51/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.