{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:27:52Z","timestamp":1750307272090,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T00:00:00Z","timestamp":1286150400000},"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":[[2010,10,4]]},"DOI":"10.1145\/1866919.1866927","type":"proceedings-article","created":{"date-parts":[[2010,10,12]],"date-time":"2010-10-12T15:38:31Z","timestamp":1286897911000},"page":"53-62","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Jack"],"prefix":"10.1145","author":[{"given":"Zi","family":"Lin","sequence":"first","affiliation":[{"name":"University of Minnesota, Minneapolis, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicholas","family":"Hopper","sequence":"additional","affiliation":[{"name":"University of Minnesota, Minneapolis, MN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,10,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"}}The Tor Project. https:\/\/www.torproject.org\/.  }}The Tor Project. https:\/\/www.torproject.org\/."},{"key":"e_1_3_2_1_2_1","unstructured":"}}Wikipedia: Blocking policy. http:\/\/en.wikipedia.org\/wiki\/Wikipedia:Blocking_policy.  }}Wikipedia: Blocking policy. http:\/\/en.wikipedia.org\/wiki\/Wikipedia:Blocking_policy."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/646765.759593"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00862-7_20"},{"key":"e_1_3_2_1_5_1","volume-title":"Dartmouth Computer Science TR2009-643","author":"Au M. H.","year":"2009","unstructured":"}} M. H. Au , P. P. Tsang , W. Susilo , and Y. Mu . Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems. Technical report , Dartmouth Computer Science TR2009-643 , 2009 . }}M. H. Au, P. P. Tsang, W. Susilo, and Y. Mu. Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems. Technical report, Dartmouth Computer Science TR2009-643, 2009."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"e_1_3_2_1_7_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology - CRYPTO '04","author":"Boneh D.","year":"2004","unstructured":"}} D. Boneh , X. Boyen , and H. Shacham . Short group signatures . In Advances in Cryptology - CRYPTO '04 , volume 3152 of Lecture Notes in Computer Science , pages 41 -- 55 . Springer Berlin \/ Heidelberg , 2004 . }}D. Boneh, X. Boyen, and H. Shacham. Short group signatures. In Advances in Cryptology - CRYPTO '04, volume 3152 of Lecture Notes in Computer Science, pages 41--55. Springer Berlin \/ Heidelberg, 2004."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030106"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1314333.1314337"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1180405.1180431"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646767.704437"},{"key":"e_1_3_2_1_12_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Proceedings on Advances in Cryptology - CRYPTO '03","author":"Camenisch J.","year":"2003","unstructured":"}} J. Camenisch and V. Shoup . Practical verifiable encryption and decryption of discrete logarithms . In Proceedings on Advances in Cryptology - CRYPTO '03 , volume 2729 of Lecture Notes in Computer Science , pages 126 -- 144 . Springer Berlin \/ Heidelberg , 2003 . }}J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. In Proceedings on Advances in Cryptology - CRYPTO '03, volume 2729 of Lecture Notes in Computer Science, pages 126--144. Springer Berlin \/ Heidelberg, 2003."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646762.706305"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_22"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251396"},{"key":"e_1_3_2_1_17_1","first-page":"186","volume-title":"Proceedings on Advances in cryptology - CRYPTO '86","author":"Fiat A.","year":"1987","unstructured":"}} A. Fiat and A. Shamir . How to prove yourself: practical solutions to identification and signature problems . In Proceedings on Advances in cryptology - CRYPTO '86 , pages 186 -- 194 , London, UK , 1987 . Springer-Verlag. }}A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Proceedings on Advances in cryptology - CRYPTO '86, pages 186--194, London, UK, 1987. Springer-Verlag."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217017"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/1779330.1779338"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72738-5_17"},{"key":"e_1_3_2_1_23_1","unstructured":"}}A. Miyaji M. Nakabayashi and S. Takano. New explicit conditions of elliptic curve traces for fr-reduction (special section on discrete mathematics and its applications). IEICE transactions on fundamentals of electronics communications and computer sciences 84(5):1234--1243 20010501.  }}A. Miyaji M. Nakabayashi and S. Takano. New explicit conditions of elliptic curve traces for fr-reduction (special section on discrete mathematics and its applications). IEICE transactions on fundamentals of electronics communications and computer sciences 84(5):1234--1243 20010501."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings of the 17th Annual Network and Distributed System Security Symposium","author":"Schwartz E. J.","year":"2010","unstructured":"}} E. J. Schwartz , D. Brumley , and J. M. McCune . Contractual anonymity . In Proceedings of the 17th Annual Network and Distributed System Security Symposium , San Diego, CA , February 2010 . }}E. J. Schwartz, D. Brumley, and J. M. McCune. Contractual anonymity. In Proceedings of the 17th Annual Network and Distributed System Security Symposium, San Diego, CA, February 2010."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30539-2_22"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315256"},{"key":"e_1_3_2_1_28_1","volume-title":"Dartmouth Computer Science TR2008-635","author":"Tsang P. P.","year":"2008","unstructured":"}} P. P. Tsang , M. H. Au , A. Kapadia , and S. W. Smith . BLAC: Revoking Repeatedly Misbehaving Anonymous Users Without Relying on TTPs. Technical report , Dartmouth Computer Science TR2008-635 , 2008 . }}P. P. Tsang, M. H. Au, A. Kapadia, and S. W. Smith. BLAC: Revoking Repeatedly Misbehaving Anonymous Users Without Relying on TTPs. Technical report, Dartmouth Computer Science TR2008-635, 2008."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455813"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2009.38"},{"key":"e_1_3_2_1_31_1","volume-title":"Dartmouth Computer Science TR2008-637","author":"Tsang P. P.","year":"2008","unstructured":"}} P. P. Tsang , A. Kapadia , C. Cornelius , and S. W. Smith . Nymble: Blocking misbehaving users in anonymizing networks. Technical report , Dartmouth Computer Science TR2008-637 , 2008 . }}P. P. Tsang, A. Kapadia, C. Cornelius, and S. W. Smith. Nymble: Blocking misbehaving users in anonymizing networks. Technical report, Dartmouth Computer Science TR2008-637, 2008."}],"event":{"name":"CCS '10: 17th ACM Conference on Computer and Communications Security 2010","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Chicago Illinois USA","acronym":"CCS '10"},"container-title":["Proceedings of the 9th annual ACM workshop on Privacy in the electronic society"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866919.1866927","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1866919.1866927","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:53:00Z","timestamp":1750243980000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1866919.1866927"}},"subtitle":["scalable accumulator-based nymble system"],"short-title":[],"issued":{"date-parts":[[2010,10,4]]},"references-count":29,"alternative-id":["10.1145\/1866919.1866927","10.1145\/1866919"],"URL":"https:\/\/doi.org\/10.1145\/1866919.1866927","relation":{},"subject":[],"published":{"date-parts":[[2010,10,4]]},"assertion":[{"value":"2010-10-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}