Goldreich O, Micali S, Wigderson A. How to play any mental game//Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing. New York: ACM Press, 1987: 218-229.
[2]
Goldreich O. Foundations of cryptography, basic applications[M]. Cambridge: Cambridge University Press, 2004. 233-278.
[3]
Freedman M J, Nissim K, Pinkas B. Efficient private matching and set intersection//Advances in Cryptology-EUROCRYPT 04, LNCS. Berlin: Springer, 2004: 1-19.
[4]
Hazay C, Lindell Y. Efficient protocol for set intersection and pattern matching with security against malicious and covert adversaries//TCC '08, LNCS. Berlin: Springer, 2008: 155-175.
[5]
Brickel J, Shmatikov V. Privacy-preserving graph algorithms in the semi-honest model//Proceedings of Advances in Cryptology-ASIACRYPT 05, LNCS. Berlin: Springer, 2005: 236-252.
[6]
Shamir A. How to share a secret//Communications of the ACM. : ACM Press, 1977: 612-613.
