The following pages link to Kannan Srinathan (Q391241):
Displaying 46 items.
- (Q264890) (redirect page) (← links)
- Retrieving and routing quantum information in a quantum network (Q264891) (← links)
- Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission (Q391242) (← links)
- Secure message transmission in asynchronous networks (Q635383) (← links)
- Data structures for extension violations in a query range (Q662125) (← links)
- Perfectly reliable message transmission (Q845819) (← links)
- Perfectly reliable and secure message transmission tolerating mobile adversary (Q1017544) (← links)
- ATSSIA: asynchronous truly-threshold Schnorr signing for inconsistent availability (Q2104418) (← links)
- Reporting and counting maximal points in a query orthogonal rectangle (Q2253906) (← links)
- Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality (Q2430146) (← links)
- On reporting the \(L_1\) metric closest pair in a query rectangle (Q2446069) (← links)
- (Q2707598) (← links)
- (Q2707599) (← links)
- Range Aggregate Maximal Points in the Plane (Q2889900) (← links)
- On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary (Q2934339) (← links)
- Efficient single phase unconditionally secure message transmission with optimum communication complexity (Q2934366) (← links)
- Minimal Connectivity for Unconditionally Secure Message Transmission in Synchronous Directed Networks (Q3002100) (← links)
- DMIPS - Defensive Mechanism against IP Spoofing (Q3012995) (← links)
- Range-Aggregate Queries Involving Geometric Aggregation Operations (Q3078390) (← links)
- Byzantine Agreement Using Partial Authentication (Q3095344) (← links)
- Secure Message Transmission in Asynchronous Directed Graphs (Q3104754) (← links)
- Secret Sharing for mNP: Completeness Results (Q3179496) (← links)
- Authenticated Byzantine Generals in Dual Failure Model (Q3406476) (← links)
- Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary (Q3523232) (← links)
- (Q3579425) (← links)
- On Proactive Perfectly Secure Message Transmission (Q3608939) (← links)
- On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks (Q3616571) (← links)
- On Exponential Lower Bound for Protocols for Reliable Communication in Networks (Q3649190) (← links)
- Asynchronous Secure Communication Tolerating Mixed Adversaries (Q4412800) (← links)
- (Q4413003) (← links)
- (Q4417424) (← links)
- On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission (Q4566712) (← links)
- (Q4788579) (← links)
- (Q4808674) (← links)
- Counting Maximal Points in a Query Orthogonal Rectangle (Q4914436) (← links)
- On perfectly secure communication over arbitrary networks (Q5170880) (← links)
- Possibility and complexity of probabilistic reliable communication in directed networks (Q5177288) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311556) (← links)
- On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission (Q5395691) (← links)
- Alternative Protocols for Generalized Oblivious Transfer (Q5445771) (← links)
- Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality (Q5458204) (← links)
- Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission (Q5458278) (← links)
- Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary (Q5458496) (← links)
- Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary (Q5502798) (← links)
- On Generalized Planar Skyline and Convex Hull Range Queries (Q5746242) (← links)
- Theory of Cryptography (Q5898362) (← links)
