{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T04:10:47Z","timestamp":1748751047805,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319271361"},{"type":"electronic","value":"9783319271378"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27137-8_36","type":"book-chapter","created":{"date-parts":[[2015,11,16]],"date-time":"2015-11-16T11:24:23Z","timestamp":1447673063000},"page":"492-503","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Private Matching Scheme for Friend Information Exchange"],"prefix":"10.1007","author":[{"given":"Fang","family":"Qi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenbo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,16]]},"reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325\u2013341. Springer, Heidelberg (2005)"},{"key":"36_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-642-17373-8_13","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"E Cristofaro De","year":"2010","unstructured":"De Cristofaro, E., Kim, J., Tsudik, G.: Linear-complexity private set intersection protocols secure in malicious model. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 213\u2013231. Springer, Heidelberg (2010)"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Dong, W., Dave, V., Qiu, L., Zhang, Y.: Secure friend discovery in mobile social networks. In: 2011 IEEE INFOCOM, pp. 1647\u20131655. IEEE (2011)","DOI":"10.1109\/INFCOM.2011.5934958"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"MJ Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"36_CR5","doi-asserted-by":"crossref","unstructured":"Ioannidis, I., Grama, A., Atallah, M.J.: A secure protocol for computing dotproducts in clustered and distributed environments. In: Proceedings of 2002 International Conference on Parallel Processing, pp. 379\u2013384. IEEE (2002)","DOI":"10.1109\/ICPP.2002.1040894"},{"key":"36_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"Li, M., Cao, N., Yu, S., Lou, W.: FindU: privacy-preserving personal profile matching in mobile social networks. In: 2011 IEEE INFOCOM, pp. 2435\u20132443. IEEE (2011)","DOI":"10.1109\/INFCOM.2011.5935065"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.ins.2012.09.034","volume":"258","author":"Q Liu","year":"2014","unstructured":"Liu, Q., Wang, G., Wu, J.: Time-based proxy re-encryption scheme for secure data sharing in a cloud environment. Inf. Sci. 258, 355\u2013370 (2014)","journal-title":"Inf. Sci."},{"issue":"6","key":"36_CR9","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s11036-010-0274-2","volume":"16","author":"R Lu","year":"2011","unstructured":"Lu, R., Lin, X., Liang, X., Shen, X.: A secure handshake scheme with symptoms matching for mHealthcare social network. Mob. Netw. Appl. 16(6), 683\u2013694 (2011)","journal-title":"Mob. Netw. Appl."},{"issue":"3","key":"36_CR10","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1109\/TPDS.2012.146","volume":"24","author":"R Lu","year":"2013","unstructured":"Lu, R., Lin, X., Shen, X.: SPOC: a secure and privacy-preserving opportunistic computing framework for mobile-healthcare emergency. IEEE Trans. Parallel Distrib. Syst. 24(3), 614\u2013624 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Manweiler, J., Scudellari, R., Cox, L.P.: Smile: encounter-based trust for mobile social services. In: Proceedings of the 16th ACM Conference on Computer and Communications Security, pp. 246\u2013255. ACM (2009)","DOI":"10.1145\/1653662.1653692"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Pietil\u00e4inen, A.K., Oliver, E., LeBrun, J., Varghese, G., Diot, C.: MobiClique: middleware for mobile social networking. In: Proceedings of the 2nd ACM Workshop on Online Social Networks, pp. 49\u201354. ACM (2009)","DOI":"10.1145\/1592665.1592678"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Rane, S., Sun, W., Vetro, A.: Privacy-preserving approximation of L1 distance for multimedia applications. In: 2010 IEEE International Conference on Multimedia and Expo (ICME), pp. 492\u2013497 (2010)","DOI":"10.1109\/ICME.2010.5583030"},{"issue":"1","key":"36_CR14","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/1609956.1609965","volume":"13","author":"Y Sang","year":"2009","unstructured":"Sang, Y., Shen, H.: Efficient and secure protocols for privacy-preserving set operations. ACM Trans. Inf. Syst. Secur. (TISSEC) 13(1), 9 (2009)","journal-title":"ACM Trans. Inf. Syst. Secur. (TISSEC)"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Von Arb, M., Bader, M., Kuhn, M., Wattenhofer, R.: VENETA: serverless friend-of-friend detection in mobile social networking. In: IEEE International Conference on Wireless and Mobile Computing Networking and Communications (WIMOB 08), pp. 184\u2013189. IEEE (2008)","DOI":"10.1109\/WiMob.2008.52"},{"issue":"3","key":"36_CR16","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPDS.2014.2312932","volume":"26","author":"G Wang","year":"2015","unstructured":"Wang, G., Musau, F., Guo, S., Abdullahi, M.B.: Neighbor similarity trust against sybil attack in P2P e-commerce. IEEE Trans. Parallel Distrib. Syst. 26(3), 824\u2013833 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Wang, Y., Xu, J.: Overview on privacy-preserving profile-matching mechanisms in mobile social networks in proximity (MSNP). In: 2014 Ninth Asia Joint Conference on Information Security (ASIA JCIS), pp. 133\u2013140. IEEE (2014)","DOI":"10.1109\/AsiaJCIS.2014.18"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Xie, Q., Hengartner, U.: Privacy-preserving matchmaking for mobile social networking secure against malicious users. In: 2011 Ninth Annual International Conference on Privacy, Security and Trust (PST), pp. 252\u2013259. IEEE (2011)","DOI":"10.1109\/PST.2011.5971991"},{"issue":"9","key":"36_CR19","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/JSAC.2013.SUP.0513057","volume":"31","author":"R Zhang","year":"2013","unstructured":"Zhang, R., Zhang, J., Zhang, Y., Sun, J., Yan, G.: Privacy-preserving profile matching for proximity-based mobile social networking. IEEE J. Sel. Areas Commun. 31(9), 656\u2013668 (2013)","journal-title":"IEEE J. Sel. Areas Commun."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-27137-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T12:04:48Z","timestamp":1748693088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27137-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319271361","9783319271378"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27137-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}