Search the dblp DataBase
Arpita Patra :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
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 ] 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 ] Arpita Patra , Ashish Choudhary , Chanrasekharan Pandu Rangan Constant phase efficient protocols for secure message transmission in directed networks. [Citation Graph (0, 0)][DBLP ] PODC, 2007, pp:322-323 [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 ] 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 ] 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 ] 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 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 ] 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 ] Communication Optimal Multi-valued Asynchronous Broadcast Protocol. [Citation Graph (, )][DBLP ] Communication and Round Efficient Information Checking Protocol [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.002secs