1. Joy Algesheimer, Jan Camenisch, and Victor Shoup. 2002. Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products. In Advances in Cryptology - CRYPTO 2002, 22nd Annual International Cryptology Conference, Santa Barbara, California, USA, August 18--22, 2002, Proceedings (Lecture Notes in Computer Science), Moti Yung (Ed.), Vol. 2442. Springer, 417--432. https://doi.org/10.1007/3--540--45708--9_27
2. Yonatan Aumann and Yehuda Lindell. 2010. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. J. Cryptology , Vol. 23, 2 (2010), 281--343. https://doi.org/10.1007/s00145-009--9040--7
3. Carsten Baum, Ivan Damgård, and Claudio Orlandi. 2014. Publicly Auditable Secure Multi-Party Computation. In Security and Cryptography for Networks - 9th International Conference, SCN 2014. Proceedings (LNCS), Michel Abdalla and Roberto De Prisco (Eds.), Vol. 8642. Springer, 175--196. https://doi.org/10.1007/978--3--319--10879--7_11
4. Dan Bogdanov, Peeter Laud, Sven Laur, and Pille Pullonen. 2014b. From Input Private to Universally Composable Secure Multi-party Computation Primitives. In IEEE 27th Computer Security Foundations Symposium, CSF 2014 . IEEE, 184--198.
5. Dan Bogdanov, Peeter Laud, and Jaak Randmets. 2014a. Domain-Polymorphic Programming of Privacy-Preserving Applications. In Proceedings of the Ninth Workshop on Programming Languages and Analysis for Security, PLAS@ECOOP 2014, Uppsala, Sweden, July 29, 2014 , , Alejandro Russo and Omer Tripp (Eds.). ACM , 53. https://doi.org/10.1145/2637113.2637119