{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T04:07:17Z","timestamp":1747282037305,"version":"3.40.5"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319147161"},{"type":"electronic","value":"9783319147178"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14717-8_24","type":"book-chapter","created":{"date-parts":[[2014,12,17]],"date-time":"2014-12-17T14:17:28Z","timestamp":1418825848000},"page":"305-318","source":"Crossref","is-referenced-by-count":2,"title":["A Secure and Efficient Privacy-Preserving Attribute Matchmaking Protocol in Proximity-Based Mobile Social Networks"],"prefix":"10.1007","author":[{"given":"Solomon","family":"Sarpong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunxiang","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-19379-8_10","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"G. Ateniese","year":"2011","unstructured":"Ateniese, G., De Cristofaro, E., Tsudik, G. (If) size matters: Size-hiding private set intersection. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol.\u00a06571, pp. 156\u2013173. Springer, Heidelberg (2011)"},{"key":"24_CR2","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.\u00a03621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"24_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-14577-3_13","volume-title":"Financial Cryptography and Data Security","author":"E. Cristofaro De","year":"2010","unstructured":"De Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Sion, R. (ed.) FC 2010. LNCS, vol.\u00a06052, pp. 143\u2013159. Springer, Heidelberg (2010)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-21599-5_18","volume-title":"Trust and Trustworthy Computing","author":"E. Cristofaro De","year":"2011","unstructured":"De Cristofaro, E., Lu, Y., Tsudik, G.: Efficient techniques for privacy-preserving sharing of sensitive information. In: McCune, J.M., Balacheff, B., Perrig, A., Sadeghi, A.-R., Sasse, A., Beres, Y. (eds.) Trust 2011. LNCS, vol.\u00a06740, pp. 239\u2013253. Springer, Heidelberg (2011)"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Yang, Z., Zhang, B., Dai, J., Champion, A., Xuan, D., Li, D.: Esmalltalker: A distributed mobile system for social networking In physical proximity. In: IEEE, ICDCS, pp. 468\u2013477 (2010)","DOI":"10.1109\/ICDCS.2010.56"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Eagle, N., Pentland, A.: Social Serendipity: Mobilizing Social Software. In: IEEE Pervasive Computing, Special Issue: The Smartphone, pp. 28\u201334 (2005)","DOI":"10.1109\/MPRV.2005.37"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Xie, Q., Hengartner, U.: Privacy-Preserving Matchmaking for Mobile Social Networking Secure Against Malicious Users. In: Proc. 9th Int\u2032l. Conf. on Privacy, Security (PST), and Trust 2011, pp. 252\u2013259 (2011)","DOI":"10.1109\/PST.2011.5971991"},{"key":"24_CR8","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.\u00a06477, pp. 213\u2013231. Springer, Heidelberg (2010)"},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Evfimievski, A., Srikant, R.: Information Sharing Across Private Databases. In: Proc. of SIGMOD, pp. 86\u201397 (2003)","DOI":"10.1145\/872769.872771"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-03549-4_7","volume-title":"Financial Cryptography and Data Security","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Zaverucha, G.M.: Private intersection of certified sets. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.\u00a05628, pp. 108\u2013127. Springer, Heidelberg (2009)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Wang, Y., Zhang, T., Li, H., He, L., Peng, J.: Efficient Privacy Preserving Matchmaking for Mobile Social Networking against Malicious Users. In: IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications, pp. 609\u2013615 (2012)","DOI":"10.1109\/TrustCom.2012.142"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-03168-7_10","volume-title":"Privacy Enhancing Technologies","author":"E. Cristofaro De","year":"2009","unstructured":"De Cristofaro, E., Jarecki, S., Kim, J., Tsudik, G.: Privacy-preserving policy-based information transfer. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol.\u00a05672, pp. 164\u2013184. Springer, Heidelberg (2009)"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., Durussel, A., Aad, I.: Reclaiming Privacy for Smartphone Applications. In: IEEE International Proc. of Pervasive Computing and Communications (PerCom), pp. 84\u201392 (2011)","DOI":"10.1109\/PERCOM.2011.5767598"},{"key":"24_CR14","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":"M.J. 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.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Kjeldskov, J., Paay, J.: Just-for-Us: A Context-Aware Mobile Information System Facilitating Sociality. In: Proc. 7th International. Conf. on Human Computer Interaction with Mobile Devices and Services, pp. 23\u201330 (2005)","DOI":"10.1145\/1085777.1085782"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Li, K., Sohn, T., Huang, S., Griswold, W.: PeopleTones: A System for the Detection and Notification of Buddy Proximity on Mobile Phones. In: Proc. 6th Intl. Conf. on Mobile Systems (MobiSys), pp. 160\u2013173 (2008)","DOI":"10.1145\/1378600.1378619"},{"issue":"3","key":"24_CR17","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s00145-008-9034-x","volume":"23","author":"C. Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. Journal of Cryptology\u00a023(3), 422\u2013456 (2010)","journal-title":"Journal of Cryptology"},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-00457-5_34","volume-title":"Theory of Cryptography","author":"S. Jarecki","year":"2009","unstructured":"Jarecki, S., Liu, X.: Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 577\u2013594. Springer, Heidelberg (2009)"},{"issue":"3","key":"24_CR19","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-health emergency. IEEE Transactions on Parallel and Distributed Systems\u00a024(3), 614\u2013624 (2013)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"24_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-01957-9_8","volume-title":"Applied Cryptography and Network Security","author":"D. Dachman-Soled","year":"2009","unstructured":"Dachman-Soled, D., Malkin, T., Raykova, M., Yung, M.: Efficient robust private set intersection. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol.\u00a05536, pp. 125\u2013142. Springer, Heidelberg (2009)"},{"key":"24_CR21","doi-asserted-by":"crossref","unstructured":"Liu, M., Lou, W.: FindU: Privacy-preserving personal profile matching in mobile social networks. In: Proc. of Infocom (2011)","DOI":"10.1109\/INFCOM.2011.5935065"},{"key":"24_CR22","doi-asserted-by":"crossref","unstructured":"Lu, R., Lin, X., Liang, X., Shen, X.: Secure handshake with symptoms-matching: the essential to the success of mhealthcare social network. In: Proc. BodyNets (2010)","DOI":"10.1145\/2221924.2221927"},{"key":"24_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-14577-3_13","volume-title":"Financial Cryptography and Data Security","author":"E. Cristofaro De","year":"2010","unstructured":"De Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Sion, R. (ed.) FC 2010. LNCS, vol.\u00a06052, pp. 143\u2013159. Springer, Heidelberg (2010)"},{"key":"24_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-00468-1_12","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Kohlweiss, M., Rial, A., Sheedy, C.: Blind and anonymous identity-based encryption and authorised private searches on public key encrypted data. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, pp. 196\u2013214. Springer, Heidelberg (2009)"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-30057-8_25","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"E. Stefanov","year":"2012","unstructured":"Stefanov, E., Shi, E., Song, D.: Policy-enhanced private set intersection: Sharing information while enforcing privacy policies. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol.\u00a07293, pp. 413\u2013430. Springer, Heidelberg (2012)"},{"key":"24_CR26","unstructured":"Sarpong, S., Xu, C.: A Secure and Efficient Privacy-preserving Matchmaking for Mobile Social Network. In: International Conference on Computer, Network Security and Communication Engineering (CNSCE), pp. 362\u2013366 (2014)"},{"key":"24_CR27","unstructured":"Rabin, M.: How to exchange secrets by oblivious transfer, Tech. Rep. TR-81, Harvard Aiken Computation Laboratory (1981)"},{"key":"24_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-03168-7_10","volume-title":"Privacy Enhancing Technologies","author":"E. Cristofaro De","year":"2009","unstructured":"De Cristofaro, E., Jarecki, S., Kim, J., Tsudik, G.: Privacy-preserving policy-based information transfer. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol.\u00a05672, pp. 164\u2013184. Springer, Heidelberg (2009)"},{"key":"24_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-39568-7_5","volume-title":"Advances in Cryptology","author":"A. Shamir","year":"1985","unstructured":"Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 47\u201353. Springer, Heidelberg (1985)"},{"issue":"3","key":"24_CR30","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/s00145-008-9034-x","volume":"23","author":"C. Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries. Journal of Cryptology\u00a023(3), 422\u2013456 (2010)","journal-title":"Journal of Cryptology"},{"key":"24_CR31","unstructured":"Lin, H., Chow, S.S.M., Xing, D., Fang, Y., Cao, Z.: Privacy preserving friend search over online social networks. Cryptology EPrint Archive (2011), http:\/\/eprint.iacr.org\/2011\/445.pdf"},{"key":"24_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-00468-1_12","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"J. Camenisch","year":"2009","unstructured":"Camenisch, J., Kohlweiss, M., Rial, A., Sheedy, C.: Blind and anonymous identity-based encryption and authorised private searches on public key encrypted data. In: Jarecki, S., Tsudik, G. (eds.) PKC 2009. LNCS, vol.\u00a05443, pp. 196\u2013214. Springer, Heidelberg (2009)"},{"key":"24_CR33","doi-asserted-by":"crossref","unstructured":"Sun, J., Zhu, X., Fang, Y.: A privacy-preserving scheme for online social networks with efficient revocation. In: Proceedings of the IEEE Conference on Computer Communications (INFOCOM 2010), pp. 1\u20139.","DOI":"10.1109\/INFCOM.2010.5462080"},{"key":"24_CR34","doi-asserted-by":"crossref","unstructured":"Li, M., Cao, N., Yu, S., Lou, W.: FindU: Privacy-preserving personal profile matching in mobile social networks. In: Proc. of IEEE Infocom, pp. 2435\u20132443 (2011)","DOI":"10.1109\/INFCOM.2011.5935065"},{"key":"24_CR35","doi-asserted-by":"crossref","unstructured":"Pietil\u00e4inen, A., Oliver, E., LeBrun, J., Varghese, G., Diot, C.: Mobiclique: middleware formobile social networking. In: Proceedings of the 2nd ACM Workshop on Online Socialnetworks, pp. 49\u201354. ACM (2009)","DOI":"10.1145\/1592665.1592678"},{"key":"24_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-21599-5_18","volume-title":"Trust and Trustworthy Computing","author":"E. Cristofaro De","year":"2011","unstructured":"De Cristofaro, E., Lu, Y., Tsudik, G.: Efficient techniques for privacy-preserving sharing of sensitive information. In: McCune, J.M., Balacheff, B., Perrig, A., Sadeghi, A.-R., Sasse, A., Beres, Y. (eds.) Trust 2011. LNCS, vol.\u00a06740, pp. 239\u2013253. Springer, Heidelberg (2011)"},{"key":"24_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-01957-9_8","volume-title":"Applied Cryptography and Network Security","author":"D. Dachman-Soled","year":"2009","unstructured":"Dachman-Soled, D., Malkin, T., Raykova, M., Yung, M.: Efficient robust private set intersection. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol.\u00a05536, pp. 125\u2013142. Springer, Heidelberg (2009)"},{"issue":"5","key":"24_CR38","doi-asserted-by":"publisher","first-page":"2024","DOI":"10.1109\/TWC.2013.032513.120149","volume":"12","author":"M. Li","year":"2013","unstructured":"Li, M., Yu, S., Cao, N., Lou, W.: Privacy-Preserving Distributed Profile Matching in Proximity-based Mobile Social Networks. IEEE Transactions on Wireless Communications\u00a012(5), 2024\u20132033 (2013)","journal-title":"IEEE Transactions on Wireless Communications"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14717-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T05:11:18Z","timestamp":1747199478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14717-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319147161","9783319147178"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14717-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}