| On the exact round complexity of secure three-party computation A Patra, D Ravi Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018 | 52 | 2018 |
| 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 | 28 | 2017 |
| On the power of hybrid networks in multi-party computation A Patra, D Ravi IEEE Transactions on Information Theory 64 (6), 4207-4227, 2018 | 23 | 2018 |
| 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 | 15 | 2021 |
| 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 | 12 | 2019 |
| 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 | 9 | 2024 |
| 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 | 7 | 2023 |
| 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 | 7 | 2022 |
| Towards Efficient YOSO MPC Without Setup. S Kolby, D Ravi, S Yakoubov IACR Cryptol. ePrint Arch. 2022, 187, 2022 | 7 | 2022 |
| Information-theoretically secure mpc against mixed dynamic adversaries I Damgård, D Escudero, D Ravi Theory of Cryptography Conference, 591-622, 2021 | 5 | 2021 |
| Crash-tolerant consensus in directed graph revisited A Choudhury, G Garimella, A Patra, D Ravi, P Sarkar Structural Information and Communication Complexity: 25th International …, 2018 | 5 | 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 | 4 | 2023 |
| Round-efficient fully secure solitary multi-party computation with honest majority S Badrinarayanan, P Mukherjee, D Ravi, P Miao US Patent 11,784,803, 2023 | 4 | 2023 |
| MPC with low bottleneck-complexity: Information-theoretic security and more H Keller, C Orlandi, A Paskin-Cherniavsky, D Ravi Cryptology ePrint Archive, 2023 | 4 | 2023 |
| 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 | 4 | 2022 |
| Round and Communication Efficient Unconditionally-Secure MPC with in Partially Synchronous Network A Choudhury, A Patra, D Ravi Information Theoretic Security: 10th International Conference, ICITS 2017 …, 2017 | 4 | 2017 |
| Secure Communication in Dynamic Incomplete Networks I Damgård, D Ravi, D Tschudi, S Yakoubov 4th Conference on Information-Theoretic Cryptography (ITC 2023), 2023 | 2 | 2023 |
| Fully-secure MPC with minimal trust Y Ishai, A Patra, S Patranabis, D Ravi, A Srinivasan Theory of Cryptography Conference, 470-501, 2022 | 2 | 2022 |
| Constant-round YOSO MPC without setup S Kolby, D Ravi, S Yakoubov Cryptology ePrint Archive, 2022 | 2 | 2022 |
Arpita PatraAssociate Professor, Dept. of Computer Science & Automation, Indian Institute of ScienceVerified email at iisc.ac.in
