{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:19:19Z","timestamp":1756253959369,"version":"3.44.0"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1109\/glocom.2012.6503197","type":"proceedings-article","created":{"date-parts":[[2013,4,26]],"date-time":"2013-04-26T19:29:23Z","timestamp":1367004563000},"page":"714-719","source":"Crossref","is-referenced-by-count":0,"title":["Searching in the dark: A framework for authenticating unknown users in online social networks"],"prefix":"10.1109","author":[{"family":"Lingjun Li","sequence":"first","affiliation":[{"name":"Arizona State University, Tempe, 85287, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Xinxin Zhao","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, 85287, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Guoliang Xue","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, 85287, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335325"},{"journal-title":"The Pairing-Based Cryptography (PBC) library","year":"0","author":"lynn","key":"14"},{"key":"11","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/978-3-642-01001-9_25","article-title":"On the portability of generalized schnorr proofs","author":"camenisch","year":"2009","journal-title":"Advances in Cryptology-EUROCRYPT 2009"},{"key":"12","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/BFb0052252","article-title":"Efficient group signature schemes for large groups","author":"camenisch","year":"1997","journal-title":"Advances in Cryptology-CRYPTO'97"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007367"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526784"},{"key":"10","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/978-3-642-01001-9_19","article-title":"Realizing hash-and-sign signatures under standard assumptions","author":"hohenberger","year":"2009","journal-title":"Advances in Cryptology-EUROCRYPT 2009"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592585"},{"journal-title":"The On-line Shortest Path Problem under Partial Monitoring","year":"2007","author":"gyo?rgy","key":"6"},{"key":"5","first-page":"335","article-title":"High-probability regret bounds for bandit online linear optimization","author":"bartlett","year":"2008","journal-title":"Proceedings of the 21st Annual Conference on Learning Theory (COLT 2008)"},{"key":"4","article-title":"Competing in the dark: An efficient algorithm for bandit linear optimization","volume":"3","author":"abernethy","year":"2008","journal-title":"Proceedings of the 21st Annual Conference on Learning Theory (COLT)"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.016"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1145\/1397735.1397746"}],"event":{"name":"GLOBECOM 2012 - 2012 IEEE Global Communications Conference","start":{"date-parts":[[2012,12,3]]},"location":"Anaheim, CA, USA","end":{"date-parts":[[2012,12,7]]}},"container-title":["2012 IEEE Global Communications Conference (GLOBECOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6490098\/6503052\/06503197.pdf?arnumber=6503197","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T19:06:24Z","timestamp":1756235184000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6503197\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/glocom.2012.6503197","relation":{},"subject":[],"published":{"date-parts":[[2012,12]]}}}