Zobrazeno 1 - 10
of 77
pro vyhledávání: '"SRINATHAN, KANNAN"'
Blockchains lie at the heart of Bitcoin and other cryptocurrencies that have shown great promise to revolutionize finance and commerce. Although they are gaining increasing popularity, they face technical challenges when it comes to scaling to suppor
Externí odkaz:
http://arxiv.org/abs/2209.10125
Publikováno v:
Quant. Inf. Proc. Volume 14, Issue 12, pp 4651-4664 (2015)
In extant quantum secret sharing protocols, once the secret is shared in a quantum network (\textsc{qnet}) it can not be retrieved back, even if the dealer wishes that her secret no longer be available in the network. For instance, if the dealer is p
Externí odkaz:
http://arxiv.org/abs/1311.5378
We consider the problem of reporting convex hull points in an orthogonal range query in two dimensions. Formally, let $P$ be a set of $n$ points in $\mathbb{R}^{2}$. A point lies on the convex hull of a point set $S$ if it lies on the boundary of the
Externí odkaz:
http://arxiv.org/abs/1307.5612
In this paper, we show that certain phrases although not present in a given question/query, play a very important role in answering the question. Exploring the role of such phrases in answering questions not only reduces the dependency on matching qu
Externí odkaz:
http://arxiv.org/abs/1303.7310
The problem of Authenticated Byzantine Generals (ABG) aims to simulate a virtual reliable broadcast channel from the General to all the players via a protocol over a real (point-to-point) network in the presence of faults. We propose a new model to s
Externí odkaz:
http://arxiv.org/abs/1203.1463
Publikováno v:
In Journal of Discrete Algorithms January 2015 30:78-95
Publikováno v:
In Theoretical Computer Science 22 July 2013 496:2-16
Autor:
Choudhury, Ashish a, Patra, Arpita b, ⁎, Ashwinkumar, B.V. c, Srinathan, Kannan d, Pandu Rangan, C. e
Publikováno v:
In Journal of Parallel and Distributed Computing 2011 71(8):1067-1074
Publikováno v:
Information Processing Letters. 131:1-6
In a synchronous distributed network of n nodes, the goal of a Secure Message Transmission (SMT) protocol is to securely deliver the sender's message at the receiver's end in the presence of a computationally unbounded adversary that can partially co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b52148f0d58af731a5215bf9aa23368e
https://doi.org/10.1016/j.ipl.2017.11.001
https://doi.org/10.1016/j.ipl.2017.11.001
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.