Theory and Practice of MPC

Publications and Preprints

  1. The Resiliency of MPC with Low Interaction: The Benefit of Making Errors. Under Submission.
    Benny Applebaum, Eliran Kachlon and Arpita Patra.
  2. On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation. In Submission.
    Arpita Patra, Divya Ravi and Swati Singla
  3. Arpita Patra, Ajith Suresh. SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. In Submission.
    Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh.
  4. Arpita Patra, Ajith Suresh. Bridge: Efficient 3-Server Mixed World Framework with Application to Distributed Machine Learning. In Submission.
    Arpita Patra and Ajith Suresh
  5. ABY2.0: More Efficient Secure Two-Party Mixed World Conversions. In Submission.
    Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame
  6. MPCLeague: Robust and Efficient Mixed-protocol Framework for 4-party Computation. Under Submission.
    Nishat Koti, Arpita Patra, Ajith Suresh.
  7. The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. FOCS 2020.
    Benny Applebaum, Eliran Kachlon, Arpita Patra
  8. BLAZE: Blazing Fast Privacy-Preserving Machine Learning. NDSS 2020.
    Arpita Patra, Ajith Suresh
  9. FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning. PETS 2020.
    Megha Byali, Harsh Chaudhari, Arpita Patra and Ajith Suresh
  10. Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. Asiacrypt 2019.
    Full and extended version in submission. [PDF].
    Arpita Patra, Divya Ravi
  11. 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
  12. Fast Actively-secure 5-Party Computation with Security Beyond Abort. ACM CCS 2019.
    Megha Byali, Carmit Hazay, Arpita Patra and Swati Singla
  13. On the power of Hybrid Networks in Secure Multi-party Computation. IEEE Transactions on Information Theory 2018.
    Arpita Patra and Divya Ravi
  14. On the Exact Round Complexity of Three-party Computation. CRYPTO'18.
    Full and extended version in submission. [PDF].
    Arpita Patra and Divya Ravi
  15. Fast Secure Computation for Small Population over the Internet. ACM CCS'18.
    with Megha Byali, Arun Joseph and Divya Ravi
  16. Efficient Adaptively Secure Zero-knowledge from Garbled Circuits. PKC 2018.
    with Chaya Ganesh, Yashvanth Kondi and Pratik Sarkar
  17. Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic. CRYPTO 2017.
    with Yashvanth Kondi
  18. Fast Actively Secure OT Extension for Short Secrets. NDSS 2017.
    with Pratik Sarkar and Ajith Suresh
  19. Round and Communication Efficient Unconditionally-Secure MPC with n > 3t in Partially Synchronous Network. ICITS 2017.
    with Ashish Choudhury and Divya Ravi
  20. An Efficient Framework for Unconditionally-secure Multiparty Computation. IEEE Transactions on Information Theory.
    with Ashish Choudhury
  21. Efficient One-Sided Adaptively Secure Computation. Journal of Cryptology, 2016.
    Full and extended version of TCC 2014. [PDF].
    with Carmit Hazay
  22. Linear Overhead Robust MPC with Honest Majority Using Preprocessing. SCN 2016. [PDF].
    with Ashish Choudhury, Emmanuela Orsini, Nigel Smart
  23. Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation. Journal of Cryptology, 2015.
    with Ashish Choudhary and C. Pandu Rangan
  24. Adaptively Secure Computation with Partial Erasures. PODC 2015.
    Full and extended version in submission. [PDF].
    with Carmit Hazay and Yehuda Lindell
  25. Optimally Resilient Asynchronous MPC with Linear Communication Complexity. ICDCN 2015 .
    with Ashish Choudhury
  26. Reducing the Overhead of MPC over a Large Population. SCN 2014. PDF.
    with Ashish Choudhury and Nigel P. Smart
  27. One-Sided Adaptively Secure Two-Party Computation. TCC 2014, LNCS 8349, pp. 368-393, 2014.
    with Carmit Hazay
  28. 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.
  29. Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity. DISC 2013, LNCS 8205, pp. 406--421, 2013. [PDF].
    with Ashish Choudhury and Martin Hirt
  30. Brief Announcement: Efficient Optimally Resilient Statistical AVSS and Its Applications. Accepted in PODC 2012, pp. 103-104, ACM Press, 2012. PDF.
    with Ashish Choudhury
  31. Computational Verifiable Secret Sharing Revisited. ASIACRYPT 2011, LNCS 7073, pp. 590-609, 2011. PDF.
    with Michael Backes and Aniket Kate
  32. 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
  33. 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
  34. 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
  35. 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

Fault-tolerant Distributed Computing

Publications and Preprints

  1. 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
  2. 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
  3. Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. PODC'18.
    with Laasya Bangalore and Ashish Choudhury
  4. 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
  5. Broadcast Extensions with Optimal Communication and Round Complexity. PODC 2016.
    with Chaya Ganesh
  6. 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
  7. 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
  8. 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
  9. Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. OPODIS 2011, LNCS 7109, pp. 34-49, 2011. PDF.
  10. 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
  11. Communication Efficient Asynchronous Byzantine Agreement. PODC 2010, pp 243-244, ACM Press, 2010. PDF.
    with C. Pandu Rangan
  12. 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
  13. On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks. ICDCN 2010, LNCS 5935, pp. 42--53, 2010. PDF.
    with Ashish Choudhury and C. Pandu Rangan
  14. Simple and Efficient Asynchronous Byzantine Agreement with Optimal Resilience. PODC 2009, pp. 92--101, ACM Press, 2009.
    with Ashish Choudhury and C. Pandu Rangan
  15. 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
  16. Perfectly Secure Message Transmission in Directed Networks Revisited. PODC 2009, pp. 278--279, ACM Press, 2009.
    with Ashish Choudhury and C. Pandu Rangan
  17. 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
  18. 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
  19. 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
  20. 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
  21. 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
  22. 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
  23. 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

Miscellaneous

Publications

  1. Selective Opening Security for Receivers. ASIACRYPT 2015. Full and extended version in submission. [PDF].
    with Carmit Hazay and Bogdan Warinschi
  2. Anonymous Authentication with Shared Secrets. LatinCrypt 2014. PDF.
    with Joel Alwen, Martin Hirt, Ueli Maurer and Pavel Raykov
  3. Key-Indistinguishable Message Authentication Codes. SCN 2014, 2014. PDF.
    with Joel Alwen, Martin Hirt, Ueli Maurer and Pavel Raykov