Ashish Choudhury
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ashish Choudhury has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Arpita Patra
Indian Institute of Science, Bangalore, India
33 shared publications - Supreeth Varadarajan
International Institute of Information Technology Bangalore
4 shared publications - Ananya Appan
University of Illinois Urbana-Champaign
3 shared publications Anirudh Chandramouli
International Institute of Information Technology, Bengaluru, India
3 shared publications- Nidhish Bhimrajka
International Institute of Information Technology Bangalore
3 shared publications Arpita Patra
Indian Institute of Science, Bangalore India
2 shared publications
Latest Publications
- 6 November 2026
- Published by Springer Nature
- p. 242-277
Statistical MPC with a Constant Communication Overhead (Extended Abstract)
- 6 November 2026
- Published by Springer Nature
- p. 242-277
Statistical MPC with a Constant Communication Overhead (Extended Abstract)
- 31 October 2026
- Published by Springer Nature
- p. 87-124
(Im)possibility of Asynchronous MPC with Honest Majority over Blockchains
- 31 October 2026
- Published by Springer Nature
- p. 87-124
(Im)possibility of Asynchronous MPC with Honest Majority over Blockchains
- Open Access
- 6 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 293-296
Brief Announcement: Cryptographically Secure Domain Extension for Byzantine Agreement with Improved Round Complexity
- 6 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 293-296
Open AccessBrief Announcement: Cryptographically Secure Domain Extension for Byzantine Agreement with Improved Round Complexity
- 11 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (2) , 1332-1363
Network-Agnostic Verifiable Secret Sharing With Cryptographic Security
Verifiable Secret-Sharing (VSS) is a fundamental primitive in secure distributed computing that allows a designated dealer to share a secret among n parties in the presence of an adversary controlling at most t of them. We study VSS in the presence of computationally-bounded adversaries. Known VSS protocols tolerate up to $t_{s} \lt \frac {n}{2}$ corruptions assuming a well-behaved synchronous network but become insecure when the network delay becomes unstable. On the other hand, solutions in the asynchronous model operate under arbitrary network conditions but only tolerate up to $t_{a} \lt \frac {n}{3}$ corruptions, even when the network is well-behaved. We aim to build a network-agnostic VSS protocol with the optimal threshold conditions. A network-agnostic protocol provides the best possible security guarantees, irrespective of the type of underlying communication network. Previously, network-agnostic VSS is known either with perfect security (Appan et al. IEEE IT 2023) where the threshold conditions are not known to be optimal or with statistical security (Appan et al. TCC 2023) where the threshold conditions are optimal, but the parties need to perform exponential amount of computation and communication. Using our VSS protocol, we design a secure Multi-Party Computation (MPC) protocol in the plain Public Key Infrastructure (PKI) model, i.e., without assuming an expensive trusted setup. Although our proposed MPC protocol incurs higher communication complexity than state-of-the-art network-agnostic MPC protocols, it motivates alternative directions for designing computationally inexpensive MPC protocols based on a plain PKI setup, which has not been explored in the domain of computationally secure network-agnostic MPC and offers valuable insights into designing it.
- 11 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 72 (2) , 1332-1363
Network-Agnostic Verifiable Secret Sharing With Cryptographic Security
Verifiable Secret-Sharing (VSS) is a fundamental primitive in secure distributed computing that allows a designated dealer to share a secret among n parties in the presence of an adversary controlling at most t of them. We study VSS in the presence of computationally-bounded adversaries. Known VSS protocols tolerate up to $t_{s} \lt \frac {n}{2}$ corruptions assuming a well-behaved synchronous network but become insecure when the network delay becomes unstable. On the other hand, solutions in the asynchronous model operate under arbitrary network conditions but only tolerate up to $t_{a} \lt \frac {n}{3}$ corruptions, even when the network is well-behaved. We aim to build a network-agnostic VSS protocol with the optimal threshold conditions. A network-agnostic protocol provides the best possible security guarantees, irrespective of the type of underlying communication network. Previously, network-agnostic VSS is known either with perfect security (Appan et al. IEEE IT 2023) where the threshold conditions are not known to be optimal or with statistical security (Appan et al. TCC 2023) where the threshold conditions are optimal, but the parties need to perform exponential amount of computation and communication. Using our VSS protocol, we design a secure Multi-Party Computation (MPC) protocol in the plain Public Key Infrastructure (PKI) model, i.e., without assuming an expensive trusted setup. Although our proposed MPC protocol incurs higher communication complexity than state-of-the-art network-agnostic MPC protocols, it motivates alternative directions for designing computationally inexpensive MPC protocols based on a plain PKI setup, which has not been explored in the domain of computationally secure network-agnostic MPC and offers valuable insights into designing it.
- 25 March 2025
- Published by Springer Nature
- p. 1-11
Introduction
- 25 March 2025
- Published by Springer Nature
- p. 13-31
Preliminaries
- 25 March 2025
- Published by Springer Nature
- p. 279-312
Distributed Consensus with a Constant Expected Number of Rounds and a Strict Honest Majority
- 25 March 2025
- Published by Springer Nature
- p. 279-312
Distributed Consensus with a Constant Expected Number of Rounds and a Strict Honest Majority
- 25 March 2025
- Published by Springer Nature
- p. 217-240
Domain Extension for BA with Honest Majority and Statistical Security
- 25 March 2025
- Published by Springer Nature
- p. 217-240
Domain Extension for BA with Honest Majority and Statistical Security
- 25 March 2025
- Published by Springer Nature
- p. 133-147
Lower Bound on the Number of Rounds for Deterministic Consensus Protocols
- 25 March 2025
- Published by Springer Nature
- p. 133-147
Lower Bound on the Number of Rounds for Deterministic Consensus Protocols
- 25 March 2025
- Published by Springer Nature
- p. 83-131
Domain Extension for Distributed Consensus with Perfect Security
- 25 March 2025
- Published by Springer Nature
- p. 83-131
Domain Extension for Distributed Consensus with Perfect Security