activity
20182026
most citedQuantum Log-Approximate-Rank Conjecture is also False

7 citations · 16 across the 10 of their papers we have counts for

collaborators

11 papers

quant-ph2026

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 arbitra…

cs.CR2026

A Practical Post-Quantum Distributed Ledger Protocol for Financial Institutions

Yeoh Wei Zhu, Naresh Goud Boddu, Yao Ma +5

Traditional financial institutions face inefficiencies that can be addressed by distributed ledger technology. However, a primary barrier to adoption is the privacy concerns surrou…

quant-ph2023

On Split-State Quantum Tamper Detection and Non-Malleability

Thiago Bergamaschi, Naresh Goud Boddu

Tamper-detection codes (TDCs) are fundamental objects at the intersection of cryptography and coding theory. A TDC encodes messages in such a manner that tampering the codeword cau…

cs.CR2023

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…

cs.CR2023★ 2 cited

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…

cs.CR2021★ 2 cited

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,…

cs.CC2021★ 3 cited

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…

cs.CR2021★ 1 cited

Quantum Measurement Adversary

Divesh Aggarwal, Naresh Goud Boddu, Rahul Jain +1

Multi-source-extractors are functions that extract uniform randomness from multiple (weak) sources of randomness. Quantum multi-source-extractors were considered by Kasher and Kemp…

cs.CR2021

Tamper Detection against Unitary Operators

Naresh Goud Boddu, Upendra S. Kapshikar

Security of a storage device against a tampering adversary has been a well-studied topic in classical cryptography. Such models give black-box access to an adversary, and the aim i…

quant-ph2020★ 1 cited

Graph-theoretic approach to dimension witnessing

Maharshi Ray, Naresh Goud Boddu, Kishor Bharti +2

A fundamental problem in quantum computation and quantum information is finding the minimum quantum dimension needed for a task. For tasks involving state preparation and measureme…

quant-ph2018★ 7 cited

Quantum Log-Approximate-Rank Conjecture is also False

Anurag Anshu, Naresh Goud Boddu, Dave Touchette

In a recent breakthrough result, Chattopadhyay, Mande and Sherif [ECCC TR18-17] showed an exponential separation between the log approximate rank and randomized communication compl…