Ashish Choudhury
Orcid: 0000-0002-2428-9537
According to our database1,
Ashish Choudhury
authored at least 106 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Proceedings of the Public-Key Cryptography - PKC 2024, 2024
2023
IEEE Trans. Inf. Theory, August, 2023
Revisiting the Efficiency of Asynchronous MPC with Optimal Resilience Against General Adversaries.
J. Cryptol., July, 2023
On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience.
J. Cryptol., April, 2023
Proceedings of the 37th International Symposium on Distributed Computing, 2023
Proceedings of the Progress in Cryptology - INDOCRYPT 2023, 2023
Proceedings of the Progress in Cryptology - INDOCRYPT 2023, 2023
2022
ACM Comput. Surv., January, 2022
Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal Resilience.
IACR Cryptol. ePrint Arch., 2022
Perfectly Secure Synchronous MPC with Asynchronous Fallback Guarantees Against General Adversaries.
IACR Cryptol. ePrint Arch., 2022
Revisiting the Efficiency of Asynchronous Multi Party Computation Against General Adversaries.
IACR Cryptol. ePrint Arch., 2022
Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries.
Proceedings of the Progress in Cryptology - INDOCRYPT 2022, 2022
2020
J. ACM, 2020
Optimally-resilient Unconditionally-secure Asynchronous Multi-party Computation Revisited.
IACR Cryptol. ePrint Arch., 2020
Brief Announcement: Optimally-Resilient Unconditionally-Secure Asynchronous Multi-Party Computation Revisited.
Proceedings of the 34th International Symposium on Distributed Computing, 2020
Brief Announcement: Almost-surely Terminating Asynchronous Byzantine Agreement Protocols with a Constant Expected Running Time.
Proceedings of the PODC '20: ACM Symposium on Principles of Distributed Computing, 2020
Proceedings of the Progress in Cryptology - INDOCRYPT 2020, 2020
High Throughput Secure MPC over Small Population in Hybrid Networks (Extended Abstract).
Proceedings of the Progress in Cryptology - INDOCRYPT 2020, 2020
Improving the Efficiency of Optimally-Resilient Statistically-Secure Asynchronous Multi-party Computation.
Proceedings of the Progress in Cryptology - INDOCRYPT 2020, 2020
2019
IACR Cryptol. ePrint Arch., 2019
Proceedings of the 20th International Conference on Distributed Computing and Networking, 2019
2018
IACR Cryptol. ePrint Arch., 2018
IACR Cryptol. ePrint Arch., 2018
Proceedings of the Structural Information and Communication Complexity, 2018
Brief Announcement: Asynchronous Secure Distributed Computing with Transferrable Non-equivocation Revisited.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018
2017
IEEE Trans. Inf. Theory, 2017
Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network.
IACR Cryptol. ePrint Arch., 2017
Proceedings of the 31st International Symposium on Distributed Computing, 2017
Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous Network.
Proceedings of the Information Theoretic Security - 10th International Conference, 2017
Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017
2016
Proceedings of the Security and Cryptography for Networks - 10th International Conference, 2016
2015
J. Cryptol., 2015
IACR Cryptol. ePrint Arch., 2015
Proceedings of the Information Systems Security - 11th International Conference, 2015
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015
2014
Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014
2013
IACR Cryptol. ePrint Arch., 2013
Proceedings of the Distributed Computing - 27th International Symposium, 2013
Breaking the ${\mathcal{O}}(n|C|)$ Barrier for Unconditionally Secure Asynchronous Multiparty Computation - (Extended Abstract).
Proceedings of the Progress in Cryptology - INDOCRYPT 2013, 2013
2012
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission.
J. ACM, 2012
Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity.
IACR Cryptol. ePrint Arch., 2012
Brief announcement: efficient optimally resilient statistical AVSS and its applications.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012
2011
J. Parallel Distributed Comput., 2011
On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks.
IACR Cryptol. ePrint Arch., 2011
Statistical Asynchronous Weak Commitment Scheme: A New Primitive to Design Statistical Asynchronous Verifiable Secret Sharing Scheme.
IACR Cryptol. ePrint Arch., 2011
Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary.
IACR Cryptol. ePrint Arch., 2011
IACR Cryptol. ePrint Arch., 2011
Proceedings of the Information Theoretic Security - 5th International Conference, 2011
2010
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality.
Int. J. Appl. Cryptogr., 2010
Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience.
IACR Cryptol. ePrint Arch., 2010
IACR Cryptol. ePrint Arch., 2010
Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010
Proceedings of the Distributed Computing and Networking, 11th International Conference, 2010
2009
Breaking the data encryption standard using networks of evolutionary processors with parallel string rewriting rules.
Int. J. Comput. Math., 2009
Int. J. Appl. Cryptogr., 2009
Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience.
IACR Cryptol. ePrint Arch., 2009
On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks.
IACR Cryptol. ePrint Arch., 2009
IACR Cryptol. ePrint Arch., 2009
Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security.
IACR Cryptol. ePrint Arch., 2009
Brief announcement: perfectly secure message transmission in directed networks re-visited.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009
Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience.
Proceedings of the Progress in Cryptology, 2009
Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience.
Proceedings of the Information Theoretic Security, 4th International Conference, 2009
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009
Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience.
Proceedings of the Information Security and Cryptology - 5th International Conference, 2009
2008
Unconditionally Secure Message Transmission in Arbitrary Directed Synchronous Networks Tolerating Generalized Mixed Adversary.
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
IACR Cryptol. ePrint Arch., 2008
Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited.
Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008
Efficient single phase unconditionally secure message transmission with optimum communication complexity.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary.
Proceedings of the Information Theoretic Security, Third International Conference, 2008
Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary.
Proceedings of the Information Security and Privacy, 13th Australasian Conference, 2008
2007
Control approaches for probabilistic gene regulatory networks - What approaches have been developed for addreassinig the issue of intervention?
IEEE Signal Process. Mag., 2007
RAIRO Theor. Informatics Appl., 2007
Biosyst., 2007
Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary.
Proceedings of the Distributed Computing, 21st International Symposium, 2007
Constant phase efficient protocols for secure message transmission in directed networks.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007
Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality.
Proceedings of the Progress in Cryptology, 2007
Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary.
Proceedings of the Cryptology and Network Security, 6th International Conference, 2007
2006
Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission.
Proceedings of the Progress in Cryptology, 2006
Proceedings of the 45th IEEE Conference on Decision and Control, 2006
2005
Proceedings of the Mechanisms, 2005
Proceedings of the Mechanisms, 2005
Accepting Hybrid Networks of Evolutionary Processors with Splicing Rules and Forbidding Context.
Proceedings of the 2nd Indian International Conference on Artificial Intelligence, 2005
Proceedings of the American Control Conference, 2005
2004
External control in Markovian genetic regulatory networks: the imperfect information case.
Bioinform., 2004
2003
Proceedings of the 42nd IEEE Conference on Decision and Control, 2003