Quantum secure non-malleable randomness encoder and its applications
Rishabh Batra, Naresh Goud Boddu, Rahul Jain

TL;DR
This paper introduces the first quantum secure non-malleable randomness encoder and applies it to construct various quantum secure non-malleable codes with different rates and splits.
Contribution
It provides the first rate-1/2, 2-split, quantum secure NMRE and uses it to build multiple types of quantum secure non-malleable codes with different parameters.
Findings
Constructed a rate-1/2, 2-split quantum secure NMRE.
Built quantum non-malleable codes with rates 1/11, 1/3, and 1/5.
Achieved quantum security in non-malleable coding schemes.
Abstract
"Non-Malleable Randomness Encoder"(NMRE) was introduced by Kanukurthi, Obbattu, and Sekar~[KOS18] as a useful cryptographic primitive helpful in the construction of non-malleable codes. To the best of our knowledge, their construction is not known to be quantum secure. We provide a construction of a first rate-, -split, quantum secure NMRE and use this in a black-box manner, to construct for the first time the following: 1) rate , -split, quantum non-malleable code, 2) rate , -split, quantum secure non-malleable code, 3) rate , -split, average case quantum secure non-malleable code.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum-Dot Cellular Automata
