10 citations · 16 across the 9 of their papers we have counts for
13 papers
Hardness of Approximating Quantum Code Distance Beyond
Upendra Kapshikar
We study the computational complexity of approximating the minimum distance of a stabilizer code. Classically, the minimum distance problem is NP-hard to approximate even to within…
Keyless secrecy against bounded adversaries
Anne Broadbent, Upendra Kapshikar, Denis Rochette
We introduce a keyless coding/cryptographic primitive that asks for two guarantees at once: the receiver is never fooled into accepting a message other than the one sent, and the a…
A Framework for Ruling Out Quantum Speedups
Thomas Huffstutler, Upendra Kapshikar, David Miloschewsky +1
We study when partial Boolean functions can (and cannot) exhibit superpolynomial quantum query speedups, and develop a general framework for ruling out such speedups via two comple…
Towards Universal Quantum Tamper Detection
Anne Broadbent, Upendra Kapshikar, Denis Rochette
Tamper-resilient cryptography studies how to protect data against adversaries who can physically manipulate codewords before they are decoded. The notion of tamper detection codes…
A robust and composable device-independent protocol for oblivious transfer using (fully) untrusted quantum devices in the bounded storage model
Rishabh Batra, Sayantan Chakraborty, Rahul Jain +1
We present a robust and composable device-independent (DI) quantum protocol between two parties for oblivious transfer (OT) using Magic Square devices in the bounded storage model…
Chain rules for one-shot entropic quantities via operational methods
Sayantan Chakraborty, Upendra Kapshikar
We introduce a new operational technique for deriving chain rules for general information theoretic quantities. This technique is very different from the popular (and in some cases…
On the Hardness of the Minimum Distance Problem of Quantum Codes
Upendra Kapshikar, Srijita Kundu
We study the hardness of the problem of finding the distance of quantum error-correcting codes. The analogous problem for classical codes is known to be NP-hard, even in approximat…
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,…
The Diagonal Distance of CWS Codes
Upendra S. Kapshikar
Quantum degeneracy in error correction is a feature unique to quantum error correcting codes, unlike their classical counterpart. It allows a quantum error correcting code to corre…
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…
Niederreiter cryptosystems using quasi-cyclic codes that resist quantum Fourier sampling
Upendra Kapshikar, Ayan Mahalanobis
McEliece and Niederreiter cryptosystems are robust and versatile cryptosystems. These cryptosystems work with many linear error-correcting codes. They are popular these days becaus…
McEliece-type Cryptosystems over Quasi-cyclic Codes
Upendra Kapshikar
In this thesis, we study algebraic coding theory based McEliece-type cryptosystems over quasi-cyclic codes. The main goal of this thesis is to construct a cryptosystem that resists…
A Quantum-Secure Niederreiter Cryptosystem using Quasi-Cyclic Codes
Upendra Kapshikar, Ayan Mahalanobis
In this paper, we describe a new Niederreiter cryptosystem based on quasi-cyclic codes that is quantum-secure. This new cryptosystem has good transmission rate comp…