{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,28]],"date-time":"2025-12-28T02:26:01Z","timestamp":1766888761578,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662447734"},{"type":"electronic","value":"9783662447741"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44774-1_9","type":"book-chapter","created":{"date-parts":[[2014,10,7]],"date-time":"2014-10-07T12:50:47Z","timestamp":1412686247000},"page":"122-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Increasing Anonymity in Bitcoin"],"prefix":"10.1007","author":[{"given":"Amitabh","family":"Saxena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janardan","family":"Misra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aritra","family":"Dhar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,8]]},"reference":[{"key":"9_CR1","unstructured":"Nakamoto, S.: Bitcoin: A Peer-to-Peer Electronic Cash System"},{"key":"9_CR2","unstructured":"Martins, S., Yang, Y.: Introduction to bitcoins: a pseudo-anonymous electronic currency system. In: Proceedings of the 2011 Conference of the Center for Advanced Studies on Collaborative Research, CASCON \u201911, Riverton, NJ, USA, pp. 349\u2013350. IBM Corp. (2011)"},{"key":"9_CR3","unstructured":"Bitcoin Developers. Bitcoin client source code (github) (2008)"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"D Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416\u2013432. Springer, Heidelberg (2003)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-540-40061-5_25","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"J-S Coron","year":"2003","unstructured":"Coron, J.-S., Naccache, D.: Boneh et al.\u2019s k-Element aggregate extraction assumption is equivalent to the diffie-hellman assumption. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 392\u2013397. Springer, Heidelberg (2003)"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-24676-3_5","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"A Lysyanskaya","year":"2004","unstructured":"Lysyanskaya, A., Micali, S., Reyzin, L., Shacham, H.: Sequential aggregate signatures from trapdoor permutations. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 74\u201390. Springer, Heidelberg (2004)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Zhu, H., Bao, F., Li, T., Wu, Y.: Sequential aggregate signatures for wireless routing protocols. In: 2005 IEEE Wireless Communications and Networking Conference, vol. 4, pp. 2436\u20132439 (2005)","DOI":"10.1109\/WCNC.2005.1424896"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Ma, D.: Practical forward secure sequential aggregate signatures. In: Abe, M., Gligor, V.D. (eds.), ASIACCS, pp. 341\u2013352. ACM (2008)","DOI":"10.1145\/1368310.1368361"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Boldyreva, A., Gentry, C., O\u2019Neill, A., Yum, D.H.: Ordered multisignatures and identity-based sequential aggregate signatures, with applications to secure routing. In: CCS \u201907: Proceedings of the 14th ACM Conference on Computer and Communications Security, pp. 276\u2013285. ACM, New York (2007)","DOI":"10.1145\/1315245.1315280"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/11761679_28","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"S Lu","year":"2006","unstructured":"Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., Waters, B.: Sequential aggregate signatures and multisignatures without random oracles. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 465\u2013485. Springer, Heidelberg (2006)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-32928-9_7","volume-title":"Security and Cryptography for Networks","author":"M Fischlin","year":"2012","unstructured":"Fischlin, M., Lehmann, A., Schr\u00f6der, D.: History-free sequential aggregate signatures. In: Visconti, I., De Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 113\u2013130. Springer, Heidelberg (2012)"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/978-3-642-34961-4_39","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"K Brogle","year":"2012","unstructured":"Brogle, K., Goldberg, S., Reyzin, L.: Sequential aggregate signatures with lazy verification from trapdoor permutations. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 644\u2013662. Springer, Heidelberg (2012)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Androulaki, E., Karame, G., Roeschlin, M., Scherer, T., Capkun, S.: Evaluating user privacy in bitcoin. Cryptology ePrint Archive, Report 2012\/596 (2012)","DOI":"10.1007\/978-3-642-39884-1_4"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Reid, F., Harrigan, M.: An analysis of anonymity in the bitcoin system. In: Altshuler, Y., Elovici, Y., Cremers, A.B., Aharony, N., Pentland, A. (eds.) Security and Privacy in Social Networks, pp. 197\u2013223. Springer, New York (2013)","DOI":"10.1007\/978-1-4614-4139-7_10"},{"key":"9_CR15","unstructured":"Ron, D., Shamir, A.: Quantitative analysis of the full bitcoin transaction graph. Cryptology ePrint Archive, Report 2012\/584 (2012). http:\/\/eprint.iacr.org\/"},{"key":"9_CR16","unstructured":"Zerocoin: Anonymous distributed e-cash from bitcoin (2012)"},{"key":"9_CR17","unstructured":"Maxwell, G.: Coinjoin: Bitcoin privacy for the real world (2013)"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger, D.: Where are the hard knapsack problems. Comput. Oper. Res. 32, 2271\u20132284 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"9_CR19","doi-asserted-by":"publisher","first-page":"1402","DOI":"10.1287\/opre.28.6.1402","volume":"28","author":"V Chvatal","year":"1980","unstructured":"Chvatal, V.: Hard knapsack problems. Oper. Res. 28(6), 1402\u20131411 (1980)","journal-title":"Oper. Res."},{"issue":"4","key":"9_CR20","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s00037-007-0234-9","volume":"16","author":"D Micciancio","year":"2007","unstructured":"Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Comput. Complex. 16(4), 365\u2013411 (2007). (Prelim. In: FOCS 2002)","journal-title":"Comput. Complex."},{"issue":"4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00145-004-0315-8","volume":"17","author":"VS Miller","year":"2004","unstructured":"Miller, V.S.: The Weil pairing, and its efficient calculation. J. Cryptology 17(4), 235\u2013261 (2004)","journal-title":"J. Cryptology"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-36334-4_15","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2012","author":"Y Uchida","year":"2013","unstructured":"Uchida, Y., Uchiyama, S.: The tate-lichtenbaum pairing on a hyperelliptic curve via hyperelliptic nets. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 218\u2013233. Springer, Heidelberg (2013)"},{"issue":"10","key":"9_CR23","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F Hess","year":"2006","unstructured":"Hess, F., Smart, N.P., Vercauteren, F.: The Eta pairing revisited. IEEE Trans. Inf. Theor. 52(10), 4595\u20134602 (2006)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-29101-2_16","volume-title":"Information Security Practice and Experience","author":"N Shinohara","year":"2012","unstructured":"Shinohara, N., Shimoyama, T., Hayashi, T., Takagi, T.: Key length estimation of pairing-based cryptosystems using $$\\eta _T$$ pairing. In: Ryan, M.D., Smyth, B., Wang, G. (eds.) ISPEC 2012. LNCS, vol. 7232, pp. 228\u2013244. Springer, Heidelberg (2012)"},{"key":"9_CR25","first-page":"139","volume":"2005","author":"M Scott","year":"2005","unstructured":"Scott, M.: Scaling security in pairing-based protocols. IACR Cryptology ePrint Archive 2005, 139 (2005)","journal-title":"IACR Cryptology ePrint Archive"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44774-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T01:33:25Z","timestamp":1746408805000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44774-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447734","9783662447741"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44774-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"8 October 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}