1. Lecture Notes in Computer Science;P Ananth,2018
2. Lecture Notes in Computer Science;P Ananth,2019
3. Lecture Notes in Computer Science;B Barak,2001
4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th ACM STOC. ACM Press, May 1988
5. Badrinarayanan, S., Miao, P., Mukherjee, P., Ravi, D.: On the round complexity of fully secure solitary MPC with honest majority. Cryptology ePrint Archive, Report 2021/241 (2021). https://eprint.iacr.org/2021/241