1. Ben-Or M., Goldwasser S., Wigderson A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC ’88, pp. 1–10, NY, USA (1988).
2. Cascudo I.: On squares of cyclic codes. IEEE Trans. Inf. Theory 65(2), 1034–1047 (2019).
3. Cascudo I., Cramer R., Mirandola D., Zémor G.: Squares of random linear codes. IEEE Trans. Inf. Theory 61(3), 1159–1173 (2015).
4. Cascudo I., Gundersen J.S., Ruano D.: Squares of matrix-product codes. Finite Fields Appl. 62, 101606 (2020).
5. Chaum D., Crépeau C., Damgård I.: Multiparty unconditionally secure protocols. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC ’88, pp. 11–19, NY, USA (1988).