Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Kaushik Senthoor"'
Publikováno v:
IEEE Transactions on Information Theory. 68:3164-3186
A $((k,n))$ quantum threshold secret sharing (QTS) scheme is a quantum cryptographic protocol for sharing a quantum secret among $n$ parties such that the secret can be recovered by any $k$ or more parties while $k-1$ or fewer parties have no informa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3616fabcde1cb905e1585239c39cdf7
https://doi.org/10.1109/tit.2021.3139839
https://doi.org/10.1109/tit.2021.3139839
Publikováno v:
ITW
Quantum secret sharing (QSS) is a cryptographic protocol in which a quantum secret is distributed among a number of parties where some subsets of the parties are able to recover the secret while some subsets are unable to recover the secret. In the s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fceb10df42b8b8fe53f893779227d9cb
In the standard model of quantum secret sharing, typically, one is interested in minimal authorized sets for the reconstruction of the secret. In such a setting, reconstruction requires the communication of all the shares of the corresponding authori
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3f9e632cd63658f3886427bdbfbced9b
Autor:
H.V. Ranjitha, Tarun Choubisa, Raviteja Upadrashta, Joy Kuri, Anurag Kumar, Malati Hegde, A. Praneeth, Madhuri Sheethala Iyer, S. V. R. Anand, Ashwath Narayan Singh, T. V. Prabhakar, P. Vijay Kumar, Sumankumar D. Panchal, Abhijit Bhattacharya, Kaushik Senthoor, Abhirami Sampath
Publikováno v:
LCN Workshops
The aim of the current paper is to describe the challenges faced during the development and deployment of a PIR sensor-based intrusion classification system in an outdoor environment. Some potential solutions to overcome these challenges are also pre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2239747d00363a3631b08ff5f609f1b4
https://doi.org/10.1109/lcn.2016.041
https://doi.org/10.1109/lcn.2016.041
Publikováno v:
ITW
The characterization of the storage-repair bandwidth tradeoff of (n, k, d)-regenerating codes under the exact-repair setting remains an open problem. The problem has been solved only for the special case of (n, k, d) = (4, 3, 3). In the present paper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7427476d8ca89591e1e9af31fe83d9fd
https://igi.indrastra.com/items/show/186623
https://igi.indrastra.com/items/show/186623
Publikováno v:
ISIT
In this paper we establish an improved outer bound on the storage-repair-bandwidth tradeoff of regenerating codes under exact repair. The result shows that in particular, it is not possible to construct exact-repair regenerating codes that asymptotic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b588aa4de31a6474cb162cb2c6022d4e
http://arxiv.org/abs/1312.6079
http://arxiv.org/abs/1312.6079
Autor:
Birenjith Sasidharan, M. Nikhil Krishnan, Kaushik Senthoor, N. Prakash, Myna Vajha, P. Vijay Kumar
Publikováno v:
International Journal of Information and Coding Theory. 3:255
In this paper, three outer bounds on the normalised storage-repair bandwidth trade-off of regenerating codes having parameter set {n, k, d, α, β} under the exact-repair ER setting are presented. The first outer bound, termed as the repair-matrix bo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6ea6433c05bc9531c8780dc045dad934
https://doi.org/10.1504/ijicot.2016.079498
https://doi.org/10.1504/ijicot.2016.079498