{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:33:39Z","timestamp":1758267219721},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1109\/glocom.2013.6831559","type":"proceedings-article","created":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T02:05:38Z","timestamp":1403316338000},"page":"3170-3175","source":"Crossref","is-referenced-by-count":7,"title":["Weight-aware private matching scheme for Proximity-based Mobile Social Networks"],"prefix":"10.1109","author":[{"family":"Ben Niu","sequence":"first","affiliation":[]},{"family":"Xiaoyan Zhu","sequence":"additional","affiliation":[]},{"family":"Jie Liu","sequence":"additional","affiliation":[]},{"family":"Zan Li","sequence":"additional","affiliation":[]},{"family":"Hui Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","article-title":"Privacy-preserving matchmaking for mobile social networking secure against malicious users","author":"xie","year":"2011","journal-title":"IEEE PST"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/1247660.1247681"},{"key":"15","article-title":"Fine-grained private matching for proximity-based mobile social networking","author":"zhang","year":"2012","journal-title":"IEEE INFOCOM"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872771"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2010.56"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.SUP.0513056"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935065"},{"key":"12","article-title":"Linear-complexity private set intersection protocols secure in malicious model","author":"cristofaro","year":"2010","journal-title":"ASIACRYPT"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653692"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1247660.1247688"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2005.37"},{"key":"10","article-title":"(if) size matters: Sizehiding private set intersection","author":"ateniese","year":"2011","journal-title":"ACM PKC"},{"key":"7","article-title":"Efficient private matching and set intersection","author":"freedman","year":"2004","journal-title":"Eurocrypt"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934958"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ICME.2010.5583030"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592678"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1609956.1609965"},{"key":"8","article-title":"Privacy-preserving set operations","author":"kissner","year":"2005","journal-title":"Crypto"}],"event":{"name":"2013 IEEE Global Communications Conference (GLOBECOM 2013)","start":{"date-parts":[[2013,12,9]]},"location":"Atlanta, GA","end":{"date-parts":[[2013,12,13]]}},"container-title":["2013 IEEE Global Communications Conference (GLOBECOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6821297\/6831034\/06831559.pdf?arnumber=6831559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T17:30:13Z","timestamp":1490290213000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6831559\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/glocom.2013.6831559","relation":{},"subject":[],"published":{"date-parts":[[2013,12]]}}}