The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Arpita Patra" ( http://dblp.L3S.de/Authors/Arpita_Patra )

  Author page on DBLP  Author page in RDF  Community of Arpita Patra in ASPL-2

Publication years (Num. hits)
2006-2008 (27) 2009 (17) 2010-2011 (25)
Publication types (Num. hits)
article(36) inproceedings(33)
Venues (Conferences, Journals, ...)
IACR Cryptology ePrint Archive(30) PODC(7) ICITS(4) INDOCRYPT(4) CANS(3) ASIACRYPT(2) ICDCN(2) IJACT(2) ACISP(1) ACNS(1) AFRICACRYPT(1) ASIACCS(1) CoRR(1) CRYPTO(1) DISC(1) EURASIP J. Adv. Sig. Proc.(1) More (+10 of total 23)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 29 occurrences of 11 keywords

Results
Found 69 publication records. Showing 69 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Ashish Choudhury, Arpita Patra On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2011 DBLP  BibTeX  RDF
1Ivan Damgård, Carmit Hazay, Arpita Patra Leakage Resilient Secure Two-Party Computation. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2011 DBLP  BibTeX  RDF
1Ashish Choudhury, Arpita Patra Statistical Asynchronous Weak Commitment Scheme: A New Primitive to Design Statistical Asynchronous Verifiable Secret Sharing Scheme. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2011 DBLP  BibTeX  RDF
1Ashish Choudhury, Kaoru Kurosawa, Arpita Patra Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2011 DBLP  BibTeX  RDF
1Arpita Patra Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2011 DBLP  BibTeX  RDF
1Ashish Choudhury, Kaoru Kurosawa, Arpita Patra Does Pseudo-basis Extend to General Adversary? Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2011 DBLP  BibTeX  RDF
1Michael Backes, Aniket Kate, Arpita Patra Computational Verifiable Secret Sharing Revisited. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2011 DBLP  BibTeX  RDF
1Ashish Choudhury, Kaoru Kurosawa, Arpita Patra Non-Applicability of Pseudobasis for Designing Perfectly Secure Message Transmission Protocols Against Non-Threshold Adversary. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2011 DBLP  BibTeX  RDF
1Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan Secure message transmission in asynchronous networks. Search on Bibsonomy J. Parallel Distrib. Comput. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ashish Choudhury, Kaoru Kurosawa, Arpita Patra The Round Complexity of Perfectly Secure General VSS. Search on Bibsonomy ICITS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arpita Patra, C. Pandu Rangan Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience. Search on Bibsonomy ICITS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arpita Patra Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. Search on Bibsonomy OPODIS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Michael Backes, Aniket Kate, Arpita Patra Computational Verifiable Secret Sharing Revisited. Search on Bibsonomy ASIACRYPT The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ashish Choudhury, Kaoru Kurosawa, Arpita Patra Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. Search on Bibsonomy ACNS The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2010 DBLP  BibTeX  RDF
1Arpita Patra Studies on Verifiable Secret Sharing, Byzantine Agreement and Multiparty Computation. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2010 DBLP  BibTeX  RDF
1Ashish Choudhury, Kaoru Kurosawa, Arpita Patra The Round Complexity of General VSS. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2010 DBLP  BibTeX  RDF
1Arpita Patra, C. Pandu Rangan Communication and Round Efficient Information Checking Protocol Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhury, C. Pandu Rangan, Kannan Srinathan Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality. Search on Bibsonomy IJACT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan On Communication Complexity of Secure Message Transmission in Directed Networks. Search on Bibsonomy ICDCN The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Arpita Patra, C. Pandu Rangan Communication Optimal Multi-valued Asynchronous Broadcast Protocol. Search on Bibsonomy LATINCRYPT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan The Round Complexity of Verifiable Secret Sharing: The Statistical Case. Search on Bibsonomy ASIACRYPT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Arpita Patra, Ashish Choudhury, C. Pandu Rangan Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF information theoretic security
1Arpita Patra, C. Pandu Rangan Brief announcement: communication efficient asynchronous byzantine agreement. Search on Bibsonomy PODC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF asynchronous, information theoretic security
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. Search on Bibsonomy AFRICACRYPT The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Arpita Patra, C. Pandu Rangan Communication Optimal Multi-Valued Asynchronous Byzantine Agreement with Optimal Resilience. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2009 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2009 DBLP  BibTeX  RDF
1G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2009 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2009 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Unconditionally Secure Asynchronous Multiparty Computation with Quadratic Communication Per Multiplication Gate. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2009 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Information Theoretically Secure Multi Party Set Intersection Re-Visited. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2009 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan, Kannan Srinathan, Prasad Raghavendra Perfectly reliable and secure message transmission tolerating mobile adversary. Search on Bibsonomy IJACT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. Search on Bibsonomy ICDCN The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience. Search on Bibsonomy Inscrypt The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience. Search on Bibsonomy ICITS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Information Theoretically Secure Multi Party Set Intersection Re-visited. Search on Bibsonomy Selected Areas in Cryptography The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Information Theoretic Security, Multiparty Computation
1G. Sathya Narayanan, T. Aishwarya, Anugrah Agrawal, Arpita Patra, Ashish Choudhary, C. Pandu Rangan Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security. Search on Bibsonomy CANS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Privacy preserving Set operations, Multiparty Computation
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Simple and efficient asynchronous byzantine agreement with optimal resilience. Search on Bibsonomy PODC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF unbounded computing power, byzantine agreement, asynchronous networks, VSS
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Brief announcement: perfectly secure message transmission in directed networks re-visited. Search on Bibsonomy PODC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF information theoretic security
1Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan The Round Complexity of Verifiable Secret Sharing Revisited. Search on Bibsonomy CRYPTO The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience. Search on Bibsonomy INDOCRYPT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Information Theoretic Security, Multiparty Computation, Error Probability
1Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary. Search on Bibsonomy ASIACCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF mixed adversary, information theoretic security, error probability
1Arpita Patra, Ashish Choudhury, C. Pandu Rangan Efficient Asynchronous Byzantine Agreement with Optimal Resilience. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan Unconditionally Secure Message Transmission in Arbitrary Directed Synchronous Networks Tolerating Generalized Mixed Adversary. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan The Round Complexity of Verifiable Secret Sharing Revisited. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, Madhu Gayatri, C. Pandu Rangan Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhury, C. Pandu Rangan, Kannan Srinathan Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhury, C. Pandu Rangan Efficient Asynchronous Multiparty Computation with Optimal Resilience. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan On Communication Complexity of Perfectly Reliable and Secure Communication in Directed Networks. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhury, C. Pandu Rangan Statistically Reliable and Secure Message Transmission in Directed Networks. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhury, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan Perfectly Secure Message Transmission Tolerating Mixed Adversary. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, B. V. Ashwinkumar, C. Pandu Rangan Probabilistic Verifiable Secret Sharing Tolerating Adaptive Adversary. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Unconditionally Secure Multiparty Set Intersection Re-Visited. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Round Efficient Unconditionally Secure Multiparty Computation Protocol. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan Unconditionally Reliable Message Transmission in Directed Hypergraphs. Search on Bibsonomy IACR Cryptology ePrint Archive The full citation details ... 2008 DBLP  BibTeX  RDF
1Arpita Patra, Sukhendu Das Enhancing decision combination of face and fingerprint by exploitation of individual classifier space: An approach to multi-modal biometry. Search on Bibsonomy Pattern Recognition The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. Search on Bibsonomy ACISP The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Information Theoretic Security, Mobile Adversary
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. Search on Bibsonomy SCN The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Information Theoretic Security, Error Probability
1Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary. Search on Bibsonomy ICITS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan Unconditionally Reliable Message Transmission in Directed Hypergraphs. Search on Bibsonomy CANS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Unbounded Computing Power, Unconditional Reliability
1B. V. Ashwinkumar, Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary. Search on Bibsonomy PODC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Kannan Srinathan, Ashish Choudhary, Arpita Patra, C. Pandu Rangan Efficient single phase unconditionally secure message transmission with optimum communication complexity. Search on Bibsonomy PODC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, C. Pandu Rangan Round Efficient Unconditionally Secure Multiparty Computation Protocol. Search on Bibsonomy INDOCRYPT The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Information Theoretic Security, Multiparty Computation
1Lalit Gupta, Vinod Pathangay, Arpita Patra, A. Dyana, Sukhendu Das Indoor versus Outdoor Scene Classification Using Probabilistic Neural Network. Search on Bibsonomy EURASIP J. Adv. Sig. Proc. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary. Search on Bibsonomy DISC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Arpita Patra, Bhavani Shankar, Ashish Choudhary, K. Srinathan, C. Pandu Rangan Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary. Search on Bibsonomy CANS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Reliable and Secure Communication, Information Theoretic Security, Directed Networks, Communication Efficiency
1Arpita Patra, Ashish Choudhary, Chandrasekaran Pandu Rangan Constant phase efficient protocols for secure message transmission in directed networks. Search on Bibsonomy PODC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF information theoretic security
1Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality. Search on Bibsonomy INDOCRYPT The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Probabilistic Reliability, Fault Tolerance, Information Theoretic Security
1Arpita Patra, Ashish Choudhary, K. Srinathan, C. Pandu Rangan Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission. Search on Bibsonomy INDOCRYPT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Reliable and Secure Communication, Information Theoretic Security, Communication Efficiency
Displaying result #1 - #69 of 69 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.