KSKannan Srinathan

Kannan Srinathan

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Kannan Srinathan has a total of 33 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Revocation and reconstruction of shared quantum states

    by Prakash Mudholkar, Chiranjeevi Vanarasa, Indranil Chakrabarty, Srinathan Kannan

  • Open Access

    S-BAN: Secure Biometric Authentication using Noise

    by Praguna Manvi, Achintya M Desai, Kannan Srinathan, Anoop Namboodiri

    Biometric signal consisting of irrelevant or non-distinctive features can contain useful correlational properties that privacy-preserving verification schemes can exploit. While an efficient protocol for iris verification using noise has been presented [33], it is not applicable to other widely used modalities, i.e., face and fingerprint, since the methods of noise extraction and comparison are different. In this work, we design a verification protocol for secure dot product computation and also propose noise extraction mechanisms for face and fingerprint modalities. We evaluate the performance of the protocol on CFP, LFW, CelebA, FVC 2004 DB1A, DB2A, DB3A, and SOCOFing datasets. While the protocol exhibits a slight degradation in accuracy, it provides information-theoretic security with a practical computational complexity.

  • Open Access

    Interlude: Balancing Chaos And Harmony For Fair and Fast Blockchains

    by Anurag Jain, Sujit Gujar, Kannan Srinathan

    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 support greater demand while maintaining their desirable security properties. In an exciting line of recent work, many researchers have proposed various scalable blockchain protocols that demonstrate the potential to solve these challenges. However, many of these protocols come with the assumptions of honest majority and symmetric network access which may not accurately reflect the real world where the participants may be self-interested or rational. Secondly, these works show that their protocol works in an ideal environment where each party has equal access to the network whereas different parties have varying latencies and network speeds. These assumptions may render the protocols susceptible to security threats in the real world, as highlighted by the literature focused on exploring game-theoretic attacks on these protocols. We propose a scalable blockchain protocol, Interlude, which comes with the typical security guarantees while focusing on game-theoretic soundness and network fairness. The novelty of Interlude is that it has a relatively simple design consisting of a sequence of parallel blocks containing disjoint transaction sets that can be mined quickly followed by a series block that is slow to mine and gives the honest parties in the network time to synchronize. Thus, between the chaos of parallel blocks, our blockchain protocol masquerades an interlude moment of harmony in series blocks that synchronize the network.

  • On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission

    by Ravi Kishore, Ashutosh Kumar, Chiranjeevi Vanarasa, Kannan Srinathan

    In a network of n nodes (modelled as a digraph), the goal of a perfectly secret message transmission (PSMT) protocol is to replicate sender’s message m at the receiver’s end without revealing any information about m to a computationally unbounded adversary that eavesdrops on any t nodes. The adversary may be mobile too – that is, it may eavesdrop on a different set of t nodes in different rounds. We prove a necessary and sufficient condition on the synchronous network for the existence of r-round PSMT protocols, for any given r > 0; further, we show that round-optimality is achieved without trading-off the communication complexity; specifically, our protocols have an overall communication complexity of O(n) elements of a finite field to perfectly transmit one field element. Apart from optimality/scalability, two interesting implications of our results are: (a) adversarial mobility does not affect its tolerability: PSMT tolerating a static t-adversary is possible if and only if PSMT tolerating mobile t-adversary is possible; and (b) mobility does not affect the round optimality: the fastest PSMT protocol tolerating a static t-adversary is not faster than the one tolerating a mobile t-adversary.


  • Open Access

    Efficient Range Reporting of Convex Hull

    by Jatin Agarwal, Nadeem Moidu, Kishore Kothapalli, Kannan Srinathan

    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 minimum convex polygon formed by $S$. In this paper, we are interested in finding the points that lie on the boundary of the convex hull of the points in $P$ that also fall with in an orthogonal range$[x_{lt},x_{rt}]\times{}[y_b, y_t]$. We propose a $O(n \log^{2} n) $ space data structure that can support reporting points on a convex hull inside an orthogonal range query, in time $O(\log^{3} n + h)$. Here $h$ is the size of the output. This work improves the result of (Brass et al. 2013) \cite{brass} that builds a data structure that uses $O(n \log^{2} n)$ space and has a $O(\log^{5} n + h)$ query time. Additionally, we show that our data structure can be modified slightly to solve other related problems. For instance, for counting the number of points on the convex hull in an orthogonal query rectangle, we propose an $O(n \log^{2}n)$ space data structure that can be queried upon in $O(\log^{3} n)$ time. We also propose a $O(n \log^{2} n) $ space data structure that can compute the $area$ and $perimeter$ of the convex hull inside an orthogonal range query in $O(\log^{3} n$) time.

  • Open Access

    Exploring the Role of Logically Related Non-Question Phrases for Answering Why-Questions

    by Niraj Kumar, Rashmi Gangadharaiah, Kannan Srinathan, Vasudeva Varma

    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 question phrases for extracting answers, but also improves the quality of the extracted answers. Here matching question phrases means phrases which co-occur in given question and candidate answers. To achieve the above discussed goal, we introduce a bigram-based word graph model populated with semantic and topical relatedness of terms in the given document. Next, we apply an improved version of ranking with a prior-based approach, which ranks all words in the candidate document with respect to a set of root words (i.e. non-stopwords present in the question and in the candidate document). As a result, terms logically related to the root words are scored higher than terms that are not related to the root words. Experimental results show that our devised system performs better than state-of-the-art for the task of answering Why-questions.

  • Open Access

    A New Look at Composition of Authenticated Byzantine Generals

    by Anuj Gupta, Prasant Gopal, Piyush Bansal, Kannan Srinathan

    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 study the self-composition of ABG protocols. The central dogma of our approach can be phrased as follows: Consider a player who diligently executes (only) the delegated protocol but the adversary steals some private information from him. Should such a player be considered faulty? With respect to ABG protocols, we argue that the answer has to be no. In the new model we show that in spite of using unique session identifiers, if $n < 2t$, there cannot exist any ABG protocol that composes in parallel even twice. Further, for $n \geq 2t$, we design ABG protocols that compose for any number of parallel executions. Besides investigating the composition of ABG under a new light, our work also brings out several new insights into Canetti's Universal Composability framework. Specifically, we show that there are several undesirable effects if one deviates from our dogma. This provides further evidence as to why our dogma is the right framework to study the composition of ABG protocols.