The SCEAS System
| |||||||

## Search the dblp DataBase
C. Pandu Rangan:
[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] - Arvind Narayanan, C. Pandu Rangan, Kwangjo Kim
**Practical Pay TV Schemes.**[Citation Graph (0, 0)][DBLP] ACISP, 2003, pp:192-203 [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] - Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. Pandu Rangan
**The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries.**[Citation Graph (0, 0)][DBLP] COCOON, 1998, pp:35-44 [Conf] - V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan
**Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees.**[Citation Graph (0, 0)][DBLP] COCOON, 1995, pp:71-80 [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] - S. V. Krishnan, C. Pandu Rangan, S. Seshadri
**A New Linear Algorithm for the Two Path Problem on Chordal Graphs.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1988, pp:49-66 [Conf] - A. Srinivasa Rao, C. Pandu Rangan
**Optimal Parallel Algorithms on Circular-Arc Graphs.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1989, pp:44-55 [Conf] - G. D. S. Ramkumar, C. Pandu Rangan
**Parallel Algorithms on Interval Graphs.**[Citation Graph (0, 0)][DBLP] ICPP (3), 1990, pp:72-74 [Conf] - P. Jagan Mohan, V. Kamakoti, C. Pandu Rangan
**Efficient Randomized Parallel Algorithm for the Closest Pair Problem in D-dimension.**[Citation Graph (0, 0)][DBLP] IFIP Congress (1), 1994, pp:547-552 [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] - Ahmed Saoudi, Maurice Nivat, C. Pandu Rangan, Ravi Sundaram, G. D. S. Ramkumar
**A Parallel Algorithm for Recognizing the Shuffle of Two Strings.**[Citation Graph (0, 0)][DBLP] IPPS, 1992, pp:112-115 [Conf] - Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg
**Weighted Independent Perfect Domination on Cocomparability Graphs.**[Citation Graph (0, 0)][DBLP] ISAAC, 1993, pp:506-514 [Conf] - C. P. Gopalakrishnan, C. Pandu Rangan
**Edge-Disjoint Paths in Permutation Graphs.**[Citation Graph (0, 0)][DBLP] ISAAC, 1994, pp:208-216 [Conf] - C. Pandu Rangan, Maw-Shang Chang
**Weighted Irredundance of Interval Graphs.**[Citation Graph (0, 0)][DBLP] ISAAC, 1994, pp:567-574 [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] - Kannan Srinathan, C. Pandu Rangan
**Possibility and complexity of probabilistic reliable communication in directed networks.**[Citation Graph (0, 0)][DBLP] PODC, 2006, pp:265-274 [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] - P. Krishna Prasad, C. Pandu Rangan
**Privacy Preserving BIRCH Algorithm for Clustering over Vertically Partitioned Databases.**[Citation Graph (0, 0)][DBLP] Secure Data Management, 2006, pp:84-99 [Conf] - Kannan Srinathan, N. R. Prasad, C. Pandu Rangan
**On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication.**[Citation Graph (0, 0)][DBLP] IEEE Symposium on Security and Privacy, 2007, pp:311-320 [Conf] - R. C. Chakinala, A. Kumarasubramanian, Kofi A. Laing, R. Manokaran, C. Pandu Rangan, Rajmohan Rajaraman
**Playing push vs pull: models and algorithms for disseminating dynamic data in networks.**[Citation Graph (0, 0)][DBLP] SPAA, 2006, pp:244-253 [Conf] - Sridhar Ramachandran, K. Rajasekar, C. Pandu Rangan
**Probabilistic Data Structures for Priority Queues (Extended Abstract).**[Citation Graph (0, 0)][DBLP] SWAT, 1998, pp:143-154 [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] - Hari Balakrishnan, Anand Rajaraman, C. Pandu Rangan
**Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs.**[Citation Graph (0, 0)][DBLP] WADS, 1993, pp:131-141 [Conf] - A. Srinivasa Rao, C. Pandu Rangan
**Linear Algorithms for Parity Path and Two Path Problems on Circular-Arc Graph.**[Citation Graph (0, 0)][DBLP] WADS, 1989, pp:267-290 [Conf] - Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan
**Treewidth of Circular-Arc Graphs (Abstract).**[Citation Graph (0, 0)][DBLP] WADS, 1991, pp:41- [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] - Ramesh Dewangan, C. Pandu Rangan
**A Simple Implementation of Warshall's Algorithm on a VLSI Chip.**[Citation Graph (0, 0)][DBLP] WG, 1986, pp:131-145 [Conf] - Ramesh Govindan, C. Pandu Rangan
**Competitive Location in the L**[Citation Graph (0, 0)][DBLP]_{1}and L_{INF}Metrics. WG, 1987, pp:70-83 [Conf] - Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
**The Vertex-Disjoint Triangles Problem.**[Citation Graph (0, 0)][DBLP] WG, 1998, pp:26-37 [Conf] - S. Kiran Kumar, C. Pandu Rangan
**A Linear Space Algorithm for the LCS Problem.**[Citation Graph (0, 0)][DBLP] Acta Inf., 1987, v:24, n:3, pp:353-362 [Journal] - K. S. Easwarakumar, S. V. Krishnan, C. Pandu Rangan, S. Seshadri
**Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1996, v:15, n:3, pp:242-255 [Journal] - P. B. Ramprasad, C. Pandu Rangan
**A Linear Algorithm for the All-Bidirectional-Edges Problem on Planar Graphs.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1993, v:9, n:3, pp:199-216 [Journal] - S. Sudarshan, C. Pandu Rangan
**A Fast Algorithm for Computing Sparse Visibility Graphs.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1990, v:5, n:2, pp:210-214 [Journal] - C. Pandu Rangan, K. R. Parthasarathy, V. Prakash
**On The g-centroidal Problem in Special Classes of Perfect Graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1998, v:50, n:, pp:- [Journal] - Srinivasa Rao Arikati, C. Pandu Rangan, Glenn K. Manacher
**Efficient Reduction for Path Problems on Circular-Arc Graphs.**[Citation Graph (0, 0)][DBLP] BIT, 1991, v:31, n:2, pp:182-193 [Journal] - Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong
**The K**[Citation Graph (0, 0)][DBLP]_{r}-Packing Problem. Computing, 2001, v:66, n:1, pp:79-89 [Journal] - V. Balachandhran, C. Pandu Rangan
**All-pairs-shortest-length on Strongly Chordal Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:69, n:1-2, pp:169-182 [Journal] - Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg
**Weighted Independent Perfect Domination on Cocomparability Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:63, n:3, pp:215-222 [Journal] - Venkatesan Guruswami, C. Pandu Rangan
**Algorithmic aspects of clique-transversal and clique-independent sets.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2000, v:100, n:3, pp:183-202 [Journal] - David G. Kirkpatrick, Madhukar K. Reddy, C. Pandu Rangan, Anand Srinivasan
**Partial and Perfect Path Covers of Cographs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1998, v:89, n:1-3, pp:143-153 [Journal] - Madhav V. Marathe, R. Ravi, C. Pandu Rangan
**Generalized Vertex Covering in Interval Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1992, v:39, n:1, pp:87-93 [Journal] - Satyan R. Coorg, C. Pandu Rangan
**The Parity Path Problem on Some Subclasses of Perfect Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1996, v:68, n:3, pp:293-302 [Journal] - R. Mahesh, C. Pandu Rangan, Aravind Srinivasan
**On Finding the Minimum Bandwidth of Interval Graphs**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1991, v:95, n:2, pp:218-224 [Journal] - G. Venkatesan, Udi Rotics, M. S. Madanlal, Johann A. Makowsky, C. Pandu Rangan
**Restrictions of Minimum Spanner Problems.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1997, v:136, n:2, pp:143-164 [Journal] - Rohan F. M. Aranha, C. Pandu Rangan
**An Efficient Distributed Algorithm for Centering a Spanning Tree of a Biconnected Graph.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1996, v:59, n:3, pp:145-150 [Journal] - Srinivasa Rao Arikati, C. Pandu Rangan
**Linear Algorithm for Optimal Path Cover Problem on Interval Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1990, v:35, n:3, pp:149-153 [Journal] - A. Arvind, C. Pandu Rangan
**Symmetric Min-Max Heap: A Simpler Data Structure for Double-Ended Priority Queue.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:69, n:4, pp:197-199 [Journal] - V. Balachandran, P. Nagavamsi, C. Pandu Rangan
**Clique Transversal and Clique Independence on Comparability Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1996, v:58, n:4, pp:181-184 [Journal] - Maw-Shang Chang, P. Nagavamsi, C. Pandu Rangan
**Weighted Irredundance of Interval Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:66, n:2, pp:65-70 [Journal] - K. S. Easwarakumar, C. Pandu Rangan, Grant A. Cheston
**A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1994, v:51, n:3, pp:121-124 [Journal] - Venkatesan Guruswami, C. Pandu Rangan
**A Natural Family of Optimization Problems with Arbitrarily Small Approximation Thresholds.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:68, n:5, pp:241-248 [Journal] - V. Kamakoti, C. Pandu Rangan
**An Optimal Algorithm for Reconstructing a Binary Tree.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1992, v:42, n:2, pp:113-115 [Journal] - M. S. Madanlal, G. Venkatesan, C. Pandu Rangan
**Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1996, v:59, n:2, pp:97-102 [Journal] - A. Srinivasa Rao, C. Pandu Rangan
**Optimal Parallel Algorithms on Circular-Arc Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:33, n:3, pp:147-156 [Journal] - G. Ramalingam, C. Pandu Rangan
**Total Domination in Interval Graphs Revisited.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1988, v:27, n:1, pp:17-21 [Journal] - G. Ramalingam, C. Pandu Rangan
**A Unified Approach to Domination Problems on Interval Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1988, v:27, n:5, pp:271-274 [Journal] - G. Ramalingam, C. Pandu Rangan
**New Sequential and Parallel Algorithms for Interval Graph Recognition.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1990, v:34, n:4, pp:215-219 [Journal] - A. Srinivasa Rao, C. Pandu Rangan
**Linear Algorithm for Domatic Number Problem on Interval Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:33, n:1, pp:29-33 [Journal] - Anand Srinivasan, K. Madhukar, P. Nagavamsi, C. Pandu Rangan, Maw-Shang Chang
**Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:56, n:3, pp:165-171 [Journal] - G. Venkatesan, C. Pandu Rangan
**Approximate Triclique Coloring for Register Allocation.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1996, v:60, n:5, pp:249-253 [Journal] - 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] - V. B. Balayogan, C. Pandu Rangan
**Parallel Algorithms on Interval Graphs.**[Citation Graph (0, 0)][DBLP] ITA, 1995, v:29, n:6, pp:451-470 [Journal] - D. Arun Kumar, C. Pandu Rangan
**Approximation algorithms for the Traveling Salesman Problem with range condition.**[Citation Graph (0, 0)][DBLP] ITA, 2000, v:34, n:3, pp:173-182 [Journal] - Suresh Venkatasubramanian, Kamala Krithivasan, C. Pandu Rangan
**Algorithms for Weighted Graph Problems on The Modified Cellular Graph Automaton.**[Citation Graph (0, 0)][DBLP] ITA, 1989, v:23, n:3, pp:251-279 [Journal] - C. Pandu Rangan
**On the Minimum Number of Additions Required to Compute a Quadratic Form.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1983, v:4, n:3, pp:282-285 [Journal] - Lakshminarayanan Subramanian, Muralidhar Talupur, Kamala Krithivasan, C. Pandu Rangan
**On the Generative Power of Simple H Systems.**[Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2000, v:5, n:4, pp:457-0 [Journal] - K. Arvind, V. Kamakoti, C. Pandu Rangan
**Efficient Parallel Algorithms for Permutation Graphs.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1995, v:26, n:1, pp:116-124 [Journal] - Rohan F. M. Aranha, C. Pandu Rangan
**An Efficient Distributed Algorithm For st-numbering The Verices Of A Biconnected Graph**[Citation Graph (0, 0)][DBLP] J. UCS, 1995, v:1, n:9, pp:633-650 [Journal] - V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan
**An Efficient Randomized Algorithm for the Closest Pair Problem on Colored Point Sets.**[Citation Graph (0, 0)][DBLP] Nord. J. Comput., 1995, v:2, n:1, pp:28-40 [Journal] - Stefan Felsner, Ravi Kant, C. Pandu Rangan, Dorothea Wagner
**On the Complexity of Partial Order Properties.**[Citation Graph (0, 0)][DBLP] Order, 2000, v:17, n:2, pp:179-193 [Journal] - Sathi Mahesh, C. Siva Ram Murthy, C. Pandu Rangan
**Performance Bounds for Static Multiprocessor Scheduling of Multi-Task Jobs.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 1995, v:5, n:, pp:343-355 [Journal] - Maurice Nivat, G. D. S. Ramkumar, C. Pandu Rangan, Ahmed Saoudi, Ravi Sundaram
**Efficient Parallel Shuffle Recognition.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 1994, v:4, n:, pp:455-463 [Journal] - Arjun Raman, C. Pandu Rangan
**A Unified Approach to Parallel Algorithms for the Domatic Partition Problem on Special Classes of Perfect Graphs.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 1993, v:3, n:, pp:233-241 [Journal] - K. Madhukar, D. Pavan Kumar, C. Pandu Rangan, R. Sundar
**Systematic Design of an Algorithm for Biconnected Components.**[Citation Graph (0, 0)][DBLP] Sci. Comput. Program., 1995, v:25, n:1, pp:63-77 [Journal] - Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan
**Treewidth of Circular-Arc Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1994, v:7, n:4, pp:647-655 [Journal] - R. Srikant, Ravi Sundaram, Karan Sher Singh, C. Pandu Rangan
**Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1993, v:115, n:2, pp:351-357 [Journal] - G. Srikrishna, C. Pandu Rangan
**Optimal Parallel Algorithms for Path Problems on Planar Graphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1995, v:145, n:1&2, pp:27-43 [Journal] - Aravind Srinivasan, C. Pandu Rangan
**Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1991, v:91, n:1, pp:1-21 [Journal] - Kannan Srinathan, Prasad Raghavendra, C. Pandu Rangan
**On Proactive Perfectly Secure Message Transmission.**[Citation Graph (0, 0)][DBLP] ACISP, 2007, pp:461-473 [Conf] - K. Anil Kumar, C. Pandu Rangan
**Privacy Preserving DBSCAN Algorithm for Clustering.**[Citation Graph (0, 0)][DBLP] ADMA, 2007, pp:57-68 [Conf] - P. Krishna Prasad, C. Pandu Rangan
**Privacy Preserving BIRCH Algorithm for Clustering over Arbitrarily Partitioned Databases.**[Citation Graph (0, 0)][DBLP] ADMA, 2007, pp:146-157 [Conf] - 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] - R. C. Chakinala, A. Kumarasubramanian, R. Manokaran, G. Noubir, C. Pandu Rangan, Ravi Sundaram
**Steganographic Communication in Ordered Channels.**[Citation Graph (0, 0)][DBLP] Information Hiding, 2006, pp:42-57 [Conf] - Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan
**Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary.**[Citation Graph (0, 0)][DBLP] DISC, 2007, pp:496-498 [Conf] **Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary.**[Citation Graph (, )][DBLP]**Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security.**[Citation Graph (, )][DBLP]**Unconditionally Reliable Message Transmission in Directed Hypergraphs.**[Citation Graph (, )][DBLP]**Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary.**[Citation Graph (, )][DBLP]**The Round Complexity of Verifiable Secret Sharing Revisited.**[Citation Graph (, )][DBLP]**Privacy Preserving CACTUS Algorithm for Clustering over Vertically Partitioned Databases.**[Citation Graph (, )][DBLP]**Data structures for limited oblivious execution of programs while preserving locality of reference.**[Citation Graph (, )][DBLP]**RSA-TBOS signcryption with proxy re-encryption.**[Citation Graph (, )][DBLP]**Cryptanalysis of Li et al.'s Identity-Based Threshold Signcryption Scheme.**[Citation Graph (, )][DBLP]**Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality.**[Citation Graph (, )][DBLP]**Round Efficient Unconditionally Secure Multiparty Computation Protocol.**[Citation Graph (, )][DBLP]**Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience.**[Citation Graph (, )][DBLP]**Identity Based Aggregate Signcryption Schemes.**[Citation Graph (, )][DBLP]**The deterministic protocol for rational secret sharing.**[Citation Graph (, )][DBLP]**Rational Secret Sharing with Repeated Games.**[Citation Graph (, )][DBLP]**Certificateless KEM and Hybrid Signcryption Schemes Revisited.**[Citation Graph (, )][DBLP]**Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles.**[Citation Graph (, )][DBLP]**On the Security of Identity Based Ring Signcryption Schemes.**[Citation Graph (, )][DBLP]**Spatiogram Based Fast Mode Decision in Spatial Scalable Video Coding.**[Citation Graph (, )][DBLP]**Efficient Protocol For Approximate Agreement.**[Citation Graph (, )][DBLP]**Efficient single phase unconditionally secure message transmission with optimum communication complexity.**[Citation Graph (, )][DBLP]**On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary.**[Citation Graph (, )][DBLP]**Brief announcement: perfectly secure message transmission in directed networks re-visited.**[Citation Graph (, )][DBLP]**Simple and efficient asynchronous byzantine agreement with optimal resilience.**[Citation Graph (, )][DBLP]**Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity.**[Citation Graph (, )][DBLP]**Brief announcement: communication efficient asynchronous byzantine agreement.**[Citation Graph (, )][DBLP]**Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-Hoc Networks.**[Citation Graph (, )][DBLP]**Information Theoretically Secure Multi Party Set Intersection Re-visited.**[Citation Graph (, )][DBLP]**Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited.**[Citation Graph (, )][DBLP]**On the Security of Two Ring Signcryption Schemes.**[Citation Graph (, )][DBLP]**Unconditionally reliable message transmission in directed networks.**[Citation Graph (, )][DBLP]**Cryptanalysis of Mu et al.'s and Li et al.'s Schemes and a Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme.**[Citation Graph (, )][DBLP]**Core and Conditional Core Path of Specified Length in Special Classes of Graphs.**[Citation Graph (, )][DBLP]**Pathwidth and Searching in Parameterized Threshold Graphs.**[Citation Graph (, )][DBLP]**Variants of Spreading Messages.**[Citation Graph (, )][DBLP]**On Optimal Probabilistic Asynchronous Byzantine Agreement.**[Citation Graph (, )][DBLP]**Alternative Protocols for Generalized Oblivious Transfer.**[Citation Graph (, )][DBLP]**On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks.**[Citation Graph (, )][DBLP]**On Communication Complexity of Secure Message Transmission in Directed Networks.**[Citation Graph (, )][DBLP]**On Composability of Reliable Unicast and Broadcast.**[Citation Graph (, )][DBLP]**Efficient and Provably Secure Certificateless Multi-receiver Signcryption.**[Citation Graph (, )][DBLP]**Breaking and Fixing of an Identity Based Multi-Signcryption Scheme.**[Citation Graph (, )][DBLP]**Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience.**[Citation Graph (, )][DBLP]**Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary.**[Citation Graph (, )][DBLP]**Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience.**[Citation Graph (, )][DBLP]**The Guarding Problem - Complexity and Approximation.**[Citation Graph (, )][DBLP]**Communication Optimal Multi-valued Asynchronous Broadcast Protocol.**[Citation Graph (, )][DBLP]**Communication and Round Efficient Information Checking Protocol**[Citation Graph (, )][DBLP]**Capacitated Caching Games**[Citation Graph (, )][DBLP]**An efficient algorithm for finding a two-pair, and its applications.**[Citation Graph (, )][DBLP]**An O(n log n) algorithm for a maxmin location problem.**[Citation Graph (, )][DBLP]
Search in 0.240secs, Finished in 0.247secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |