K
Kannan Srinathan
Researcher at International Institute of Information Technology, Hyderabad
Publications - 136
Citations - 2245
Kannan Srinathan is an academic researcher from International Institute of Information Technology, Hyderabad. The author has contributed to research in topics: Secure multi-party computation & Secret sharing. The author has an hindex of 24, co-authored 133 publications receiving 2105 citations. Previous affiliations of Kannan Srinathan include Indian Institute of Technology Madras & Indian Institutes of Technology.
Papers
More filters
Journal ArticleDOI
Blind Authentication: A Secure Crypto-Biometric Verification Protocol
TL;DR: Experimental results on four biometric datasets show that carrying out the authentication in the encrypted domain does not affect the accuracy, while the encryption key acts as an additional layer of security.
Proceedings ArticleDOI
A performance prediction model for the CUDA GPGPU platform
Kishore Kothapalli,Rishabh Mukherjee,M. Suhail Rehman,Suryakant Patidar,P. J. Narayanan,Kannan Srinathan +5 more
TL;DR: This paper presents a performance prediction model for the CUDA GPGPU platform that encompasses the various facets of the GPU architecture like scheduling, memory hierarchy, and pipelining among others and can be used to analyze pseudo code for a CUDA kernel to obtain a performance estimate.
Proceedings ArticleDOI
Efficient privacy preserving video surveillance
TL;DR: This paper proposes an efficient framework to carry out privacy preserving surveillance by splitting each frame into a set of random images, which enables distributed secure processing and storage, while retaining the ability to reconstruct the original data in case of a legal requirement.
BookDOI
Progress in Cryptology – INDOCRYPT 2007
TL;DR: Thank you for reading progress in cryptology indocrypt 2004 5th international conference on cryptology in india chennai india december 20 22 2004 proceedings.
Proceedings ArticleDOI
On perfectly secure communication over arbitrary networks
TL;DR: It is shown that perfectly secure communication among any pair of players is possible if and only if the union of no two sets in the adversary structure is a vertex cutset of the synchronous network.