{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T15:31:46Z","timestamp":1756308706382,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,17]],"date-time":"2011-10-17T00:00:00Z","timestamp":1318809600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,10,17]]},"DOI":"10.1145\/2046556.2046572","type":"proceedings-article","created":{"date-parts":[[2011,10,18]],"date-time":"2011-10-18T13:02:00Z","timestamp":1318942920000},"page":"125-130","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["FAUST"],"prefix":"10.1145","author":[{"given":"Peter","family":"Lofgren","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas","family":"Hopper","sequence":"additional","affiliation":[{"name":"Univeristy of Minnesota, Minneapolis, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,10,17]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-002-0120-1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"S.\n      Brands L.\n      Demuynck and \n      B. D.\n      Decker\n  . \n  A practical system for globally revoking the unlinkable pseudonyms of unknown users\n  . In J. Pieprzyk H. Ghodosi and E. Dawson editors ACISP volume \n  4586\n   of \n  Lecture Notes in Computer Science pages \n  400\n  --\n  415\n  . \n  Springer 2007\n  .   S. Brands L. Demuynck and B. D. Decker. A practical system for globally revoking the unlinkable pseudonyms of unknown users. In J. Pieprzyk H. Ghodosi and E. Dawson editors ACISP volume 4586 of Lecture Notes in Computer Science pages 400--415. Springer 2007.","DOI":"10.1007\/978-3-540-73458-1_29"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1314333.1314337"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/4372.4373"},{"key":"e_1_3_2_1_6_1","unstructured":"U. I. Corp. Ultrasurf: Privacy. security. freedom. http:\/\/www.ultrareach.com\/ July 2011.  U. I. Corp. Ultrasurf: Privacy. security. freedom. http:\/\/www.ultrareach.com\/ July 2011."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251396"},{"key":"e_1_3_2_1_8_1","unstructured":"J. GmbH. JonDoNym: Private and secure web surfing. http:\/\/anonymous-proxy-servers.net\/ September 2010.  J. GmbH. JonDoNym: Private and secure web surfing. http:\/\/anonymous-proxy-servers.net\/ September 2010."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.17"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2011.13"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881151.1881158"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1779330.1779338"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866919.1866927"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27576-0_22"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27576-0_13"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1316624.1316663"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/330382.330384"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"J. T.\n      Trostle\n     and \n      A.\n      Parrish\n  . \n  Efficient computationally private information retrieval from anonymity or trapdoor groups\n  . In M. Burmester G. Tsudik S. S. Magliveras and I. Ilic editors ISC10: Proceedings of the Information Security Conference volume \n  6531\n   of \n  Lecture Notes in Computer Science pages \n  114\n  --\n  128\n  . \n  Springer 2010\n  .   J. T. Trostle and A. Parrish. Efficient computationally private information retrieval from anonymity or trapdoor groups. In M. Burmester G. Tsudik S. S. Magliveras and I. Ilic editors ISC10: Proceedings of the Information Security Conference volume 6531 of Lecture Notes in Computer Science pages 114--128. Springer 2010.","DOI":"10.1007\/978-3-642-18178-8_10"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315256"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455813"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1880022.1880033"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2009.38"}],"event":{"name":"CCS'11: the ACM Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Chicago Illinois USA","acronym":"CCS'11"},"container-title":["Proceedings of the 10th annual ACM workshop on Privacy in the electronic society"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2046556.2046572","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2046556.2046572","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:19Z","timestamp":1750240099000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2046556.2046572"}},"subtitle":["efficient, TTP-free abuse prevention by anonymous whitelisting"],"short-title":[],"issued":{"date-parts":[[2011,10,17]]},"references-count":21,"alternative-id":["10.1145\/2046556.2046572","10.1145\/2046556"],"URL":"https:\/\/doi.org\/10.1145\/2046556.2046572","relation":{},"subject":[],"published":{"date-parts":[[2011,10,17]]},"assertion":[{"value":"2011-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}