[1]
|
J. Feigenbaum, “Can you take advantage of someone without having to trust him,” LNCS, Vol. 218, Springer- verlag, N.Y., pp. 477–488, 1986.
|
[2]
|
R. Cramer and I. Damgaard, “Introduction to secure multi-party computations,” In: Contemporary Cryptology, pp. 41–87, Advanced Courses in Mathematics CRM Barcelona, Birkhauser, at: http://homepages.cwi.nl/ cramer/, 2005.
|
[3]
|
O. Goldreich, “Foundations of cryptography: Basic applications,” Cambridge University Press, London, 2004.
|
[4]
|
W. L. Du and M. J. Atallah, “Secure multi-party computaion problems and their applications: A review and open problems.” In: Proceedings of New Security Paradigms Workshop, ACM Press, New York, pp. 13–22, 2001.
|
[5]
|
S. Goldwasser, “Multi-party computations: Past and present [C],” In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing (Santa Barbara, CA, August, 1997), ACM Press, New York, pp. 21–24, 1997.
|
[6]
|
S. D. Li, D. S. Wang, Y. Q. Dai, and P. Luo, “Symmetric cryptographic solution to Yao's millionaires’ problem and an evaluation of secure multiparty computations,” Information Sciences, Vol. 178, pp. 244–255, 2008.
|
[7]
|
Y. Lindell, “General composition and universal composability in secure multiparty computation,” Journal of Cryptology, Vol. 22, No. 3, pp. 395–428, 2009.
|
[8]
|
O. Goldreich, “Foundations of cryptography: Basic tools,” Cambridge University Press, London, 2001.
|