{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T08:30:01Z","timestamp":1773736201086,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T00:00:00Z","timestamp":1486425600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100007128","name":"Natural Science Foundation of Shaanxi Province","doi-asserted-by":"publisher","award":["2014Jm8300"],"award-info":[{"award-number":["2014Jm8300"]}],"id":[{"id":"10.13039\/501100007128","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61272492"],"award-info":[{"award-number":["61272492"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572521"],"award-info":[{"award-number":["61572521"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s00500-017-2506-x","type":"journal-article","created":{"date-parts":[[2017,2,7]],"date-time":"2017-02-07T09:22:11Z","timestamp":1486459331000},"page":"2517-2526","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A privacy-preserving fuzzy interest matching protocol for friends finding in social networks"],"prefix":"10.1007","volume":"22","author":[{"given":"Xu An","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fatos","family":"Xhafa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoshuang","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuaiwei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,7]]},"reference":[{"issue":"7","key":"2506_CR1","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"B Bloom","year":"1970","unstructured":"Bloom B (1970) Space\/time trade-offs in hash coding with allowable errors. Commun ACM 13(7):422\u2013426","journal-title":"Commun ACM"},{"issue":"4","key":"2506_CR2","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.ipl.2008.05.018","volume":"108","author":"P Bose","year":"2008","unstructured":"Bose P, Guo H, Kranakis E, Maheshwari A, Morin P, Morrison J, Smid MHM, Tang Y (2008) On the false-positive rate of bloom filters. Inf Process Lett 108(4):210\u2013213","journal-title":"Inf Process Lett"},{"key":"2506_CR3","doi-asserted-by":"crossref","unstructured":"Camenisch J, Zaverucha GM (2009) Private intersection of certified sets. In: Dingledine R, Golle P (eds) FC 2009. LNCS, vol 5628. Springer, Berlin, pp 108\u2013127","DOI":"10.1007\/978-3-642-03549-4_7"},{"key":"2506_CR4","doi-asserted-by":"crossref","unstructured":"Cheielewski L, Hoepman J (2008) Fuzzy private matching (extended abstract). In: Third international conference on IEEE availability, reliability and security","DOI":"10.1109\/ARES.2008.170"},{"issue":"1","key":"2506_CR5","first-page":"36","volume":"15","author":"C Chen","year":"2013","unstructured":"Chen C, Pai P, Hung W (2013) A new decision making process for selecting project leader based on social network and knowledge map. Int J Fuzzy Syst 15(1):36\u201346","journal-title":"Int J Fuzzy Syst"},{"issue":"2","key":"2506_CR6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1504\/IJSSC.2014.062468","volume":"4","author":"D Cristina","year":"2014","unstructured":"Cristina D, Elena A, Catalin L, Valentin C (2014) A solution for the management of multimedia sessions in hybrid clouds. Int J Space-Based Situated Comput 4(2):77\u201387","journal-title":"Int J Space-Based Situated Comput"},{"key":"2506_CR7","doi-asserted-by":"crossref","unstructured":"Dachman-Soled D, Malkin T, Raykova M, Yung M (2009) Efficient robust private set intersection. In: Abdalla M, Pointcheval D, Fouque PA, Vergnaud D (eds) ACNS 09. LNCS, vol 5536. Springer, Berlin, pp 125\u2013142","DOI":"10.1007\/978-3-642-01957-9_8"},{"key":"2506_CR8","unstructured":"Dai W (2009) Crypto++ library: 5.6.0 benchmarks. http:\/\/www.cryptopp.com"},{"key":"2506_CR9","doi-asserted-by":"crossref","unstructured":"De Cristofaro E, Kim J, Tsudik G (2010) Linear-complexity private set intersection protocols secure in malicious model. In: Abe M (ed) ASIACRYPT\u00a02010. LNCS, vol 6477. Springer, Berlin, pp 213\u2013231 (2010)","DOI":"10.1007\/978-3-642-17373-8_13"},{"key":"2506_CR10","doi-asserted-by":"crossref","unstructured":"De Cristofaro E, Tsudik G (2010) Practical private set intersection protocols with linear complexity. In: Sion R (ed) FC 2010. LNCS, vol 6052. Springer, Berlin, pp 143\u2013159","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"2506_CR11","doi-asserted-by":"crossref","unstructured":"Debnath SK, Dutta R (2015) Secure and efficient private set intersection cardinality using bloom filter. In: ISC\u00a02015. LNCS, Springer, Berlin, pp 209\u2013226","DOI":"10.1007\/978-3-319-23318-5_12"},{"key":"2506_CR12","doi-asserted-by":"crossref","unstructured":"Dong C, Chen L, Wen Z (2013) When private set intersection meets big data: an efficient and scalable protocol. In: Sadeghi AR, Gligor VD, Yung M (eds) ACM CCS 13. ACM Press, pp 789\u2013800","DOI":"10.1145\/2508859.2516701"},{"key":"2506_CR13","doi-asserted-by":"crossref","unstructured":"Freedman MJ, Nissim K, Pinkas B (2004) Efficient private matching and set intersection. In: Cachin C, Camenisch J (eds) EUROCRYPT\u00a02004. LNCS, vol 3027. Springer, Berlin, pp 1\u201319","DOI":"10.1007\/978-3-540-24676-3_1"},{"key":"2506_CR14","doi-asserted-by":"publisher","unstructured":"Fu Z, Ren K, Shu J, Sun X, Huang F (2015) Enabling personalized search over encrypted outsourced data with efficiency improvement. IEEE Trans Parallel Distrib Syst. doi: 10.1109\/TPDS.2015.2506573","DOI":"10.1109\/TPDS.2015.2506573"},{"key":"2506_CR15","doi-asserted-by":"publisher","unstructured":"Fu Z, Wu X, Guan C, Sun X, Ren K (2016) Towards efficient multi-keyword fuzzy search over encrypted outsourced data with accuracy improvement. IEEE Trans Inf Forensics Secur. doi: 10.1109\/TIFS.2016.2596138","DOI":"10.1109\/TIFS.2016.2596138"},{"issue":"2","key":"2506_CR16","first-page":"1","volume":"6","author":"S Guo","year":"2015","unstructured":"Guo S, Xu H (2015) A secure delegation scheme of large polynomial computation in multi-party cloud. Int J Grid Util Comput 6(2):1\u20137","journal-title":"Int J Grid Util Comput"},{"key":"2506_CR17","doi-asserted-by":"crossref","unstructured":"Hazay C, Lindell Y (2008) Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti R (ed) TCC\u00a02008. LNCS, vol 4948. Springer, Berlin, pp 155\u2013175","DOI":"10.1007\/978-3-540-78524-8_10"},{"key":"2506_CR18","doi-asserted-by":"crossref","unstructured":"Hazay C, Nissim K (2010) Efficient set operations in the presence of malicious adversaries. In: Nguyen PQ, Pointcheval D (eds) PKC\u00a02010. LNCS, vol 6056. Springer, Berlin, pp 312\u2013331","DOI":"10.1007\/978-3-642-13013-7_19"},{"key":"2506_CR19","unstructured":"Hu J, Hu Y, Bein H (2011) Constructing a corporate social responsibility fund using fuzzy multiple criteria decision making. Int J Fuzzy Syst 13(3):195\u2013205"},{"key":"2506_CR20","doi-asserted-by":"crossref","unstructured":"Jarecki S, Liu X (2009) Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection. In: Reingold O (ed) TCC\u00a02009. LNCS, vol 5444. Springer, Berlin, pp 577\u2013594","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"2506_CR21","doi-asserted-by":"crossref","unstructured":"Jarecki S, Liu X (2010) Fast secure computation of set intersection. In: Garay JA, Prisco RD (eds) SCN 10. LNCS, vol 6280. Springer, Berlin, pp 418\u2013435","DOI":"10.1007\/978-3-642-15317-4_26"},{"key":"2506_CR22","doi-asserted-by":"crossref","unstructured":"Kerschbaum F (2012) Outsourced private set intersection using homomorphic encryption. In: Youm HY, Won Y (eds) ASIACCS 12. ACM Press, pp 85\u201386","DOI":"10.1145\/2414456.2414506"},{"key":"2506_CR23","doi-asserted-by":"crossref","unstructured":"Kissner L, Song DX (2005) Privacy-preserving set operations. In: Shoup V (ed) CRYPTO\u00a02005. LNCS, vol 3621. Springer, Berlin, pp 241\u2013257","DOI":"10.21236\/ADA457144"},{"issue":"11","key":"2506_CR24","doi-asserted-by":"crossref","first-page":"2513","DOI":"10.1109\/TIFS.2016.2585121","volume":"11","author":"X Liu","year":"2016","unstructured":"Liu X, Deng R, Ding W, Lu R, Qin B (2016) Privacy-preserving outsourced calculation of floating point numbers. IEEE Trans Inf Forensics Secur 11(11):2513\u20132527","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"2506_CR25","unstructured":"Many D, Burkhart M, Dimitropoulos X (2012) Fast private set operations with sepia. Technical Report 345"},{"issue":"2","key":"2506_CR26","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1504\/IJSSC.2014.062469","volume":"4","author":"T Meriem","year":"2014","unstructured":"Meriem T, Mahmoud B, Fabrice K (2014) An approach for developing an interoperability mechanism between cloud providers. Int J Space-Based Situated Comput 4(2):88\u201399","journal-title":"Int J Space-Based Situated Comput"},{"key":"2506_CR27","unstructured":"Oded G (2009) The foundations of cryptography-vol 2, basic applications. Cambridge University Press, Cambridge"},{"key":"2506_CR28","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: Stern J (ed) EUROCRYPT\u201999. LNCS, vol 1592. Springer, Berlin, pp 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"2506_CR29","doi-asserted-by":"crossref","unstructured":"Ren W, Huang S, Ren Y, Choo KR (2016a) LiPISC: a lightweight and flexible method for privacy-aware intersection set computation. PLOS One. http:\/\/journals.plos.org\/plosone\/article?id=10.1371\/journal.pone.0157752","DOI":"10.1371\/journal.pone.0157752"},{"key":"2506_CR30","doi-asserted-by":"publisher","unstructured":"Ren W, Liu R, Lei M, Choo KR (2016b) SeGoAC: a tree-based model for self-defined and group-oriented access control in mobile cloud computing. Comput Stand Interfaces. doi: 10.1016\/j.csi.2016.09.001","DOI":"10.1016\/j.csi.2016.09.001"},{"issue":"1","key":"2506_CR31","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1504\/IJGUC.2016.073773","volume":"7","author":"Y Wang","year":"2016","unstructured":"Wang Y, Du J, Cheng X, Liu Z, Lin K (2016) Degradation and encryption for outsourced png images in cloud storage. Int J Grid Util Comput 7(1):22\u201328","journal-title":"Int J Grid Util Comput"},{"issue":"2","key":"2506_CR32","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1109\/TPDS.2015.2401003","volume":"27","author":"Z Xia","year":"2015","unstructured":"Xia Z, Wang X, Sun X, Wang Q (2015) A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE Trans Parallel Distrib Syst 27(2):340\u2013352","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"2506_CR33","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1504\/IJGUC.2015.068824","volume":"6","author":"S Zhu","year":"2015","unstructured":"Zhu S, Yang X (2015) Protecting data in cloud environment with attribute-based encryption. Int J Grid Util Comput 6(2):91\u201397","journal-title":"Int J Grid Util Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2506-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2506-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2506-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T06:46:51Z","timestamp":1568789211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2506-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,7]]},"references-count":33,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["2506"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2506-x","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,7]]}}}