Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Kapshikar, Upendra"'
Robust and composable device-independent quantum protocols for oblivious transfer and bit commitment
We present robust and composable device-independent quantum protocols for oblivious transfer (OT) and bit commitment (BC) using Magic Square devices. We assume there is no long-term quantum memory, that is, after a finite time interval, referred to a
Externí odkaz:
http://arxiv.org/abs/2404.11283
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 fairly involved) methods like SDP formulation and operator algebra or
Externí odkaz:
http://arxiv.org/abs/2305.08521
Autor:
Kapshikar, Upendra, Kundu, Srijita
Publikováno v:
IEEE Transactions on Information Theory (Volume: 69, Issue: 10, October 2023)
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 approximate form. For quantum codes, various problems related to decoding are kn
Externí odkaz:
http://arxiv.org/abs/2203.04262
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, Goyal and Li [2015] and Cohen [2015]. 1) We construct the first expli
Externí odkaz:
http://arxiv.org/abs/2109.03097
Autor:
Kapshikar, Upendra S.
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 correct errors even when they can not uniquely pinpoint the error. The diag
Externí odkaz:
http://arxiv.org/abs/2107.11286
Publikováno v:
Quantum 7, 1178 (2023)
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 is to protect the stored message or abort the protocol if there is any
Externí odkaz:
http://arxiv.org/abs/2105.04487
Autor:
Kapshikar, Upendra, Mahalanobis, Ayan
McEliece and Niederreiter cryptosystems are robust and versatile cryptosystems. These cryptosystems work with many linear error-correcting codes. They are popular these days because they can be quantum-secure. In this paper, we study the Niederreiter
Externí odkaz:
http://arxiv.org/abs/1911.00661
Autor:
Kapshikar, Upendra
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 quantum Fourier sampling making it quantum secure. We propose a new v
Externí odkaz:
http://arxiv.org/abs/1805.09972
Autor:
Kapshikar, Upendra, Mahalanobis, Ayan
Publikováno v:
In Proceedings of the 15th International Joint Conference on e-Business and Telecommunications (ICETE 2018) - Volume 2 SECRYPT, pages 340-347
In this paper, we describe a new Niederreiter cryptosystem based on quasi-cyclic $\frac{m-1}{m}$ codes that is quantum-secure. This new cryptosystem has good transmission rate compared to the one using binary Goppa codes and uses smaller keys.
C
C
Externí odkaz:
http://arxiv.org/abs/1803.07827
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.