Application of dynamic programming in genetic regulatory networks. - Aniruddha Datta; Ashish Choudhary; Michael L. Bittner; Edward R. Dougherty (CDC, 2003)

External Control in Markovian Genetic Regulatory Networks. - Aniruddha Datta; Ashish Choudhary; Michael L. Bittner; Edward R. Dougherty (Mach. Learn., 2003)

External control in Markovian genetic regulatory networks: the imperfect information case. - Aniruddha Datta; Ashish Choudhary; Michael L. Bittner; Edward R. Dougherty (Bioinform., 2004)

Assignment of terminal penalties in controlling genetic regulatory networks. - Ashish Choudhary; Aniruddha Datta; Michael L. Bittner; Edward R. Dougherty (ACC, 2005)

Accepting Hybrid Networks of Evolutionary Processors with Splicing Rules and Forbidding Context. - Ashish Choudhary (IICAI, 2005)

Network of Evolutionary Processors with Splicing Rules. - Ashish Choudhary; Kamala Krithivasan (IWINAC (1), 2005)

Network of Evolutionary Processors with Splicing Rules and Forbidding Context. - Ashish Choudhary; Kamala Krithivasan (IWINAC (1), 2005)

Optimal Control in a Family of Boolean Networks. - Ashish Choudhary; Aniruddha Datta; Michael L. Bittner; Edward R. Dougherty (CDC, 2006)

Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission. - Arpita Patra; Ashish Choudhary; K. Srinathan; C. Pandu Rangan (INDOCRYPT, 2006)

Genetic test bed for feature selection. - Ashish Choudhary; Marcel Brun; Jianping Hua; James Lowey; Edward Suh; Edward R. Dougherty (Bioinform., 2006)

Intervention in a family of Boolean networks. - Ashish Choudhary; Aniruddha Datta; Michael L. Bittner; Edward R. Dougherty (Bioinform., 2006)

Intervention in gene regulatory networks. - Ashish Choudhary (2006)

Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary. - Arpita Patra; Bhavani Shankar; Ashish Choudhary; K. Srinathan; C. Pandu Rangan (CANS, 2007)

Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality. - Kannan Srinathan; Arpita Patra; Ashish Choudhary; C. Pandu Rangan (INDOCRYPT, 2007)

Constant phase efficient protocols for secure message transmission in directed networks. - Arpita Patra; Ashish Choudhary; Chandrasekaran Pandu Rangan (PODC, 2007)

Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary. - Arpita Patra; Ashish Choudhary; Kannan Srinathan; C. Pandu Rangan (DISC, 2007)

Network of evolutionary processors with splicing rules and permitting context. - Ashish Choudhary; Kamala Krithivasan (Biosyst., 2007)

Returning and non-returning parallel communicating finite automata are equivalent. - Ashish Choudhary; Kamala Krithivasan; Victor Mitrana (RAIRO Theor. Informatics Appl., 2007)

Control approaches for probabilistic gene regulatory networks - What approaches have been developed for addreassinig the issue of intervention? - Anirulddlha Datta; Ranadip Pal; Ashish Choudhary; Edward R. Dougherty (IEEE Signal Process. Mag., 2007)

Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. - Arpita Patra; Ashish Choudhary; Madhu Vaidyanathan; C. Pandu Rangan (ACISP, 2008)

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary. - Ashish Choudhary; Arpita Patra; B. V. Ashwinkumar; K. Srinathan; C. Pandu Rangan (ICITS, 2008)

On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary. - B. V. Ashwinkumar; Arpita Patra; Ashish Choudhary; Kannan Srinathan; C. Pandu Rangan (PODC, 2008)

Efficient single phase unconditionally secure message transmission with optimum communication complexity. - Kannan Srinathan; Ashish Choudhary; Arpita Patra; C. Pandu Rangan (PODC, 2008)

Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (SCN, 2008)

Perfectly Secure Message Transmission Tolerating Mixed Adversary. - Arpita Patra; Ashish Choudhury; B. V. Ashwinkumar; Kannan Srinathan; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary. - Arpita Patra; Ashish Choudhary; Madhu Gayatri; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Statistically Reliable and Secure Message Transmission in Directed Networks. - Arpita Patra; Ashish Choudhury; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Round Efficient Unconditionally Secure Multiparty Computation Protocol. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Efficient Asynchronous Byzantine Agreement with Optimal Resilience. - Arpita Patra; Ashish Choudhury; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Efficient Asynchronous Multiparty Computation with Optimal Resilience. - Arpita Patra; Ashish Choudhury; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Unconditionally Secure Multiparty Set Intersection Re-Visited. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

The Round Complexity of Verifiable Secret Sharing Revisited. - Arpita Patra; Ashish Choudhary; Tal Rabin; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Unconditionally Reliable Message Transmission in Directed Hypergraphs. - Kannan Srinathan; Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Unconditionally Secure Message Transmission in Arbitrary Directed Synchronous Networks Tolerating Generalized Mixed Adversary. - Kannan Srinathan; Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2008)

Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (Inscrypt, 2009)

On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. - Ashish Choudhary; Arpita Patra; B. V. Ashwinkumar; Kannan Srinathan; C. Pandu Rangan (ICDCN, 2009)

Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (ICITS, 2009)

Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (INDOCRYPT, 2009)

Simple and efficient asynchronous byzantine agreement with optimal resilience. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (PODC, 2009)

Brief announcement: perfectly secure message transmission in directed networks re-visited. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (PODC, 2009)

Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security. - G. Sathya Narayanan; T. Aishwarya; Anugrah Agrawal; Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2009)

Information Theoretically Secure Multi Party Set Intersection Re-Visited. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2009)

On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2009)

Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2009)

Perfectly reliable and secure message transmission tolerating mobile adversary. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan; Kannan Srinathan; Prasad Raghavendra (Int. J. Appl. Cryptogr., 2009)

Breaking the data encryption standard using networks of evolutionary processors with parallel string rewriting rules. - Ashish Choudhary; Kamala Krithivasan (Int. J. Comput. Math., 2009)

On Communication Complexity of Secure Message Transmission in Directed Networks. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (ICDCN, 2010)

Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity. - Arpita Patra; Ashish Choudhury; C. Pandu Rangan (PODC, 2010)

Protocols for Reliable and Secure Message Transmission. - Ashish Choudhury (IACR Cryptol. ePrint Arch., 2010)

The Round Complexity of General VSS. - Ashish Choudhury; Kaoru Kurosawa; Arpita Patra (IACR Cryptol. ePrint Arch., 2010)

Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan (IACR Cryptol. ePrint Arch., 2010)

Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality. - Arpita Patra; Ashish Choudhury; C. Pandu Rangan; Kannan Srinathan (Int. J. Appl. Cryptogr., 2010)

The Round Complexity of Perfectly Secure General VSS. - Ashish Choudhury; Kaoru Kurosawa; Arpita Patra (ICITS, 2011)

Simple and Asymptotically Optimal t-Cheater Identifiable Secret Sharing Scheme. - Ashish Choudhury (IACR Cryptol. ePrint Arch., 2011)

Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. - Ashish Choudhury; Kaoru Kurosawa; Arpita Patra (IACR Cryptol. ePrint Arch., 2011)

Statistical Asynchronous Weak Commitment Scheme: A New Primitive to Design Statistical Asynchronous Verifiable Secret Sharing Scheme. - Ashish Choudhury; Arpita Patra (IACR Cryptol. ePrint Arch., 2011)

On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks. - Ashish Choudhury; Arpita Patra (IACR Cryptol. ePrint Arch., 2011)

Secure message transmission in asynchronous networks. - Ashish Choudhury; Arpita Patra; B. V. Ashwinkumar; Kannan Srinathan; C. Pandu Rangan (J. Parallel Distributed Comput., 2011)

Brief announcement: optimal amortized secret sharing with cheater identification. - Ashish Choudhury (PODC, 2012)

Brief announcement: efficient optimally resilient statistical AVSS and its applications. - Ashish Choudhury; Arpita Patra (PODC, 2012)

Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity. - Ashish Choudhury; Martin Hirt; Arpita Patra (IACR Cryptol. ePrint Arch., 2012)

On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission. - Ashwinkumar Badanidiyuru; Arpita Patra; Ashish Choudhury; Kannan Srinathan; C. Pandu Rangan (J. ACM, 2012)

Breaking the ${ mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation - (Extended Abstract). - Ashish Choudhury (INDOCRYPT, 2013)

Asynchronous Multiparty Computation with Linear Communication Complexity. - Ashish Choudhury; Martin Hirt; Arpita Patra (DISC, 2013)

Asynchronous MPC with t<n/2 Using Non-equivocation. - Michael Backes 001; Fabian Bendun; Ashish Choudhury; Aniket Kate (IACR Cryptol. ePrint Arch., 2013)

Between a Rock and a Hard Place: Interpolating Between MPC and FHE. - Ashish Choudhury; Jake Loftus; Emmanuela Orsini; Arpita Patra; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2013)

Asynchronous MPC with a strict honest majority using non-equivocation. - Michael Backes 001; Fabian Bendun; Ashish Choudhury; Aniket Kate (PODC, 2014)

Reducing the Overhead of MPC over a Large Population. - Ashish Choudhury; Arpita Patra; Nigel P. Smart (SCN, 2014)

Asynchronous Byzantine Agreement with optimal resilience. - Arpita Patra; Ashish Choudhury; C. Pandu Rangan (Distributed Comput., 2014)

Reducing the Overhead of Cloud MPC. - Ashish Choudhury; Arpita Patra; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2014)

Optimally Resilient Asynchronous MPC with Linear Communication Complexity. - Ashish Choudhury; Arpita Patra (ICDCN, 2015)

Asynchronous Error-Decodable Secret-Sharing and Its Application. - Ashish Choudhury (ICISS, 2015)

Linear Overhead Robust MPC with Honest Majority Using Preprocessing. - Ashish Choudhury; Emmanuela Orsini; Arpita Patra; Nigel P. Smart (IACR Cryptol. ePrint Arch., 2015)

Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation. - Arpita Patra; Ashish Choudhury; C. Pandu Rangan (J. Cryptol., 2015)

Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. - Ashish Choudhury; Emmanuela Orsini; Arpita Patra; Nigel P. Smart (SCN, 2016)

Multi-valued Asynchronous Reliable Broadcast with a Strict Honest Majority. - Ashish Choudhury (ICDCN, 2017)

Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous Network. - Ashish Choudhury; Arpita Patra; Divya Ravi 001 (ICITS, 2017)

Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited. - Ashish Choudhury; Gayathri Garimella; Arpita Patra; Divya Ravi 001; Pratik Sarkar (DISC, 2017)

Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network. - Ashish Choudhury; Arpita Patra; Divya Ravi 001 (IACR Cryptol. ePrint Arch., 2017)

An Efficient Framework for Unconditionally Secure Multiparty Computation. - Ashish Choudhury; Arpita Patra (IEEE Trans. Inf. Theory, 2017)

Brief Announcement: Asynchronous Secure Distributed Computing with Transferrable Non-equivocation Revisited. - Rishabh Bhadauria; Ashish Choudhury (PODC, 2018)

Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract). - Ashish Choudhury; Gayathri Garimella; Arpita Patra; Divya Ravi 001; Pratik Sarkar (SIROCCO, 2018)

Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. - Laasya Bangalore; Ashish Choudhury; Arpita Patra (IACR Cryptol. ePrint Arch., 2018)

Crash-tolerant Consensus in Directed Graph Revisited. - Ashish Choudhury; Gayathri Garimella; Arpita Patra; Divya Ravi 001; Pratik Sarkar (IACR Cryptol. ePrint Arch., 2018)

Round efficient computationally secure multi-party computation revisited. - Laasya Bangalore; Ashish Choudhury; Gayathri Garimella (ICDCN, 2019)

ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. - Harsh Chaudhari; Ashish Choudhury; Arpita Patra; Ajith Suresh (IACR Cryptol. ePrint Arch., 2019)

Improving the Efficiency of Optimally-Resilient Statistically-Secure Asynchronous Multi-party Computation. - Ashish Choudhury (INDOCRYPT, 2020)

High Throughput Secure MPC over Small Population in Hybrid Networks (Extended Abstract). - Ashish Choudhury; Aditya Hegde 003 (INDOCRYPT, 2020)

Perfectly-Secure Asynchronous MPC for General Adversaries (Extended Abstract). - Ashish Choudhury; Nikhil Pappu (INDOCRYPT, 2020)

Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time. - Ashish Choudhury (PODC, 2020)

Brief Announcement: Optimally-Resilient Unconditionally-Secure Asynchronous Multi-Party Computation Revisited. - Ashish Choudhury (DISC, 2020)

Optimally-resilient Unconditionally-secure Asynchronous Multi-party Computation Revisited. - Ashish Choudhury (IACR Cryptol. ePrint Arch., 2020)

The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited. - Laasya Bangalore; Ashish Choudhury; Arpita Patra (J. ACM, 2020)

Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries. - Ananya Appan; Anirudh Chandramouli; Ashish Choudhury (INDOCRYPT, 2022)

Revisiting the Efficiency of Asynchronous Multi Party Computation Against General Adversaries. - Ananya Appan; Anirudh Chandramouli; Ashish Choudhury (IACR Cryptol. ePrint Arch., 2022)

Perfectly Secure Synchronous MPC with Asynchronous Fallback Guarantees Against General Adversaries. - Ananya Appan; Anirudh Chandramouli; Ashish Choudhury (IACR Cryptol. ePrint Arch., 2022)

A Survey on Perfectly Secure Verifiable Secret-sharing. - Anirudh Chandramouli; Ashish Choudhury; Arpita Patra (ACM Comput. Surv., 2022)

Privacy-Preserving Plagiarism Checking. - Nidhish Bhimrajka; Sujit Chakrabarti; Ashish Choudhury; Supreeth Varadarajan (INDOCRYPT (2), 2023)

Network-Agnostic Perfectly Secure Message Transmission Revisited. - Nidhish Bhimrajka; Ashish Choudhury; Supreeth Varadarajan (INDOCRYPT (2), 2023)

Network Agnostic Perfectly Secure MPC Against General Adversaries. - Ananya Appan; Anirudh Chandramouli; Ashish Choudhury (DISC, 2023)

Network Agnostic MPC with Statistical Security. - Ananya Appan; Ashish Choudhury (IACR Cryptol. ePrint Arch., 2023)

On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience. - Ashish Choudhury; Arpita Patra (J. Cryptol., 2023)

Revisiting the Efficiency of Asynchronous MPC with Optimal Resilience Against General Adversaries. - Ananya Appan; Anirudh Chandramouli; Ashish Choudhury (J. Cryptol., 2023)

Perfectly-Secure Synchronous MPC With Asynchronous Fallback Guarantees. - Ananya Appan; Anirudh Chandramouli; Ashish Choudhury (IEEE Trans. Inf. Theory, 2023)

Network-Agnostic Multi-party Computation Revisited (Extended Abstract). - Nidhish Bhimrajka; Ashish Choudhury; Supreeth Varadarajan (Public Key Cryptography (2), 2024)

Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience. - Ashish Choudhury (Theor. Comput. Sci., 2024)

Fault-Tolerant Distributed Consensus in Synchronous Networks - Ashish Choudhury; Arpita Patra (Springer, 2025)

Network Agnostic Perfectly Secure Multiparty Computation Against General Adversaries. - Ananya Appan; Anirudh Chandramouli; Ashish Choudhury (IEEE Trans. Inf. Theory, 2025)