( en | de | ru )

 

Disambiguation of "Choudhury, Ashish"

Author of the publication

copydeleteadd this publication to your clipboard
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited.

, , and . PODC, page 295-304. ACM, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ashish Shah

Ashish Shrivastava

Ashish Choudhary

Ashish Malik

Ashish Bharadwaj

 

Other publications of authors with the same name

Multi-valued Asynchronous Reliable Broadcast with a Strict Honest Majority.. ICDCN, page 1. ACM, (2017)Network Agnostic MPC with Statistical Security., and . TCC (2), volume 14370 of Lecture Notes in Computer Science, page 63-93. Springer, (2023)Almost-Surely Terminating Asynchronous Byzantine Agreement Against General Adversaries with Optimal Resilience ✱.. ICDCN, page 167-176. ACM, (2023)Reducing the Overhead of MPC over a Large Population., , and . SCN, volume 8642 of Lecture Notes in Computer Science, page 197-217. Springer, (2014)Asynchronous Error-Decodable Secret-Sharing and Its Application.. ICISS, volume 9478 of Lecture Notes in Computer Science, page 364-377. Springer, (2015)Optimally Resilient Asynchronous MPC with Linear Communication Complexity., and . ICDCN, page 5:1-5:10. ACM, (2015)Network-Agnostic Multi-party Computation Revisited (Extended Abstract)., , and . Public Key Cryptography (2), volume 14602 of Lecture Notes in Computer Science, page 171-204. Springer, (2024)Perfectly Secure Synchronous MPC with Asynchronous Fallback Guarantees Against General Adversaries., , and . IACR Cryptol. ePrint Arch., (2022)Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries., , and . INDOCRYPT, volume 13774 of Lecture Notes in Computer Science, page 223-248. Springer, (2022)Brief announcement: optimal amortized secret sharing with cheater identification.. PODC, page 101-102. ACM, (2012)