{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T22:40:13Z","timestamp":1767912013624,"version":"3.49.0"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,9,26]],"date-time":"2023-09-26T00:00:00Z","timestamp":1695686400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,26]],"date-time":"2023-09-26T00:00:00Z","timestamp":1695686400000},"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":["J Cryptol"],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s00145-023-09480-4","type":"journal-article","created":{"date-parts":[[2023,9,26]],"date-time":"2023-09-26T21:01:23Z","timestamp":1695762083000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Non-malleable Vector Commitments via Local Equivocability"],"prefix":"10.1007","volume":"36","author":[{"given":"Lior","family":"Rotem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gil","family":"Segev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,26]]},"reference":[{"key":"9480_CR1","doi-asserted-by":"crossref","unstructured":"J.H. Ahn, D.\u00a0Boneh, J.\u00a0Camenisch, S.\u00a0Hohenberger, A. Shelat, B.\u00a0Waters, Computing on authenticated data, in Proceedings of the 9th Theory of Cryptography Conference (2012), pp. 169\u2013191","DOI":"10.1007\/978-3-642-28914-9_1"},{"key":"9480_CR2","doi-asserted-by":"crossref","unstructured":"B.\u00a0Barak, How to go beyond the black-box simulation barrier, in Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science (2001), pp. 106\u2013115","DOI":"10.1109\/SFCS.2001.959885"},{"key":"9480_CR3","doi-asserted-by":"crossref","unstructured":"B.\u00a0B\u00fcnz, J.\u00a0Bootle, D.\u00a0Boneh, A.\u00a0Poelstra, P.\u00a0Wuille, G.\u00a0Maxwell, Bulletproofs: short proofs for confidential transactions and more, in Proceedings of the IEEE Symposium on Security and Privacy (2018), pp. 315\u2013334","DOI":"10.1109\/SP.2018.00020"},{"key":"9480_CR4","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, B.\u00a0B\u00fcnz, B.\u00a0Fisch, Batching techniques for accumulators with applications to IOPs and stateless blockchains, in Advances in Cryptology\u2014CRYPTO \u201919 (2019), pp. 561\u2013586","DOI":"10.1007\/978-3-030-26948-7_20"},{"key":"9480_CR5","doi-asserted-by":"crossref","unstructured":"E.\u00a0Ben-Sasson, A.\u00a0Chiesa, C.\u00a0Garman, M.\u00a0Green, I.\u00a0Miers, E.\u00a0Tromer, M.\u00a0Virza, Zerocash: decentralized anonymous payments from bitcoin, in Proceedings of the IEEE Symposium on Security and Privacy (2014), pp. 459\u2013474","DOI":"10.1109\/SP.2014.36"},{"key":"9480_CR6","doi-asserted-by":"crossref","unstructured":"J.\u00a0Benaloh, M.\u00a0de\u00a0Mare, One-way accumulators: a decentralized alternative to digital signatures, in Advances in Cryptology\u2014EUROCRYPT \u201993 (1993), pp. 274\u2013285","DOI":"10.1007\/3-540-48285-7_24"},{"key":"9480_CR7","doi-asserted-by":"crossref","unstructured":"S.\u00a0Benabbas, R.\u00a0Gennaro, Y.\u00a0Vahlis, Verifiable delegation of computation over large datasets, in Advances in Cryptology\u2014CRYPTO \u201911 (2011), pp. 111\u2013131","DOI":"10.1007\/978-3-642-22792-9_7"},{"key":"9480_CR8","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bichler, Market Design: A Linear Programming Approach to Auctions and Matching (Cambridge University Press, Cambridge, 2017)","DOI":"10.1017\/9781316779873"},{"key":"9480_CR9","doi-asserted-by":"crossref","unstructured":"N.\u00a0Bari\u0107, B.\u00a0Pfitzmann, Collision-free accumulators and fail-stop signature schemes without trees, in Advances in Cryptology\u2014EUROCRYPT \u201997 (1997), pp. 480\u2013494","DOI":"10.1007\/3-540-69053-0_33"},{"key":"9480_CR10","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare, P.\u00a0Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, in Proceedings of the 1st ACM Conference on Computer and Communications Security (1993), pp. 62\u201373","DOI":"10.1145\/168588.168596"},{"key":"9480_CR11","doi-asserted-by":"crossref","unstructured":"M.\u00a0Bellare, S.\u00a0Shoup, Two-tier signatures, strongly unforgeable signatures, and Fiat\u2013Shamir without random oracles, in Proceedings of the 10th International Conference on Theory and Practice of Public-Key Cryptography (2007), pp. 201\u2013216","DOI":"10.1007\/978-3-540-71677-8_14"},{"key":"9480_CR12","doi-asserted-by":"crossref","unstructured":"D.\u00a0Boneh, E.\u00a0Shen, B.\u00a0Waters, Strongly unforgeable signatures based on computational Diffie-Hellman, in Proceedings of the 9th International Conference on Theory and Practice of Public-Key Cryptography (2006), pp. 229\u2013240","DOI":"10.1007\/11745853_15"},{"key":"9480_CR13","unstructured":"V.\u00a0Buterin, Ethereum: a next-generation smart contract and decentralized application platform (2014). https:\/\/ethereum.org\/en\/whitepaper\/"},{"key":"9480_CR14","unstructured":"V.\u00a0Buterin, The stateless client concept (2017). https:\/\/ethresear.ch\/t\/the-stateless-client-concept\/172"},{"key":"9480_CR15","doi-asserted-by":"crossref","unstructured":"D.\u00a0Catalano, Y.\u00a0Dodis, I.\u00a0Visconti, Mercurial commitments: minimal assumptions and efficient constructions, in Proceedings of the 3rd Theory of Cryptography Conference (2006), pp. 120\u2013144","DOI":"10.1007\/11681878_7"},{"key":"9480_CR16","doi-asserted-by":"crossref","unstructured":"R.\u00a0Canetti, M.\u00a0Fischlin, Universally composable commitments, in Advances in Cryptology\u2014CRPYTO \u201901 (2001), pp. 19\u201340","DOI":"10.1007\/3-540-44647-8_2"},{"key":"9480_CR17","doi-asserted-by":"crossref","unstructured":"D.\u00a0Catalano, D.\u00a0Fiore, Vector commitments and their applications, in Proceedings of the 16th International Conference on Practice and Theory in Public-Key Cryptography (2013), pp. 55\u201372","DOI":"10.1007\/978-3-642-36362-7_5"},{"key":"9480_CR18","doi-asserted-by":"crossref","unstructured":"M.\u00a0Campanelli, D.\u00a0Fiore, N.\u00a0Greco, D.\u00a0Kolonelos, L.\u00a0Nizzardo, Incrementally aggregatable vector commitments and applications to verifiable decentralized storage, in Advances in Cryptology\u2014ASIACRYPT \u201920 (2020), pp. 3\u201335","DOI":"10.1007\/978-3-030-64834-3_1"},{"issue":"2","key":"9480_CR19","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00145-012-9122-9","volume":"26","author":"M Chase","year":"2013","unstructured":"M.\u00a0Chase, A.\u00a0Healy, A.\u00a0Lysyanskaya, T.\u00a0Malkin, L.\u00a0Reyzin, Mercurial commitments with applications to zero-knowledge sets. J. Cryptol. 26(2), 251\u2013279 (2013)","journal-title":"J. Cryptol."},{"key":"9480_CR20","doi-asserted-by":"crossref","unstructured":"G.D. Crescenzo, Y.\u00a0Ishai, R.\u00a0Ostrovsky, Non-interactive and non-malleable commitment, in Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (1998), pp. 141\u2013150","DOI":"10.1145\/276698.276722"},{"key":"9480_CR21","doi-asserted-by":"crossref","unstructured":"G.D. Crescenzo, J.\u00a0Katz, R.\u00a0Ostrovsky, A.D. Smith. Efficient and non-interactive non-malleable commitment, in Advances in Cryptology\u2014EUROCRYPT \u201901 (2001), pp. 40\u201359","DOI":"10.1007\/3-540-44987-6_4"},{"key":"9480_CR22","doi-asserted-by":"crossref","unstructured":"J.\u00a0Camenisch, A.\u00a0Lysyanskaya, Dynamic accumulators and application to efficient revocation of anonymous credentials, in Advances in Cryptology\u2014CRYPTO \u201902 (2002), pp. 61\u201376","DOI":"10.1007\/3-540-45708-9_5"},{"key":"9480_CR23","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ciampi, R.\u00a0Ostrovsky, L.\u00a0Siniscalchi, I.\u00a0Visconti, Four-round concurrent non-malleable commitments from one-way functions, in Advances in Cryptology\u2014CRYPTO \u201917 (2017), pp. 127\u2013157","DOI":"10.1007\/978-3-319-63715-0_5"},{"issue":"4","key":"9480_CR24","doi-asserted-by":"publisher","first-page":"2488","DOI":"10.1109\/TIT.2011.2112150","volume":"57","author":"D Catalano","year":"2011","unstructured":"D.\u00a0Catalano, M.D. Raimondo, D.\u00a0Fiore, M.\u00a0Messina, Zero-knowledge sets with short proofs. IEEE Trans. Inf. Theory 57(4), 2488\u20132502 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"9480_CR25","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"D.\u00a0Dolev, C.\u00a0Dwork, M.\u00a0Naor, Nonmalleable cryptography. SIAM J. Comput. 30(2), 391\u2013437 (2000)","journal-title":"SIAM J. Comput."},{"key":"9480_CR26","doi-asserted-by":"crossref","unstructured":"I.\u00a0Damgard, J.\u00a0Groth. Non-interactive and reusable non-malleable commitment schemes, in Proceedings of the 35th Annual ACM Symposium on the Theory of Computing (2003), pp. 426\u2013437","DOI":"10.1145\/780542.780605"},{"key":"9480_CR27","doi-asserted-by":"crossref","unstructured":"Y.\u00a0Dodis, A.\u00a0Kiayias, A.\u00a0Nicolosi, V.\u00a0Shoup, Anonymous identification in ad hoc groups, in Advances in Cryptology\u2014EUROCRYPT \u201904 (2004), pp. 609\u2013626","DOI":"10.1007\/978-3-540-24676-3_36"},{"key":"9480_CR28","doi-asserted-by":"crossref","unstructured":"M.\u00a0Fischlin, R.\u00a0Fischlin. Efficient non-malleable commitment schemes, in Advances in Cryptology\u2014CRYPTO \u201900 (2000), pp. 413\u2013431","DOI":"10.1007\/3-540-44598-6_26"},{"key":"9480_CR29","unstructured":"M.\u00a0Fischlin, Trapdoor commitment schemes and their applications. Ph.D. Thesis, University of Frankfurt (2001) https:\/\/www.math.uni-frankfurt.de\/~dmst\/research\/phdtheses\/mfischlin.dissertation.2001.html"},{"key":"9480_CR30","unstructured":"C.\u00a0Fromknecht, D.\u00a0Velicanu, S.\u00a0Yakoubov, A decentralized public key infrastructure with identity retention. Cryptology ePrint Archive, Report 2014\/803 (2014)"},{"key":"9480_CR31","doi-asserted-by":"crossref","unstructured":"V.\u00a0Goyal, C.-K. Lee, R.\u00a0Ostrovsky, I.\u00a0Visconti, Constructing non-malleable commitments: a black-box approach, in Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science (2012), pp. 51\u201360","DOI":"10.1109\/FOCS.2012.47"},{"key":"9480_CR32","doi-asserted-by":"crossref","unstructured":"R.\u00a0Gennaro, S.\u00a0Micali, Independent zero-knowledge sets, in Proceedings of the 33th International Colloquium on Automata, Languages and Programming (2006), pp. 34\u201345","DOI":"10.1007\/11787006_4"},{"key":"9480_CR33","doi-asserted-by":"crossref","unstructured":"J.A. Garay, P.\u00a0MacKenzie, K.\u00a0Yang, Strengthening zero-knowledge protocols using signatures, in Advances in Cryptology\u2014EUROCRYPT \u201903 (2003), pp. 177\u2013194","DOI":"10.1007\/3-540-39200-9_11"},{"key":"9480_CR34","doi-asserted-by":"crossref","unstructured":"V.\u00a0Goyal, O.\u00a0Pandey, S.\u00a0Richelson, Textbook non-malleable commitments, in Proceedings of the 48th Annual ACM Symposium on Theory of Computing (2016), pp. 1128\u20131141","DOI":"10.1145\/2897518.2897657"},{"key":"9480_CR35","doi-asserted-by":"crossref","unstructured":"R.\u00a0Gennaro, P.\u00a0Rohatgi, How to sign digital streams, in Advances in Cryptology\u2014CRYPTO \u201997 (1997), pp. 180\u2013197","DOI":"10.1007\/BFb0052235"},{"key":"9480_CR36","doi-asserted-by":"crossref","unstructured":"S.\u00a0Gorbunov, L.\u00a0Reyzin, H.\u00a0Wee, Z.\u00a0Zhang, Pointproofs: aggregating proofs for multiple vector commitments, in Proceedings of the 27th ACM Conference on Computer and Communications Security (2020), pp. 2007\u20132023","DOI":"10.1145\/3372297.3417244"},{"issue":"4","key":"9480_CR37","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"J.\u00a0H\u00e5stad, R.\u00a0Impagliazzo, L.A. Levin, M.\u00a0Luby. A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"9480_CR38","doi-asserted-by":"crossref","unstructured":"D.\u00a0Khurana, Round optimal concurrent non-malleability from polynomial hardness, in Proceedings of the 15th Theory of Cryptography Conference (2017), pp. 139\u2013171","DOI":"10.1007\/978-3-319-70503-3_5"},{"key":"9480_CR39","doi-asserted-by":"crossref","unstructured":"J.\u00a0Kilian, A note on efficient zero-knowledge proofs and arguments, in Proceedings of the 24th Annual ACM Symposium on Theory of Computing (1992), pp. 723\u2013732","DOI":"10.1145\/129712.129782"},{"key":"9480_CR40","doi-asserted-by":"crossref","unstructured":"J.\u00a0Krupp, D.\u00a0Schr\u00f6der, M.\u00a0Simkin, D.\u00a0Fiore, G.\u00a0Ateniese, S.\u00a0N\u00fcrnberger, Nearly optimal verifiable data streaming, in Proceedings of the 19th International Conference on Practice and Theory in Public-Key Cryptography (2016), pp. 417\u2013445","DOI":"10.1007\/978-3-662-49384-7_16"},{"key":"9480_CR41","unstructured":"L.\u00a0Lamport, Constructing digital signatures from a one way function. Technical Report SRI-CSL-98, SRI International Computer Science Laboratory (1979)"},{"key":"9480_CR42","doi-asserted-by":"crossref","unstructured":"R.\u00a0W.\u00a0F. Lai and G.\u00a0Malavolta. Subvector commitments with application to succinct arguments. In Advances in Cryptology \u2013 CRYPTO \u201919, pages 530\u2013560, 2019.","DOI":"10.1007\/978-3-030-26948-7_19"},{"key":"9480_CR43","doi-asserted-by":"crossref","unstructured":"H.\u00a0Lin, R.\u00a0Pass. Non-malleability amplification, in Proceedings of the 41st annual ACM Symposium on Theory of Computing (2009), pp. 189\u2013198","DOI":"10.1145\/1536414.1536442"},{"key":"9480_CR44","doi-asserted-by":"crossref","unstructured":"H.\u00a0Lin, R.\u00a0Pass, Constant-round non-malleable commitments from any one-way function, in Proceedings of the 43rd Annual ACM Symposium on Theory of Computing (2011), pp. 705\u2013714","DOI":"10.1145\/1993636.1993730"},{"key":"9480_CR45","doi-asserted-by":"crossref","unstructured":"H.\u00a0Lin, R.\u00a0Pass, M.\u00a0Venkitasubramaniam, Concurrent non-malleable commitments from any one-way function, in Proceedings of the 5th Theory of Cryptography Conference (2008), pp. 571\u2013588","DOI":"10.1007\/978-3-540-78524-8_31"},{"key":"9480_CR46","doi-asserted-by":"crossref","unstructured":"B.\u00a0Libert, M.\u00a0Yung, Concise mercurial vector commitments and independent zero-knowledge sets with short proofs, in Proceedings of the 7th Theory of Cryptography Conference (2010), pp. 499\u2013517","DOI":"10.1007\/978-3-642-11799-2_30"},{"key":"9480_CR47","doi-asserted-by":"crossref","unstructured":"R.C. Merkle. A digital signature based on a conventional encryption function, in Advances in Cryptology\u2014CRYPTO \u201987 (1987), pp. 369\u2013378","DOI":"10.1007\/3-540-48184-2_32"},{"key":"9480_CR48","doi-asserted-by":"crossref","unstructured":"I.\u00a0Miers, C.\u00a0Garman, M.\u00a0Green, A.D. Rubin. Zerocoin: anonymous distributed e-cash from bitcoin, in IEEE Symposium on Security and Privacy (2013), pp. 397\u2013411","DOI":"10.1109\/SP.2013.34"},{"key":"9480_CR49","unstructured":"S.\u00a0Micali, CS proofs, in Proceedings of the 35th Annual IEEE Symposium on the Foundations of Computer Science (1994), pp. 436\u2013453"},{"issue":"1","key":"9480_CR50","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00453-003-1076-8","volume":"39","author":"C Martel","year":"2004","unstructured":"C.\u00a0Martel, G.\u00a0Nuckolls, P.\u00a0Devanbu, M.\u00a0Gertz, A.\u00a0Kwong, S.G. Stubblebine, A general model for authenticated data structures, Algorithmica 39(1), 21\u201324 (2004)","journal-title":"Algorithmica"},{"key":"9480_CR51","unstructured":"S.\u00a0Micali, M.O. Rabin, J.\u00a0Kilian, Zero-knowledge sets. in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (2003), pp. 80\u201391"},{"key":"9480_CR52","unstructured":"S.\u00a0Nakamoto. Bitcoin: a peer-to-peer electronic cash system (2008). https:\/\/bitcoin.org\/bitcoin.pdf"},{"issue":"2","key":"9480_CR53","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"M.\u00a0Naor, Bit commitment using pseudorandomness. J. Cryptol. 4(2), 151\u2013158 (1991)","journal-title":"J. Cryptol."},{"key":"9480_CR54","doi-asserted-by":"crossref","unstructured":"L.\u00a0Nguyen, Accumulators from bilinear pairings and applications, in Topics in Cryptology\u2014CT-RSA \u201905 (2005), pp. 275\u2013292","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"9480_CR55","unstructured":"M.\u00a0Naor, K.\u00a0Nissim. Certificate revocation and certificate update, in Proceedings of the 7th USENIX Security Symposium (1998), pp. 217\u2013228"},{"key":"9480_CR56","doi-asserted-by":"crossref","unstructured":"M.\u00a0Naor, M.\u00a0Yung. Universal one-way hash functions and their cryptographic applications, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (1989), pp. 33\u201343","DOI":"10.1145\/73007.73011"},{"key":"9480_CR57","unstructured":"A.\u00a0Ozdemir, R.\u00a0Wahby, B.\u00a0Whitehat, D.\u00a0Boneh, Scaling verifiable computation using efficient set accumulators, in Proceedings of the 29th USENIX Security Symposium (2020), pp. 2075\u20132092"},{"key":"9480_CR58","doi-asserted-by":"crossref","unstructured":"O.\u00a0Pandey, R.\u00a0Pass, V.\u00a0Vaikuntanathan, Adaptive one-way functions and applications, in Advances in Cryptology\u2013CRYPTO \u201908 (2008), pp. 57\u201374","DOI":"10.1007\/978-3-540-85174-5_4"},{"key":"9480_CR59","unstructured":"R.\u00a0Pass, A.\u00a0Rosen, Concurrent non-malleable commitments, in Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (2005), pp. 563\u2013572"},{"issue":"2","key":"9480_CR60","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/060671553","volume":"38","author":"R Pass","year":"2008","unstructured":"R.\u00a0Pass, A.\u00a0Rosen, New and improved constructions of nonmalleable cryptographic protocols. SIAM J. Comput. 38(2), 702\u2013752 (2008)","journal-title":"SIAM J. Comput."},{"key":"9480_CR61","doi-asserted-by":"crossref","unstructured":"R.\u00a0Pass, H.\u00a0Wee, Constant-round non-malleable commitments from sub-exponential one-way functions, in Advances in Cryptology\u2014EUROCRYPT \u201910 (2010), pp. 638\u2013655","DOI":"10.1007\/978-3-642-13190-5_32"},{"key":"9480_CR62","unstructured":"L.\u00a0Reyzin, Zero-knowledge with public keys. Ph,D, Thesis, Massachusetts Institute of Technology (2001). https:\/\/www.cs.bu.edu\/~reyzin\/phd-thesis.html)"},{"key":"9480_CR63","doi-asserted-by":"crossref","unstructured":"J.\u00a0Rompel, One-way functions are necessary and sufficient for secure signatures, in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (1990), pp. 387\u2013394","DOI":"10.1145\/100216.100269"},{"key":"9480_CR64","doi-asserted-by":"crossref","unstructured":"T.\u00a0Sander, A.\u00a0Ta-Shma. Auditable, anonymous electronic cash, in Advances in Cryptology\u2014CRYPTO \u201999 (1999), pp. 555\u2013572","DOI":"10.1007\/3-540-48405-1_35"},{"key":"9480_CR65","unstructured":"E.\u00a0Stefanov, M.\u00a0van Dijk, A.\u00a0Jules, A.\u00a0Opera, Iris: a scalable cloud file system with efficient integrity checks, in Proceedings of the 28th Annual Computer Security Applications Conference (2021), pp. 229\u2013238"},{"key":"9480_CR66","doi-asserted-by":"crossref","unstructured":"A.\u00a0Tomescu, I.\u00a0Abraham, V.\u00a0Buterin, J.\u00a0Drake, D.\u00a0Feist, D.\u00a0Khovratovich, Aggregatable subvector commitments for stateless cryptocurrencies, in Proceedings of the 12th International Conference on Security and Cryptography for Networks (2020), pp. 45\u201364","DOI":"10.1007\/978-3-030-57990-6_3"},{"key":"9480_CR67","unstructured":"P.\u00a0Todd, Making UTXO set growth irrelevant with low-latency delayed TXO commitments (2016). https:\/\/petertodd.org\/2016\/delayed-txo-commitments"},{"key":"9480_CR68","doi-asserted-by":"crossref","unstructured":"H.\u00a0Wee, Black-box, round-efficient secure computation via non-malleability amplification, in Proceedings of the 51st Annual IEEE Symposium on Foundations of Computer Science (2010), pp. 531\u2013540","DOI":"10.1109\/FOCS.2010.87"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09480-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09480-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09480-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T16:04:13Z","timestamp":1698163453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09480-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,26]]},"references-count":68,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["9480"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09480-4","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,26]]},"assertion":[{"value":"8 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 September 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"40"}}