|
Search the dblp DataBase
K. Srinathan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- M. V. N. Ashwin Kumar, K. Srinathan, C. Pandu Rangan
Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries. [Citation Graph (0, 0)][DBLP] ACISP, 2002, pp:497-512 [Conf]
- K. Srinathan, M. V. N. Ashwin Kumar, C. Pandu Rangan
Asynchronous Secure Communication Tolerating Mixed Adversaries. [Citation Graph (0, 0)][DBLP] ASIACRYPT, 2002, pp:224-242 [Conf]
- K. Srinathan, Pranava R. Goundan, M. V. N. Ashwin Kumar, R. Nandakumar, C. Pandu Rangan
Theory of Equal-Flows in Networks. [Citation Graph (0, 0)][DBLP] COCOON, 2002, pp:514-524 [Conf]
- K. Srinathan, Arvind Narayanan, C. Pandu Rangan
Optimal Perfectly Secure Message Transmission. [Citation Graph (0, 0)][DBLP] CRYPTO, 2004, pp:545-561 [Conf]
- Arpita Patra, Ashish Choudhary, K. Srinathan, C. Pandu Rangan
Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission. [Citation Graph (0, 0)][DBLP] INDOCRYPT, 2006, pp:221-235 [Conf]
- B. Prabhu, K. Srinathan, C. Pandu Rangan
Asynchronous Unconditionally Secure Computation: An Efficiency Improvement. [Citation Graph (0, 0)][DBLP] INDOCRYPT, 2002, pp:93-107 [Conf]
- K. Srinathan, C. Pandu Rangan
Efficient Asynchronous Secure Multiparty Distributed Computation. [Citation Graph (0, 0)][DBLP] INDOCRYPT, 2000, pp:117-129 [Conf]
- K. Srinathan, C. Pandu Rangan
Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation. [Citation Graph (0, 0)][DBLP] INDOCRYPT, 2000, pp:130-142 [Conf]
- K. Srinathan, C. Pandu Rangan, V. Kamakoti
Toward Optimal Player Weights in Secure Distributed Protocols. [Citation Graph (0, 0)][DBLP] INDOCRYPT, 2001, pp:232-241 [Conf]
- K. Srinathan, N. Tharani Rajan, C. Pandu Rangan
Non-perfect Secret Sharing over General Access Structures. [Citation Graph (0, 0)][DBLP] INDOCRYPT, 2002, pp:409-421 [Conf]
- V. Vinod, Arvind Narayanan, K. Srinathan, C. Pandu Rangan, Kwangjo Kim
On the Power of Computational Secret Sharing. [Citation Graph (0, 0)][DBLP] INDOCRYPT, 2003, pp:162-176 [Conf]
- S. Amitanand, I. Sanketh, K. Srinathan, V. Vinod, C. Pandu Rangan
Distributed consensus in the presence of sectional faults. [Citation Graph (0, 0)][DBLP] PODC, 2003, pp:202-210 [Conf]
- M. V. N. Ashwin Kumar, Pranava R. Goundan, K. Srinathan, C. Pandu Rangan
On perfectly secure cmmunication over arbitrary networks. [Citation Graph (0, 0)][DBLP] PODC, 2002, pp:193-202 [Conf]
- D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan
Brief announcement: on the round complexity of distributed consensus over synchronous networks. [Citation Graph (0, 0)][DBLP] PODC, 2004, pp:397- [Conf]
- K. Srinathan, V. Vinod, C. Pandu Rangan
Brief announcement: efficient perfectly secure communication over synchronous networks. [Citation Graph (0, 0)][DBLP] PODC, 2003, pp:252- [Conf]
- B. Prabhu, K. Srinathan, C. Pandu Rangan
Trading Players for Efficiency in Unconditional Multiparty Computation. [Citation Graph (0, 0)][DBLP] SCN, 2002, pp:342-353 [Conf]
- Matthias Fitzi, Juan A. Garay, Shyamnath Gollakota, C. Pandu Rangan, K. Srinathan
Round-Optimal and Efficient Verifiable Secret Sharing. [Citation Graph (0, 0)][DBLP] TCC, 2006, pp:329-342 [Conf]
- D. V. S. Ravikant, Muthuramakrishnan Venkitasubramaniam, V. Srikanth, K. Srinathan, C. Pandu Rangan
On Byzantine Agreement over (2, 3)-Uniform Hypergraphs. [Citation Graph (0, 0)][DBLP] DISC, 2004, pp:450-464 [Conf]
- Arvind Narayanan, K. Srinathan, C. Pandu Rangan
Perfectly Reliable Message Transmission. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2006, v:100, n:1, pp:23-28 [Journal]
- Arpita Patra, Bhavani Shankar, Ashish Choudhary, K. Srinathan, C. Pandu Rangan
Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary. [Citation Graph (0, 0)][DBLP] CANS, 2007, pp:80-101 [Conf]
Efficient Biometric Verification in Encrypted Domain. [Citation Graph (, )][DBLP]
Brief announcement: topology knowledge affects probabilistic reliable communication. [Citation Graph (, )][DBLP]
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary. [Citation Graph (, )][DBLP]
Covering hostile terrains with partial and complete visibilities: On minimum distance paths. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.322secs
|