|
 | Up a level |
Patra, A and Ravi, D and Singla, S (2020) On the Exact Round Complexity of Best-of-Both-Worlds Multi-party Computation. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 7 December 2020 through 11 December 2020, Daejeon; South Korea, pp. 60-91.
Patra, A and Ravi, D (2019) Beyond honest majority: The round complexity of fair and robust multi-party Computation. In: 25th International Conference on the Theory and Applications of Cryptology and Information Security, ASIACRYPT 2019, 8 - 12 December 2019, Kobe, pp. 456-487.
Choudhury, A and Garimella, G and Patra, A and Ravi, D and Sarkar, P (2018) Crash-tolerant consensus in directed graph revisited (Extended abstract). In: 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018, 18 - 21 June 2018, Ma’ale HaHamisha, pp. 55-71.
Patra, A and Ravi, D (2018) On the exact round complexity of secure three-party computation. In: 38th Annual International Cryptology Conference, CRYPTO 2018, 19 - 23 August 2018, Santa Barbara, pp. 425-458.
Choudhury, A and Garimella, G and Patra, A and Ravi, D and Sarkar, P (2017) Brief announcement: Crash-tolerant consensus in directed graph revisited. In: 31st International Symposium on Distributed Computing, DISC 2017, 16 - 20 October 2017, Vienna.
Patra, A and Ravi, D (2021) On the Exact Round Complexity of Secure Three-Party Computation. In: Journal of Cryptology, 34 (4).
