| On the exact round complexity of secure three-party computation A Patra, D Ravi Journal of Cryptology 34 (4), 40, 2021 | 57 | 2021 |
| Fast secure computation for small population over the internet M Byali, A Joseph, A Patra, D Ravi Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications …, 2018 | 36 | 2018 |
| Fast and universally-composable oblivious transfer and commitment scheme with adaptive security M Byali, A Patra, D Ravi, P Sarkar Cryptology ePrint Archive, 2017 | 30 | 2017 |
| Broadcast-optimal two round MPC with an honest majority I Damgård, B Magri, D Ravi, L Siniscalchi, S Yakoubov Annual International Cryptology Conference, 155-184, 2021 | 25 | 2021 |
| On the power of hybrid networks in multi-party computation A Patra, D Ravi IEEE Transactions on Information Theory 64 (6), 4207-4227, 2018 | 25 | 2018 |
| Minimizing setup in broadcast-optimal two round MPC I Damgård, D Ravi, L Siniscalchi, S Yakoubov Annual International Conference on the Theory and Applications of …, 2023 | 17 | 2023 |
| Asterisk: Super-fast MPC with a Friend B Karmakar, N Koti, A Patra, S Patranabis, P Paul, D Ravi 2024 IEEE Symposium on Security and Privacy (SP), 542-560, 2024 | 16 | 2024 |
| Round-optimal multi-party computation with identifiable abort M Ciampi, D Ravi, L Siniscalchi, H Waldner Annual International Conference on the Theory and Applications of …, 2022 | 16 | 2022 |
| Beyond honest majority: The round complexity of fair and robust multi-party computation A Patra, D Ravi International Conference on the Theory and Application of Cryptology and …, 2019 | 13 | 2019 |
| Towards Efficient YOSO MPC Without Setup. S Kolby, D Ravi, S Yakoubov IACR Cryptol. ePrint Arch. 2022, 187, 2022 | 12 | 2022 |
| Taming adaptivity in YOSO protocols: The modular way R Canetti, S Kolby, D Ravi, E Soria-Vazquez, S Yakoubov Theory of Cryptography Conference, 33-62, 2023 | 10 | 2023 |
| Constant-round YOSO MPC without setup S Kolby, D Ravi, S Yakoubov Cryptology ePrint Archive, 2022 | 10 | 2022 |
| Crash-tolerant consensus in directed graph revisited A Choudhury, G Garimella, A Patra, D Ravi, P Sarkar International Colloquium on Structural Information and Communication …, 2018 | 9 | 2018 |
| On the round complexity of fully secure solitary MPC with honest majority S Badrinarayanan, P Miao, P Mukherjee, D Ravi Theory of Cryptography Conference, 124-155, 2023 | 8 | 2023 |
| Information-theoretically secure mpc against mixed dynamic adversaries I Damgård, D Escudero, D Ravi Theory of Cryptography Conference, 591-622, 2021 | 6 | 2021 |
| MPC with low bottleneck-complexity: Information-theoretic security and more H Keller, C Orlandi, A Paskin-Cherniavsky, D Ravi Cryptology ePrint Archive, 2023 | 5 | 2023 |
| Fully-secure MPC with minimal trust Y Ishai, A Patra, S Patranabis, D Ravi, A Srinivasan Theory of Cryptography Conference, 470-501, 2022 | 5 | 2022 |
| On the bottleneck complexity of mpc with correlated randomness C Orlandi, D Ravi, P Scholl IACR International Conference on Public-Key Cryptography, 194-220, 2022 | 5 | 2022 |
| Round and Communication Efficient Unconditionally-Secure MPC with in Partially Synchronous Network A Choudhury, A Patra, D Ravi International Conference on Information Theoretic Security, 83-109, 2017 | 5 | 2017 |
| Threshold-optimal MPC with friends and foes N Melissaris, D Ravi, S Yakoubov International Conference on Cryptology in India, 3-24, 2023 | 4 | 2023 |
Arpita PatraAssociate Professor, Dept. of Computer Science & Automation, Indian Institute of ScienceVerified email at iisc.ac.in
