[1] B. Wang, B. Li, and H. Li, Gmatch: Secure and Privatepreserving
Group Matching in SocialNetworks, in
Proceedings of IEEE Globecom 2012, pp. 744-749, 2012.
[2] M. Li, N. Cao, S. Yu, and W. Lou, FindU: Private-
Preserving Personal Profile Matching in Mobile Social
Networks, in Proceedings of IEEE INFOCOM 2011, pp.
2435-2443, 2011.
[3] E. Cristofaro and G. Tsudik, Practical Private Set
Intersection Protocols with Linear Complexity, in
Proceedings of Financial Cryptography 2010, pp. 143-
159, 2010.
[4] D. Boneh, C. Gentry, B. Lynn and H. Shacham,
Aggregate and Verifiably Encrypted Signatures from
Bilinear Maps, in Proceedings of EUROCRYPT 2003,
pp. 416-432, 2006.
[5] M. Freedman, K. Nisssim, and B. Pinkas, Efficient
Private Matching and Set Intersection, in Proceedings of
EUROCRYPT 2004, pp. 1-19, 2004.
[6] P. Paillier, Public Key Cryptosystems Based on
Composite Degree Residuosity Classes, in Proceedings
of EUROCRYPT 1999, pp. 223-238, 1999.
[7] Z. Yang, B. Zhang, J. Dai, A. Champion, D. Xuan and D.
Li, ESmallTalker: A Distributed Mobile System for
Social Networking in Physical Proximity, in Proceedings
of IEEE ICDCS 2010,pp. 468-477, 2010.
[8] D. Dachman-Soled, T. Malkin, M. Raykova, and M.
Yung,“Efficient robust private set intersection,” in
ACNS ’09, 2009,pp. 125–142.
[9] G. S. Narayanan, T. Aishwarya, A. Agrawal, A. Patra,
A. Choudhary, and C. P. Rangan, “Multi party
distributed private matching, set disjointness and
cardinality of set intersection withinformation theoretic
security,” in CANS ’09. Springer - Verlag, Dec. 2009,
pp. 21–40.
[10] C. Hazay and Y. Lindell, “Efficient protocols for set
intersection and pattern matching with security against
malicious and covert adversaries,” in TCC’08, 2008, pp.
155–175.
[11] S. Jarecki and X. Liu, “Efficient oblivious
pseudorandom function with applications to adaptive ot
and secure computation of set intersection,” in TCC ’09.
Berlin, Heidelberg: Springer-Verlag, 2009, pp. 577–
594.
[12] W. Dong, V. Dave, L. Qiu, and Y. Zhang, “Secure
friend discovery in mobile social networks,” in IEEE
INFOCOM ’11, Apr 2011, pp. 1–9.
[13] E. De Cristofaro, M. Manulis, and B. Poettering,
“Private discovery of common social contacts,” in
Applied Cryptography and Network Security. Springer,
2011, pp. 147–165.
[14] E. De Cristofaro, A. Durussel, and I. Aad, “Reclaiming
privacy for smartphone applications,” in Pervasive
Computing and Communications (PerCom), 2011 IEEE
International Conference on,march 2011, pp. 84 –92.
[15] M. Ben-Or, S. Goldwasser, and A. Wigderson,
“Completeness theorems for non-cryptographic faulttolerant
distributed computation.”
[16] R. Gennaro, M. O. Rabin, and T. Rabin, “Simplified
vss and fast-track multiparty computations with
applications to threshold cryptography,” in ACM
PODC ’98, 1998, pp. 101–111.
[17] T. Nishide and K. Ohta, “Multiparty computation for
interval, equality, and comparison without bitdecomposition
protocol,” in PKC’07, 2007, pp. 343–
360.