1. Multiparty computations ensuring privacy of each party's input, correctness of the result;Chaum,1988
2. R. Cramer, I. Damgård, S. Dziembowski, M. Hirt, T. Rabin, Efficient multiparty computations with dishonest minority, Advances in Cryptology – EUROCRYPT 99, Lecture Notes in Computer Science, vol. 1561, Springer, Berlin, March 1999, pp. 311–326.
3. Discreet solitary games;Crépeau,1994
4. B. den Boer, More efficient match-making and satisfiability: the five card trick. in: J.-J. Quisquater, J. Vandewalle (Eds.) Advances in Cryptology – EUROCRYPT 89, Lecture Notes in Computer Science, vol. 434, Springer, Verlag, 1990, 10–13 April 1989, pp. 208–217.
5. O. Goldreich, S. Micali, A. Wigderson, How to play any mental game – A completeness theorem for protocols with honest majority, in: ACM (Ed.), Proc. nineteenth Ann. ACM Symp. on Theory of Computing, New York City, May 25–27, 1987, ACM Press, New York, NY 10036, USA, 1987, pp. 218–229.