Journals

Publications and Preprints

  1. Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. In Submission.
    Full and extended version of ASIACRYPT 2019. [PDF].
    Arpita Patra and Divya Ravi
  2. Adaptively Secure Computation with Partial Erasures. In submission. [PDF].
    Carmit Hazay and Yehuda Lindell and Arpita Patra
    3.
  3. On the Exact Round Complexity of Three-party Computation. Journal of Cryptology 2021.
    Full and extended version of CRYPTO 2018 [PDF]
    Arpita Patra and Divya Ravi
  4. The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited. Journal of ACM 2020.
    Full and extended version of PODC'18.
    Laasya Bangalore, Ashish Choudhury and Arpita Patra
  5. Optimal Extension Protocols for Byzantine Broadcast and Agreement. Distributed Computing 2020.
    Full and extended version of PODC'16 and OPODIS'11. [PDF].
    Chaya Ganesh, Arpita Patra
  6. On the power of Hybrid Networks in Secure Multi-party Computation. IEEE Transactions on Information Theory 2018.
    Arpita Patra and Divya Ravi
  7. An Efficient Framework for Unconditionally-secure Multiparty Computation. IEEE Transactions on Information Theory.
    Ashish Choudhury and Arpita Patra
  8. Efficient One-Sided Adaptively Secure Computation. Journal of Cryptology, 2016. PDF.
    with Carmit Hazay
  9. Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation. Journal of Cryptology, 2015.
    with Ashish Choudhary and C. Pandu Rangan
  10. Efficient Asynchronous Byzantine Agreement with Optimal Resilience. Distributed Computing Journal, volume 27, number 2, pp. 111- 146, 2014. PDF.
    with Ashish Choudhary and C. Pandu Rangan
  11. On the Tradeoff Between Network Connectivity, Round Complexity and Communication Complexity of Reliable Message Transmission. Journal of ACM, 2012. PDF.
    with Ashwinkumar Badanidiyuru, Ashish Choudhury, Kannan Srinathan and C. Pandu Rangan
  12. Secure Message Transmission in Asynchronous Networks. Journal of Parallel and Distributed Computing, vol. 71, no. 8, pp. 1067-1074, 2011. PDF.
    with Ashish Choudhury, Ashwinkumar B. V, Kannan Srinathan and C. Pandu Rangan
  13. Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality. International Journal of Applied Cryptography (IJACT), vol 2, Issue 2, pp. 159-197, 2010. PDF.
    with Ashish Choudhury, Kannan Srinathan and C. Pandu Rangan
  14. Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. International Journal of Applied Cryptography (IJACT), vol. 1, Issue 3, pp. 200-224, 2009.
    with Ashish Choudhury, Kannan Srinathan, C. Pandu Rangan and Prasad Raghavendra

Conference

Publications and Preprints

  1. Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. CRYPTO 2021.
    Arpita Patra, Akshayaram Srinivasan.
  2. SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. Usenix Security Symposium 2021. (Brief Announcement in NeurIPS PRIML and PPML Workshop 2020.)
    Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh.
  3. ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation Usenix Security Symposium 2021.
    Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame
  4. The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. FOCS 2020.
    Benny Applebaum, Eliran Kachlon, Arpita Patra
  5. The Resiliency of MPC with Low Interaction: The Benefit of Making Errors. TCC 2020.
    Benny Applebaum, Eliran Kachlon and Arpita Patra.
  6. On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation. ASIACRYPT 2020.
    Arpita Patra, Divya Ravi and Swati Singla
  7. BLAZE: Blazing Fast Privacy-Preserving Machine Learning. NDSS 2020.
    Arpita Patra, Ajith Suresh
  8. FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning. PETS 2020.
    Megha Byali, Harsh Chaudhari, Arpita Patra and Ajith Suresh
  9. Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. Asiacrypt 2019.
    Arpita Patra, Divya Ravi
  10. ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. ACM CCSW 2019, PPML 2019.
    Harsh Chaudhari, Ashish Choudhury, Arpita Patra and Ajith Suresh
  11. Fast Actively-secure 5-Party Computation with Security Beyond Abort. ACM CCS 2019.
    with Megha Byali, Carmit Hazay and Swati Singla
  12. On the Exact Round Complexity of Three-party Computation. CRYPTO'18.
    with Divya Ravi
  13. Fast Secure Computation for Small Population over the Internet. ACM CCS'18.
    with Megha Byali, Arun Joseph and Divya Ravi
  14. Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. PODC'18.
    with Laasya Bangalore and Ashish Choudhury
  15. Crash-tolerant Consensus in Directed Graph Revisited. DISC 2017 (brief announcement); SIROCCO 2018 (full paper).
    with Ashish Choudhury, Gayathri Garimella, Divya Ravi and Pratik Sarkar
  16. Efficient Adaptively Secure Zero-knowledge from Garbled Circuits. PKC 2018.
    with Chaya Ganesh, Yashvanth Kondi and Pratik Sarkar
  17. Round and Communication Efficient Unconditionally-Secure MPC with n > 3t in Partially Synchronous Network. ICITS 2017.
    with Ashish Choudhury and Divya Ravi
  18. Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic. CRYPTO 2017.
    with Yashvanth Kondi
  19. Fast Actively Secure OT Extension for Short Secrets. NDSS 2017.
    with Pratik Sarkar and Ajith Suresh
  20. Linear Overhead Robust MPC with Honest Majority Using Preprocessing. SCN 2016. [PDF].
    with Ashish Choudhury, Emmanuela Orsini, Nigel Smart
  21. Broadcast Extensions with Optimal Communication and Round Complexity. PODC 2016.
    with Chaya Ganesh
  22. Selective Opening Security for Receivers. ASIACRYPT 2015.
    with Carmit Hazay and Bogdan Warinschi
  23. Adaptively Secure Computation with Partial Erasures. PODC 2015.
    with Carmit Hazay and Yehuda Lindell
  24. Optimally Resilient Asynchronous MPC with Linear Communication Complexity. ICDCN 2015 .
    with Ashish Choudhury
  25. Anonymous Authentication with Shared Secrets. LatinCrypt 2014. PDF.
    with Joel Alwen, Martin Hirt, Ueli Maurer and Pavel Raykov
  26. Reducing the Overhead of MPC over a Large Population. SCN 2014. PDF.
    with Ashish Choudhury and Nigel P. Smart
  27. Key-Indistinguishable Message Authentication Codes. Accepted in SCN 2014. PDF.
    with Joel Alwen, Martin Hirt, Ueli Maurer and Pavel Raykov
  28. One-Sided Adaptively Secure Two-Party Computation. TCC 2014, LNCS 8349, pp. 368-393, 2014. PDF.
    with Carmit Hazay
  29. Between a Rock and a Hard Place: Interpolating Between MPC and FHE. ASIACRYPT 2013, LNCS 8270, pp. 221-240, 2013. PDF.
    with Ashish Choudhury, Jake Loftus, Emmanuela Orsini and Nigel P. Smart.
  30. Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity. DISC 2013, LNCS 8205, pp. 406--421, 2013. PDF.
    with Ashish Choudhury and Martin Hirt
  31. Brief Announcement: Efficient Optimally Resilient Statistical AVSS and Its Applications. PODC 2012, pp. 103-104, ACM Press, 2012. PDF.
    with Ashish Choudhury
  32. Computational Verifiable Secret Sharing Revisited. ASIACRYPT 2011, LNCS 7073, pp. 590-609, 2011. PDF.
    with Michael Backes and Aniket Kate
  33. Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. OPODIS 2011, LNCS 7109, pp. 34-49, 2011. PDF.
  34. Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. ACNS 2011, LNCS 6715, pp. 292-308, 2011.PDF.
    with Ashish Choudhury and Kaoru Kurosawa
  35. The Round Complexity of Verifiable Secret Sharing: The Statistical Case. ASIACRYPT 2010, LNCS 6477, pp. 431-447, 2010. PDF.
    with Ranjit Kumaresan and C. Pandu Rangan
  36. Communication Efficient Asynchronous Byzantine Agreement. PODC 2010, pp 243-244, ACM Press, 2010. PDF.
    with C. Pandu Rangan
  37. Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. AFRICACRYPT 2010, LNCS 6055, pp. 184--202, 2010.
    with Ashish Choudhury and C. Pandu Rangan
  38. Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality. International Journal of Applied Cryptography (IJACT), vol 2, Issue 2, pp. 159-197, 2010.
    with Ashish Choudhury, Kannan Srinathan and C. Pandu Rangan
  39. On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks. ICDCN 2010, LNCS 5935, pp. 42--53, 2010.
    with Ashish Choudhury and C. Pandu Rangan
  40. Information Theoretically Secure Multi Party Set Intersection Re-Visited. SAC 2009, LNCS 5867, pp. 71--91, 2009.PDF.
    with Ashish Choudhury and C. Pandu Rangan
  41. Simple and Efficient Asynchronous Byzantine Agreement with Optimal Resilience. PODC 2009, pp. 92--101, ACM Press, 2009.
    with Ashish Choudhury and C. Pandu Rangan
  42. The Round Complexity of Verifiable Secret Sharing Revisited. CRYPTO 2009, LNCS 5677, pp. 487--504, 2009. PDF.
    with Ashish Choudhury, Tal Rabin and C. Pandu Rangan
  43. Perfectly Secure Message Transmission in Directed Networks Revisited. PODC 2009, pp. 278--279, ACM Press, 2009.
    with Ashish Choudhury and C. Pandu Rangan
  44. On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. ICDCN 2009, LNCS 5408, pp. 148--162, 2009.
    with Ashish Choudhury, Ashwinkumar B.V, Kannan Srinathan and C. Pandu Rangan
  45. On Tradeoff Between Network Connectivity, Phase Complexity and Communication Complexity of Reliable Communication Tolerating Mixed Adversary. PODC 2008, pp. 115--124, ACM Press, 2008
    with Ashish Choudhury, Ashwinkumar B.V, Kannan Srinathan and C. Pandu Rangan
  46. Brief Announcement: Efficient Single Phase Unconditionally Secure Message Transmission with Optimum Communication Complexity. PODC 2008, pp. 457, ACM Press, 2008.
    with Ashish Choudhury, Kannan Srinathan and C. Pandu Rangan
  47. Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary. ACISP 2008, LNCS 5107, pp. 170--186, 2008.
    with Ashish Choudhury, Madhu Gayatri and C. Pandu Rangan
  48. Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. SCN 2008, LNCS 5229, pp. 309--326, 2008.
    with Ashish Choudhury and C. Pandu Rangan
  49. Constant Phase Efficient Protocols for Perfectly Secure Message Transmission in Directed Networks. PODC 2007, pp. 322-323, ACM Press, 2007.
    with Ashish Choudhury and C. Pandu Rangan
  50. Perfectly Secure Message Transmission in Directed Networks Tolerating Mixed Adversary. DISC 2007, LNCS 4731, pp. 496--498, 2007.
    with Ashish Choudhury, Kannan Srinathan and C. Pandu Rangan