{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:09:02Z","timestamp":1767650942079},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319788128"},{"type":"electronic","value":"9783319788135"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-78813-5_6","type":"book-chapter","created":{"date-parts":[[2018,4,10]],"date-time":"2018-04-10T10:03:21Z","timestamp":1523354601000},"page":"108-127","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Twisting Lattice and Graph Techniques to Compress Transactional Ledgers"],"prefix":"10.1007","author":[{"given":"R\u00e9mi","family":"G\u00e9raud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u0103zvan","family":"Ro\u015fie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,11]]},"reference":[{"key":"6_CR1","unstructured":"Bitcoin\u2019s blockchain size (2016). \nhttps:\/\/blockchain.info\/charts\/blocks-size"},{"key":"6_CR2","unstructured":"Ball, M., Rosen, A., Sabin, M., Vasudevan, P.N.: Proofs of useful work (2017)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-20465-4_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"A Becker","year":"2011","unstructured":"Becker, A., Coron, J.-S., Joux, A.: Improved generic algorithms for hard knapsacks. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 364\u2013385. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-20465-4_21"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM (1993)","DOI":"10.1145\/168588.168596"},{"key":"6_CR5","unstructured":"Bruce, J.D.: Purely P2P crypto-currency with finite mini-blockchain (2013). \nhttps:\/\/pdfs.semanticscholar.org\/3f64\/123ce97a0079f8bea66d3f760dbb3e6b40d5.pdf"},{"key":"6_CR6","unstructured":"Bruce, J.D.: The mini-blockchain scheme (2014). \nhttp:\/\/cryptonite.info\/"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01201999","volume":"2","author":"MJ Coster","year":"1992","unstructured":"Coster, M.J., Joux, A., LaMacchia, B.A., Odlyzko, A.M., Schnorr, C.-P., Stern, J.: Improved low-density subset sum algorithms. Comput. Complex. 2, 111\u2013128 (1992)","journal-title":"Comput. Complex."},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-13190-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"N Howgrave-Graham","year":"2010","unstructured":"Howgrave-Graham, N., Joux, A.: New generic algorithms for hard knapsacks. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 235\u2013256. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13190-5_12"},{"key":"6_CR9","series-title":"he IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. IRSS, pp. 85\u2013103. Springer, Boston (1972). \nhttps:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"6_CR10","series-title":"C.I.M.E. Summer Schools","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-11120-4_3","volume-title":"Theoretical Computer Science","author":"RM Karp","year":"2011","unstructured":"Karp, R.M.: Computational complexity of combinatorial and graph-theoretic problems. In: Preparata, F. (ed.) Theoretical Computer Science. CIME, vol. 68, pp. 97\u2013184. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-11120-4_3"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1145\/2455.2461","volume":"32","author":"JC Lagarias","year":"1985","unstructured":"Lagarias, J.C., Odlyzko, A.M.: Solving low-density subset sum problems. J. ACM (JACM) 32(1), 229\u2013246 (1985)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"6_CR12","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"6_CR13","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1137\/070705702","volume":"39","author":"PQ Nguyen","year":"2009","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: An LLL algorithm with quadratic complexity. SIAM J. Comput. 39(3), 874\u2013903 (2009)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/s11424-015-3324-9","volume":"29","author":"Y Pan","year":"2016","unstructured":"Pan, Y., Zhang, F.: Solving low-density multiple subset sum problems with SVP oracle. J. Syst. Sci. Complex. 29(1), 228\u2013242 (2016)","journal-title":"J. Syst. Sci. Complex."},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-642-39884-1_2","volume-title":"Financial Cryptography and Data Security","author":"D Ron","year":"2013","unstructured":"Ron, D., Shamir, A.: Quantitative analysis of the full bitcoin transaction graph. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 6\u201324. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39884-1_2"},{"key":"6_CR17","unstructured":"Schnorr, C.P.: Block Korkin-Zolotarev bases and successive minima. International Computer Science Institute (1992)"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-78813-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,10]],"date-time":"2018-04-10T10:05:48Z","timestamp":1523354748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-78813-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319788128","9783319788135"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-78813-5_6","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2018]]}}}