{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:01:56Z","timestamp":1762506116025},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Select. Areas Commun."],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1109\/jsac.2013.sup.0513056","type":"journal-article","created":{"date-parts":[[2013,6,20]],"date-time":"2013-06-20T18:02:40Z","timestamp":1371751360000},"page":"641-655","source":"Crossref","is-referenced-by-count":47,"title":["Fully Anonymous Profile Matching in Mobile Social Networks"],"prefix":"10.1109","volume":"31","author":[{"family":"Xiaohui Liang","sequence":"first","affiliation":[]},{"family":"Xu Li","sequence":"additional","affiliation":[]},{"family":"Kuan Zhang","sequence":"additional","affiliation":[]},{"family":"Rongxing Lu","sequence":"additional","affiliation":[]},{"family":"Xiaodong Lin","sequence":"additional","affiliation":[]},{"family":"Xuemin Shen","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2002.1040894"},{"key":"ref38","first-page":"218","article-title":"How to play any mental game or a completeness theorem for protocols with honest majority","author":"goldreich","year":"1987","journal-title":"STOC"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01957-9_8"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79104-1_25"},{"key":"ref31","first-page":"241","article-title":"Privacy-preserving set operations","author":"kissner","year":"2005","journal-title":"Crypto"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.56"},{"key":"ref37","first-page":"160","article-title":"Protocols for secure computations (extended abstract)","author":"yao","year":"1982","journal-title":"FOCS"},{"key":"ref36","first-page":"104","article-title":"On private scalar product computation for privacy-preserving data mining","author":"goethals","year":"2004","journal-title":"ICISC"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9034-x"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.48"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2005.37"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2248371.2248376"},{"key":"ref2","first-page":"409","article-title":"Exploiting social interactions in mobile systems","author":"miklas","year":"2007","journal-title":"Ubicomp"},{"key":"ref1","article-title":"Comscore","year":"0"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s11036-010-0274-2"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195574"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935065"},{"key":"ref24","first-page":"324","article-title":"On noncooperative location privacy: a game-theoretic analysis","author":"freudiger","year":"2009","journal-title":"ACM CCS"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934958"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_9"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1109\/TVT.2011.2162864","article-title":"Pseudonym changing at social spots: An effective strategy for location privacy in vanets","volume":"61","author":"lu","year":"2011","journal-title":"IEEE Trans Veh Technol"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.56"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462138"},{"key":"ref40","first-page":"515","article-title":"Strong conditional oblivious transfer and computing on intervals","author":"blake","year":"2004","journal-title":"ASIACRYPT"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2012.2202932"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1102199.1102214"},{"key":"ref14","first-page":"10","article-title":"An evaluation of identity-sharing behavior in social network communities","volume":"3","author":"stutzman","year":"2006","journal-title":"iDMAa Journal"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658958"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526781"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/EUC.2008.156"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2003.1199336"},{"key":"ref19","first-page":"1","article-title":"Efficient private matching and set intersection","author":"freedman","year":"2004","journal-title":"Eurocrypt"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462161"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062058"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2011.2116816"},{"key":"ref5","first-page":"141","article-title":"Message propagation in adhoc-based proximity mobile social networks","author":"he","year":"2010","journal-title":"PerCom Workshops"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1738826.1738868"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1145\/1080829.1080855","article-title":"Peoplenet: engineering a wireless virtual social network","author":"motani","year":"2005","journal-title":"Mobicom"},{"key":"ref49","article-title":"Small worlds: The dynamics of networks between order and randomness","volume":"6","author":"watts","year":"2003","journal-title":"J Artificial Societies and Social Simulation"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.83"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195777"},{"key":"ref48","article-title":"CRAWDAD trace cambridgelhaggle\/imote\/infocom (v. 2006–01–31)","author":"scott","year":"2006"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046682"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27752-1"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"1621","DOI":"10.1109\/TPDS.2012.86","article-title":"Eppa: An efficient and privacy-preserving aggregation scheme for secure smart grid communications","volume":"23","author":"lu","year":"2012","journal-title":"IEEE Trans Parallel Distrib Syst"}],"container-title":["IEEE Journal on Selected Areas in Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/49\/6585873\/06544544.pdf?arnumber=6544544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,2]],"date-time":"2023-07-02T13:55:35Z","timestamp":1688306135000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6544544\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":50,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/jsac.2013.sup.0513056","relation":{},"ISSN":["0733-8716"],"issn-type":[{"value":"0733-8716","type":"print"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}