![]() | ![]() |
Ashish Choudhary
List of publications from the DBLP Bibliography Server - FAQ
| 2011 | ||
|---|---|---|
| 67 | Ashish Choudhury, Kaoru Kurosawa, Arpita Patra: Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. ACNS 2011: 292-308 | |
| 66 | Ashish Choudhury, Kaoru Kurosawa, Arpita Patra: The Round Complexity of Perfectly Secure General VSS. ICITS 2011: 143-162 | |
| 65 | Ashish Choudhury, Kaoru Kurosawa, Arpita Patra: Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. IACR Cryptology ePrint Archive 2011: 27 (2011) | |
| 64 | Ashish Choudhury, Arpita Patra: On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks. IACR Cryptology ePrint Archive 2011: 288 (2011) | |
| 63 | Ashish Choudhury, Arpita Patra: Statistical Asynchronous Weak Commitment Scheme: A New Primitive to Design Statistical Asynchronous Verifiable Secret Sharing Scheme. IACR Cryptology ePrint Archive 2011: 31 (2011) | |
| 62 | Ashish Choudhury: Simple and Asymptotically Optimal t-Cheater Identifiable Secret Sharing Scheme. IACR Cryptology ePrint Archive 2011: 330 (2011) | |
| 61 | Ashish Choudhury, Kaoru Kurosawa, Arpita Patra: Non-Applicability of Pseudobasis for Designing Perfectly Secure Message Transmission Protocols Against Non-Threshold Adversary. IACR Cryptology ePrint Archive 2011: 54 (2011) | |
| 60 | Ashish Choudhury, Kaoru Kurosawa, Arpita Patra: Does Pseudo-basis Extend to General Adversary? IACR Cryptology ePrint Archive 2011: 82 (2011) | |
| 59 | Ashish Choudhury, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan: Secure message transmission in asynchronous networks. J. Parallel Distrib. Comput. 71(8): 1067-1074 (2011) | |
| 2010 | ||
| 58 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. AFRICACRYPT 2010: 184-202 | |
| 57 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: On Communication Complexity of Secure Message Transmission in Directed Networks. ICDCN 2010: 42-53 | |
| 56 | Arpita Patra, Ashish Choudhury, C. Pandu Rangan: Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity. PODC 2010: 245-246 | |
| 55 | Ashish Choudhury: Protocols for Reliable and Secure Message Transmission. IACR Cryptology ePrint Archive 2010: 281 (2010) | |
| 54 | Ashish Choudhury, Kaoru Kurosawa, Arpita Patra: The Round Complexity of General VSS. IACR Cryptology ePrint Archive 2010: 609 (2010) | |
| 53 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. IACR Cryptology ePrint Archive 2010: 7 (2010) | |
| 52 | Arpita Patra, Ashish Choudhury, C. Pandu Rangan, Kannan Srinathan: Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality. IJACT 2(2): 159-197 (2010) | |
| 2009 | ||
| 51 | Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary. ASIACCS 2009: 171-182 | |
| 50 | G. 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. CANS 2009: 21-40 | |
| 49 | Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan: The Round Complexity of Verifiable Secret Sharing Revisited. CRYPTO 2009: 487-504 | |
| 48 | Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan: On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. ICDCN 2009: 148-162 | |
| 47 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience. ICITS 2009: 74-92 | |
| 46 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience. INDOCRYPT 2009: 398-417 | |
| 45 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience. Inscrypt 2009: 179-197 | |
| 44 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Brief announcement: perfectly secure message transmission in directed networks re-visited. PODC 2009: 278-279 | |
| 43 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Simple and efficient asynchronous byzantine agreement with optimal resilience. PODC 2009: 92-101 | |
| 42 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Information Theoretically Secure Multi Party Set Intersection Re-visited. Selected Areas in Cryptography 2009: 71-91 | |
| 41 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Information Theoretically Secure Multi Party Set Intersection Re-Visited. IACR Cryptology ePrint Archive 2009: 116 (2009) | |
| 40 | G. 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. IACR Cryptology ePrint Archive 2009: 311 (2009) | |
| 39 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks. IACR Cryptology ePrint Archive 2009: 470 (2009) | |
| 38 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience. IACR Cryptology ePrint Archive 2009: 492 (2009) | |
| 37 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally Secure Asynchronous Multiparty Computation with Quadratic Communication Per Multiplication Gate. IACR Cryptology ePrint Archive 2009: 87 (2009) | |
| 36 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan, Kannan Srinathan, Prasad Raghavendra: Perfectly reliable and secure message transmission tolerating mobile adversary. IJACT 1(3): 200-224 (2009) | |
| 35 | Ashish Choudhary, Kamala Krithivasan: Breaking the data encryption standard using networks of evolutionary processors with parallel string rewriting rules. Int. J. Comput. Math. 86(4): 567-576 (2009) | |
| 2008 | ||
| 34 | Arpita Patra, Ashish Choudhary, Madhu Vaidyanathan, C. Pandu Rangan: Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. ACISP 2008: 170-186 | |
| 33 | Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally Reliable Message Transmission in Directed Hypergraphs. CANS 2008: 285-303 | |
| 32 | Ashish Choudhary, Arpita Patra, B. V. Ashwinkumar, K. Srinathan, C. Pandu Rangan: Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary. ICITS 2008: 137-155 | |
| 31 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Round Efficient Unconditionally Secure Multiparty Computation Protocol. INDOCRYPT 2008: 185-199 | |
| 30 | B. 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. PODC 2008: 115-124 | |
| 29 | Kannan Srinathan, Ashish Choudhary, Arpita Patra, C. Pandu Rangan: Efficient single phase unconditionally secure message transmission with optimum communication complexity. PODC 2008: 457 | |
| 28 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. SCN 2008: 309-326 | |
| 27 | Arpita Patra, Ashish Choudhary, B. V. Ashwinkumar, C. Pandu Rangan: Probabilistic Verifiable Secret Sharing Tolerating Adaptive Adversary. IACR Cryptology ePrint Archive 2008: 101 (2008) | |
| 26 | Arpita Patra, Ashish Choudhury, C. Pandu Rangan, Kannan Srinathan: Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality. IACR Cryptology ePrint Archive 2008: 141 (2008) | |
| 25 | Arpita Patra, Ashish Choudhary, Tal Rabin, C. Pandu Rangan: The Round Complexity of Verifiable Secret Sharing Revisited. IACR Cryptology ePrint Archive 2008: 172 (2008) | |
| 24 | Arpita Patra, Ashish Choudhury, B. V. Ashwinkumar, Kannan Srinathan, C. Pandu Rangan: Perfectly Secure Message Transmission Tolerating Mixed Adversary. IACR Cryptology ePrint Archive 2008: 232 (2008) | |
| 23 | Arpita Patra, Ashish Choudhury, C. Pandu Rangan: Statistically Reliable and Secure Message Transmission in Directed Networks. IACR Cryptology ePrint Archive 2008: 262 (2008) | |
| 22 | Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally Reliable Message Transmission in Directed Hypergraphs. IACR Cryptology ePrint Archive 2008: 371 (2008) | |
| 21 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Round Efficient Unconditionally Secure Multiparty Computation Protocol. IACR Cryptology ePrint Archive 2008: 399 (2008) | |
| 20 | Arpita Patra, Ashish Choudhury, C. Pandu Rangan: Efficient Asynchronous Byzantine Agreement with Optimal Resilience. IACR Cryptology ePrint Archive 2008: 424 (2008) | |
| 19 | Arpita Patra, Ashish Choudhury, C. Pandu Rangan: Efficient Asynchronous Multiparty Computation with Optimal Resilience. IACR Cryptology ePrint Archive 2008: 425 (2008) | |
| 18 | Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan: On Communication Complexity of Perfectly Reliable and Secure Communication in Directed Networks. IACR Cryptology ePrint Archive 2008: 461 (2008) | |
| 17 | Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally Secure Multiparty Set Intersection Re-Visited. IACR Cryptology ePrint Archive 2008: 462 (2008) | |
| 16 | Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Unconditionally Secure Message Transmission in Arbitrary Directed Synchronous Networks Tolerating Generalized Mixed Adversary. IACR Cryptology ePrint Archive 2008: 506 (2008) | |
| 15 | Arpita Patra, Ashish Choudhary, Madhu Gayatri, C. Pandu Rangan: Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary. IACR Cryptology ePrint Archive 2008: 86 (2008) | |
| 2007 | ||
| 14 | Arpita Patra, Bhavani Shankar, Ashish Choudhary, K. Srinathan, C. Pandu Rangan: Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary. CANS 2007: 80-101 | |
| 13 | Arpita Patra, Ashish Choudhary, Kannan Srinathan, C. Pandu Rangan: Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary. DISC 2007: 496-498 | |
| 12 | Kannan Srinathan, Arpita Patra, Ashish Choudhary, C. Pandu Rangan: Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality. INDOCRYPT 2007: 101-122 | |
| 11 | Arpita Patra, Ashish Choudhary, Chandrasekaran Pandu Rangan: Constant phase efficient protocols for secure message transmission in directed networks. PODC 2007: 322-323 | |
| 10 | Ashish Choudhary, Kamala Krithivasan: Network of evolutionary processors with splicing rules and permitting context. Biosystems 87(2-3): 111-116 (2007) | |
| 9 | Ashish Choudhary, Kamala Krithivasan, Victor Mitrana: Returning and non-returning parallel communicating finite automata are equivalent. ITA 41(2): 137-145 (2007) | |
| 2006 | ||
| 8 | Arpita Patra, Ashish Choudhary, K. Srinathan, C. Pandu Rangan: Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission. INDOCRYPT 2006: 221-235 | |
| 7 | Ashish Choudhary, Aniruddha Datta, Michael L. Bittner, Edward R. Dougherty: Intervention in a family of Boolean networks. Bioinformatics 22(2): 226-232 (2006) | |
| 6 | Ashish Choudhary, Marcel Brun, Jianping Hua, James Lowey, Edward Suh, Edward R. Dougherty: Genetic test bed for feature selection. Bioinformatics 22(7): 837-842 (2006) | |
| 2005 | ||
| 5 | Ashish Choudhary: Accepting Hybrid Networks of Evolutionary Processors with Splicing Rules and Forbidding Context. IICAI 2005: 2686-2698 | |
| 4 | Ashish Choudhary, Kamala Krithivasan: Network of Evolutionary Processors with Splicing Rules. IWINAC (1) 2005: 290-299 | |
| 3 | Ashish Choudhary, Kamala Krithivasan: Network of Evolutionary Processors with Splicing Rules and Forbidding Context. IWINAC (1) 2005: 300-309 | |
| 2004 | ||
| 2 | Aniruddha Datta, Ashish Choudhary, Michael L. Bittner, Edward R. Dougherty: External control in Markovian genetic regulatory networks: the imperfect information case. Bioinformatics 20(6): 924-930 (2004) | |
| 2003 | ||
| 1 | Aniruddha Datta, Ashish Choudhary, Michael L. Bittner, Edward R. Dougherty: External Control in Markovian Genetic Regulatory Networks. Machine Learning 52(1-2): 169-191 (2003) | |
Colors in the list of coauthors
Last update Tue May 29 20:41:18 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page