{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:05Z","timestamp":1772283545604,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642145261","type":"print"},{"value":"9783642145278","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14527-8_7","type":"book-chapter","created":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T09:31:56Z","timestamp":1278495116000},"page":"111-129","source":"Crossref","is-referenced-by-count":15,"title":["Making a Nymbler Nymble Using VERBS"],"prefix":"10.1007","author":[{"given":"Ryan","family":"Henry","sequence":"first","affiliation":[]},{"given":"Kevin","family":"Henry","sequence":"additional","affiliation":[]},{"given":"Ian","family":"Goldberg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-45708-9_27","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Algesheimer","year":"2002","unstructured":"Algesheimer, J., Camenisch, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 417\u2013432. Springer, Heidelberg (2002)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-540-78524-8_20","volume-title":"Theory of Cryptography","author":"M. Belenkiy","year":"2008","unstructured":"Belenkiy, M., Chase, M., Kohlweiss, M., Lysyanskaya, A.: P-signatures and noninteractive anonymous credentials. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 356\u2013374. Springer, Heidelberg (2008)"},{"key":"7_CR3","unstructured":"Bichsel, P., Binding, C., Camenisch, J., Gro\u00df, T., Heydt-Benjamin, T., Sommer, D., Zaverucha, G.: Cryptographic protocols of the Identity Mixer Library, v. 1.0. Computer Science Research Report RZ3730, IBM Research GmbH, Zurich (2009)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-45539-6_31","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"F. Boudot","year":"2000","unstructured":"Boudot, F.: Efficient proofs that a committed number lies in an interval. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 431\u2013444. Springer, Heidelberg (2000)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/3-540-48329-2_26","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"S.A. Brands","year":"1994","unstructured":"Brands, S.A.: Untraceable off-line cash in wallets with observers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 302\u2013318. Springer, Heidelberg (1994)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Brent, R.P.: Parallel Algorithms for Integer Factorisation. Number Theory and Cryptography, 26\u201337 (1990)","DOI":"10.1017\/CBO9781107325838.004"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 93\u2013118. Springer, Heidelberg (2001)"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Michels, M.: Proving in zero-knowledge that a number is the product of two safe primes (1998)","DOI":"10.7146\/brics.v5i29.19435"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: CRYPTO 1982, pp. 199\u2013203 (1982)","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Blind signature system. In: CRYPTO 1983, p. 153 (1983)","DOI":"10.1007\/978-1-4684-4730-9_14"},{"key":"7_CR11","unstructured":"Dingledine, R.: Tor development roadmap, 2008\u20132011. Roadmap, The Tor Project (2008)"},{"issue":"5","key":"7_CR12","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/MSP.2007.108","volume":"5","author":"R. Dingledine","year":"2007","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Deploying low-latency anonymity: Design challenges and social factors. IEEE Security and Privacy\u00a05(5), 83\u201387 (2007)","journal-title":"IEEE Security and Privacy"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.F.: Tor: The second-generation onion router. In: USENIX Security Symposium, pp. 303\u2013320. USENIX (2004)","DOI":"10.21236\/ADA465464"},{"key":"7_CR14","unstructured":"Dingledine, R.: Re: Banned from Slashdot, arma@freehaven.net, http:\/\/archives.seul.org\/or\/talk\/Jun-2005\/msg00002.html (Private e-mail message to Jamie McCarthy;June 1, 2005)"},{"key":"7_CR15","first-page":"427","volume-title":"FOCS","author":"P. Feldman","year":"1987","unstructured":"Feldman, P.: A practical scheme for non-interactive verifiable secret sharing. In: FOCS, pp. 427\u2013437. IEEE, Los Alamitos (1987)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-78967-3_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J. Groth","year":"2008","unstructured":"Groth, J., Sahai, A.: Efficient non-interactive proof systems for bilinear groups. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 415\u2013432. Springer, Heidelberg (2008)"},{"key":"7_CR18","unstructured":"Henry, R., Henry, K., Goldberg, I.: Making a Nymbler Nymble using VERBS. Tech. Rep. CACR 2010-05, Centre for Applied Cryptographic Research, Waterloo (2010), http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2010\/cacr2010-05.pdf"},{"key":"7_CR19","unstructured":"Holt, J.E., Seamons, K.E.: Nym: Practical pseudonymity for anonymous networks. Internet Security Research Lab., Technical Report 2006-4, Brigham Young University, Provo, UT (2006)"},{"key":"7_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-540-75551-7_8","volume-title":"Privacy Enhancing Technologies","author":"P.C. Johnson","year":"2007","unstructured":"Johnson, P.C., Kapadia, A., Tsang, P.P., Smith, S.W.: Nymble: Anonymous IP-address blocking. In: Borisov, N., Golle, P. (eds.) PET 2007. LNCS, vol.\u00a04776, pp. 113\u2013133. Springer, Heidelberg (2007)"},{"issue":"3","key":"7_CR21","first-page":"305","volume":"9","author":"U.M. Maurer","year":"1996","unstructured":"Maurer, U.M., Yacobi, Y.: A non-interactive public-key distribution system. Designs, Codes and Cryptography\u00a09(3), 305\u2013316 (1996)","journal-title":"Designs, Codes and Cryptography"},{"key":"7_CR22","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1996","unstructured":"Menezes, A., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel collision search with application to hash functions and discrete logarithms. In: ACM CCS, pp. 210\u2013218 (1994)","DOI":"10.1145\/191177.191231"},{"key":"7_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"T.P. Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"issue":"03","key":"7_CR25","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1017\/S0305004100049252","volume":"76","author":"J.M. Pollard","year":"1974","unstructured":"Pollard, J.M.: Theorems on factorization and primality testing. Proceedings of the Cambridge Philosophical Society\u00a076(03), 521 (1974)","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"7_CR26","unstructured":"RSA Laboratories: RSA Laboratories - the RSA factoring challenge FAQ, http:\/\/www.rsa.com\/rsalabs\/node.asp?id=2094 ( accessed 11-January-2010)"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C.P. Schnorr","year":"1990","unstructured":"Schnorr, C.P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 239\u2013252. Springer, Heidelberg (1990)"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-63594-7_66","volume-title":"Financial Cryptography","author":"P.F. Syverson","year":"1997","unstructured":"Syverson, P.F., Stubblebine, S.G., Goldschlag, D.M.: Unlinkable serial transactions. In: Hirschfeld, R. (ed.) FC 1997. LNCS, vol.\u00a01318, pp. 39\u201356. Springer, Heidelberg (1997)"},{"key":"7_CR29","unstructured":"The Tor Project, Inc.: Tor: Overview (accessed October 21, 2009), https:\/\/www.torproject.org\/overview.html.en"},{"key":"7_CR30","first-page":"72","volume-title":"ACM CCS","author":"P.P. Tsang","year":"2007","unstructured":"Tsang, P.P., Au, M.H., Kapadia, A., Smith, S.W.: Blacklistable Anonymous Credentials: Blocking misbehaving users without TTPs. In: Ning, P., di Vimercati, S.D.C., Syverson, P.F. (eds.) ACM CCS, pp. 72\u201381. ACM, New York (2007)"},{"key":"7_CR31","first-page":"333","volume-title":"ACM CCS","author":"P.P. Tsang","year":"2008","unstructured":"Tsang, P.P., Au, M.H., Kapadia, A., Smith, S.W.: PEREA: Towards practical TTP-free revocation in anonymous authentication. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM CCS, pp. 333\u2013344. ACM, New York (2008)"},{"key":"7_CR32","unstructured":"Tsang, P.P., Kapadia, A., Cornelius, C., Smith, S.W.: Nymble: Blocking misbehaving users in anonymizing networks. In: IEEE TDSC (2009) (to appear)"},{"key":"7_CR33","unstructured":"Wikipedia: Wikipedia talk:blocking policy\/tor nodes \u2014 Wikipedia, the free encyclopedia, http:\/\/en.wikipedia.org\/wiki\/Wikipedia_talk:Blocking_policy\/Tor_nodes (accessed October 18, 2009)"}],"container-title":["Lecture Notes in Computer Science","Privacy Enhancing Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14527-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T21:13:31Z","timestamp":1559250811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14527-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642145261","9783642145278"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14527-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}