K. Srinathan

Orcid: 0009-0002-4306-6707

According to our database1, K. Srinathan authored at least 121 papers between 2000 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
PIUDI: Private Information Update for Distributed Infrastructure.
Proceedings of the 20th International Conference on Security and Cryptography, 2023

S-BAN: Secure Biometric Authentication using Noise.
Proceedings of the Fourteenth Indian Conference on Computer Vision, 2023

2022
Interlude: Balancing Chaos And Harmony For Fair and Fast Blockchains.
CoRR, 2022

SIAN: Secure Iris Authentication using Noise.
Proceedings of the IEEE International Joint Conference on Biometrics, 2022

2021
ATSSIA: Asynchronous Truly-Threshold Schnorr Signing for Inconsistent Availability.
Proceedings of the Information Security and Cryptology - ICISC 2021, 2021

2020
Multiplicative Depth Independent & Efficient MPC in the Presence of Mixed Adversary.
IACR Cryptol. ePrint Arch., 2020

2019
Certificate-Based Anonymous Device Access Control Scheme for IoT Environment.
IEEE Internet Things J., 2019

Perfectly secure message transmission over partially synchronous networks.
Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019

2018
On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission.
IEEE Trans. Inf. Theory, 2018

On minimal connectivity requirements for secure message transmission in directed networks.
Inf. Process. Lett., 2018

2017
Nearly Balanced Work Partitioning for Heterogeneous Algorithms.
Proceedings of the 46th International Conference on Parallel Processing, 2017

2016
Unsupervised deep semantic and logical analysis for identification of solution posts from community answers.
Int. J. Inf. Decis. Sci., 2016

A graph-based unsupervised N-gram filtration technique for automatic keyphrase extraction.
Int. J. Data Min. Model. Manag., 2016

Discovering Vulnerable Functions: A Code Similarity Based Approach.
Proceedings of the Security in Computing and Communications - 4th International Symposium, 2016

Secret Sharing for mNP: Completeness Results.
Proceedings of the Progress in Cryptology - INDOCRYPT 2016, 2016

Discovering Vulnerable Functions by Extrapolation: A Control-Flow Graph Similarity Based Approach.
Proceedings of the Information Systems Security - 12th International Conference, 2016

On perfectly secret message transmission in digraphs tolerating dual failures.
Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

2015
Retrieving and routing quantum information in a quantum network.
Quantum Inf. Process., 2015

Reporting and counting maximal points in a query orthogonal rectangle.
J. Discrete Algorithms, 2015

A Novel Heterogeneous Algorithm for Multiplying Scale-Free Sparse Matrices.
Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium Workshop, 2015

Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity.
Proceedings of the Information Theoretic Security - 8th International Conference, 2015

2014
On reporting the L<sub>1</sub> metric closest pair in a query rectangle.
Inf. Process. Lett., 2014

On Generalized Planar Skyline and Convex Hull Range Queries.
Proceedings of the Algorithms and Computation - 8th International Workshop, 2014

Choosing and Working of an Anonymous Leader.
Proceedings of the Applied Algorithms - First International Conference, 2014

Improved Bounds for Smallest Enclosing Disk Range Queries.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Interplay between (im)perfectness, synchrony and connectivity: The case of reliable message transmission.
Theor. Comput. Sci., 2013

Efficient Range Reporting of Convex Hull.
CoRR, 2013

Counting Maximal Points in a Query Orthogonal Rectangle.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

A Knowledge Induced Graph-Theoretical Model for Extract and Abstract Single Document Summarization.
Proceedings of the Computational Linguistics and Intelligent Text Processing, 2013

Allowing Multiple Rounds in the Shared Whiteboard Model: Some More Impossibility Results.
Proceedings of the 2013 2nd International Conference on Advanced Computing, 2013

2012
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission.
J. ACM, 2012

A New Look at Composition of Authenticated Byzantine Generals
CoRR, 2012

Range Aggregate Maximal Points in the Plane.
Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

WYSWYE: shoulder surfing defense for recognition based graphical passwords.
Proceedings of the 24th Australian Computer-Human Interaction Conference, OzCHI '12, Melbourne, VIC, Australia - November 26, 2012

Using Wikipedia Anchor Text and Weighted Clustering Coefficient to Enhance the Traditional Multi-document Summarization.
Proceedings of the Computational Linguistics and Intelligent Text Processing, 2012

Using Graph Based Mapping of Co-occurring Words and Closeness Centrality Score for Summarization Evaluation.
Proceedings of the Computational Linguistics and Intelligent Text Processing, 2012

2011
Secure message transmission in asynchronous networks.
J. Parallel Distributed Comput., 2011

Data Structures for Extension Violations in a Query Range.
J. Math. Model. Algorithms, 2011

Minimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks.
IACR Cryptol. ePrint Arch., 2011

Unconditionally Reliable Message Transmission in Directed Neighbour Networks.
IACR Cryptol. ePrint Arch., 2011

Secure Message Transmission In Asynchronous Directed Networks.
IACR Cryptol. ePrint Arch., 2011

Byzantine Agreement Using Partial Authentication.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Range-Aggregate Queries Involving Geometric Aggregation Operations.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Using Unsupervised System with least linguistic features for TAC-AESOP Task.
Proceedings of the Fourth Text Analysis Conference, 2011

NAPTune: fine tuning graphical authentication.
Proceedings of the 3rd International Conference on Human Computer Interaction, 2011

Secure Message Transmission in Asynchronous Directed Graphs.
Proceedings of the Progress in Cryptology - INDOCRYPT 2011, 2011

Privacy Preserving Outlier Detection Using Locality Sensitive Hashing.
Proceedings of the Data Mining Workshops (ICDMW), 2011

LSH based outlier detection and its application in distributed setting.
Proceedings of the 20th ACM Conference on Information and Knowledge Management, 2011

MARASIM: a novel jigsaw based authentication scheme using tagging.
Proceedings of the International Conference on Human Factors in Computing Systems, 2011

On Finding Skyline Points for Range Queries in Plane.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Finding Maximum Density Axes Parallel Regions for Weighted Point Sets.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Detecting VLSI Layout, Connectivity Errors in a Query Window.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

An Oblivious Image Retrieval Protocol.
Proceedings of the 25th IEEE International Conference on Advanced Information Networking and Applications Workshops, 2011

DMIPS - Defensive Mechanism against IP Spoofing.
Proceedings of the Information Security and Privacy - 16th Australasian Conference, 2011

2010
Blind authentication: a secure crypto-biometric verification protocol.
IEEE Trans. Inf. Forensics Secur., 2010

Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality.
Int. J. Appl. Cryptogr., 2010

Brief Announcement: Synchronous Las Vegas URMT Iff Asynchronous Monte Carlo URMT.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

An Effective Approach for AESOP and Guided Summarization Task.
Proceedings of the Third Text Analysis Conference, 2010

Efficient Privacy Preserving K-Means Clustering.
Proceedings of the Intelligence and Security Informatics, Pacific Asia Workshop, 2010

On Composability of Reliable Unicast and Broadcast.
Proceedings of the Distributed Computing and Networking, 11th International Conference, 2010

Exploiting N-gram Importance and Wikipedia based Additional Knowledge for Improvements in GAAC based Document Clustering.
Proceedings of the KDIR 2010, 2010

Evaluating Information Coverage in Machine Generated Summary and Variable Length Documents.
Proceedings of the 16th International Conference on Management of Data, 2010

PhotoSense: emergent semantics based approach to image annotation.
Proceedings of the 28th International Conference on Human Factors in Computing Systems, 2010

2009
Perfectly reliable and secure message transmission tolerating mobile adversary.
Int. J. Appl. Cryptogr., 2009

Brief announcement: topology knowledge affects probabilistic reliable communication.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Brief announcement: global consistency can be easier than point-to-point communication.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Let Only the Right One IN: Privacy Management Scheme for Social Network.
Proceedings of the Information Systems Security, 5th International Conference, 2009

On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

Efficient privacy preserving video surveillance.
Proceedings of the IEEE 12th International Conference on Computer Vision, ICCV 2009, Kyoto, Japan, September 27, 2009

Efficient Biometric Verification in Encrypted Domain.
Proceedings of the Advances in Biometrics, Third International Conference, 2009

A performance prediction model for the CUDA GPGPU platform.
Proceedings of the 16th International Conference on High Performance Computing, 2009

Data Structures for Reporting Extension Violations in a Query Range.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

On fast exploration in 2D and 3D terrains with multiple robots.
Proceedings of the 8th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2009), 2009

Generalized Robust Combiners for Oblivious Transfer.
Proceedings of the The Forth International Conference on Availability, 2009

On Privacy Preserving Convex Hull.
Proceedings of the The Forth International Conference on Availability, 2009

Secured Multi-robotic Active Localization without Exchange of Maps: A Case of Secure Cooperation Amongst Non-trusting Robots.
Proceedings of the The Forth International Conference on Availability, 2009

2008
How Far Must You See To Hear Reliably.
IACR Cryptol. ePrint Arch., 2008

Unconditionally Secure Message Transmission in Arbitrary Directed Synchronous Networks Tolerating Generalized Mixed Adversary.
IACR Cryptol. ePrint Arch., 2008

Unconditionally Reliable Message Transmission in Directed Hypergraphs.
IACR Cryptol. ePrint Arch., 2008

Perfectly Secure Message Transmission Tolerating Mixed Adversary.
IACR Cryptol. ePrint Arch., 2008

Authenticated Byzantine Generals in Dual Failure Model.
IACR Cryptol. ePrint Arch., 2008

Unconditionally reliable message transmission in directed networks.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Efficient single phase unconditionally secure message transmission with optimum communication complexity.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Covering hostile terrains with partial and complete visibilities: On minimum distance paths.
Proceedings of the 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2008

Fast and Secure Real-Time Video Encryption.
Proceedings of the Sixth Indian Conference on Computer Vision, Graphics & Image Processing, 2008

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary.
Proceedings of the Information Theoretic Security, Third International Conference, 2008

A novel video encryption technique based on secret sharing.
Proceedings of the International Conference on Image Processing, 2008

Alternative Protocols for Generalized Oblivious Transfer.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

Automatic keyphrase extraction from scientific documents using N-gram filtration technique.
Proceedings of the 2008 ACM Symposium on Document Engineering, 2008

Private Content Based Image Retrieval.
Proceedings of the 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR 2008), 2008

On reduced time fault tolerant paths for multiple UAVs covering a hostile terrain.
Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), 2008

Privacy Preserving Shortest Path Computation in Presence of Convex Polygonal Obstacles.
Proceedings of the The Third International Conference on Availability, 2008

2007
Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication.
Proceedings of the 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007

Privacy Preserving Computation of Shortest Path in Presence of a Single Convex Polygonal Obstacle.
Proceedings of the 8th International Conference on Mobile Data Management (MDM 2007), 2007

Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality.
Proceedings of the Progress in Cryptology, 2007

On Exponential Lower Bound for Protocols for Reliable Communication in Networks.
Proceedings of the Information Theoretic Security - Second International Conference, 2007

Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks.
Proceedings of the Distributed Computing and Internet Technology, 2007

Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary.
Proceedings of the Cryptology and Network Security, 6th International Conference, 2007

On Proactive Perfectly Secure Message Transmission.
Proceedings of the Information Security and Privacy, 12th Australasian Conference, 2007

2006
Perfectly Reliable Message Transmission.
Inf. Process. Lett., 2006

Round-Optimal and Efficient Verifiable Secret Sharing.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Possibility and complexity of probabilistic reliable communication in directed networks.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission.
Proceedings of the Progress in Cryptology, 2006

2004
On Byzantine Agreement over (2, 3)-Uniform Hypergraphs.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Brief announcement: on the round complexity of distributed consensus over synchronous networks.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Optimal Perfectly Secure Message Transmission.
Proceedings of the Advances in Cryptology, 2004

2003
Brief announcement: efficient perfectly secure communication over synchronous networks.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Distributed consensus in the presence of sectional faults.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

On the Power of Computational Secret Sharing.
Proceedings of the Progress in Cryptology, 2003

2002
Trading Players for Efficiency in Unconditional Multiparty Computation.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

On perfectly secure cmmunication over arbitrary networks.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Non-perfect Secret Sharing over General Access Structures.
Proceedings of the Progress in Cryptology, 2002

Asynchronous Unconditionally Secure Computation: An Efficiency Improvement.
Proceedings of the Progress in Cryptology, 2002

Theory of Equal-Flows in Networks.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

Asynchronous Secure Communication Tolerating Mixed Adversaries.
Proceedings of the Advances in Cryptology, 2002

Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries.
Proceedings of the Information Security and Privacy, 7th Australian Conference, 2002

2001
Toward Optimal Player Weights in Secure Distributed Protocols.
Proceedings of the Progress in Cryptology, 2001

2000
Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation.
Proceedings of the Progress in Cryptology, 2000

Efficient Asynchronous Secure Multiparty Distributed Computation.
Proceedings of the Progress in Cryptology, 2000


  Loading...