1. Agarwal, A., Bartusek, J., Goyal, V., Khurana, D., Malavolta, G.: Post-quantum multi-party computation in constant rounds (2020). arXiv:2005.12904. https://arxiv.org/abs/2005.12904
2. Ananth, P., La Placa, R.L.: Secure quantum extraction protocols. CoRR, abs/1911.07672 (2019)
3. Barak, B.: The complexity of public-key cryptography. Cryptology ePrint Archive, Report 2017/365, 2017. https://eprint.iacr.org/2017/365
4. Bartusek, J., Coladangelo, A., Khurana, D., Ma, F.: One-way functions imply secure computation in a quantum world (2020)
5. Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: Miller, G.L. (ed.) Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pp. 479–488. ACM (1996)