91 citations · 766 across the 68 of their papers we have counts for
73 papers
Quantum secure non-malleable randomness encoder and its applications
Rishabh Batra, Naresh Goud Boddu, Rahul Jain
"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 c…
Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum Messages
Naresh Goud Boddu, Vipul Goyal, Rahul Jain +1
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 a…
A note on the partition bound for one-way classical communication complexity
Srinivasan Arunachalam, João F. Doriguello, Joao F. Doriguello +1
We present a linear program for a one-way version of the partition bound of Jain and Klauck, denoted , and show that it characterizes the one-way ran…
Matrix Multiplicative Weights Updates in Quantum Zero-Sum Games: Conservation Laws & Recurrence
Rahul Jain, Georgios Piliouras, Ryann Sim
Recent advances in quantum computing and in particular, the introduction of quantum GANs, have led to increased interest in quantum zero-sum game theory, extending the scope of lea…
Quantum secure non-malleable-extractors
Naresh Goud Boddu, Rahul Jain, Upendra Kapshikar
We construct several explicit quantum secure non-malleable-extractors. All the quantum secure non-malleable-extractors we construct are based on the constructions by Chattopadhyay,…
On relating one-way classical and quantum communication complexities
Naresh Goud Boddu, Rahul Jain, Han-Hsuan Lin
Communication complexity is the amount of communication needed to compute a function when the function inputs are distributed over multiple parties. In its simplest form, one-way c…