{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:36:23Z","timestamp":1743017783615,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031186783"},{"type":"electronic","value":"9783031186790"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-18679-0_10","type":"book-chapter","created":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T19:36:12Z","timestamp":1676835372000},"page":"169-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tweakable $$\\mathcal {S}_{\\text{ leeve }}$$: A Novel $$\\mathcal {S}_{\\text{ leeve }}$$ Construction Based on Tweakable Hash Functions"],"prefix":"10.1007","author":[{"given":"David","family":"Chaum","sequence":"first","affiliation":[]},{"given":"Mario","family":"Larangeira","sequence":"additional","affiliation":[]},{"given":"Mario","family":"Yaksetig","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,19]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Aranha, D. F., Novaes, F. R., Takahashi, A., Tibouchi, M., & Yarom, Y. (2020). Ladderleak: Breaking ecdsa with less than one bit of nonce leakage. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (pp. 225\u2013242). New York, NY, USA: CCS \u201920, Association for Computing Machinery.","key":"10_CR1","DOI":"10.1145\/3372297.3417268"},{"doi-asserted-by":"publisher","unstructured":"Badertscher, C., Gazi, P., Kiayias, A., Russell, A., & Zikas, V. (2018). Ouroboros genesis: Composable proof-of-stake blockchains with dynamic availability. In D. Lie, M. Mannan, M. Backes, & X. Wang (Eds.), ACM CCS (pp. 913\u2013930). ACM Press. https:\/\/doi.org\/10.1145\/3243734.3243848.","key":"10_CR2","DOI":"10.1145\/3243734.3243848"},{"doi-asserted-by":"publisher","unstructured":"Bernstein, D. J., H\u00fclsing, A., K\u00f6lbl, S., Niederhagen, R., Rijneveld, J., & Schwabe, P. (2019). The SPHINCS$$^+$$ signature framework. In L. Cavallaro, J. Kinder, X. Wang, & J. Katz (Eds.), ACM CCS (pp. 2129\u20132146). ACM Press. https:\/\/doi.org\/10.1145\/3319535.3363229.","key":"10_CR3","DOI":"10.1145\/3319535.3363229"},{"unstructured":"Mnemonic code for generating deterministic keys. Accessed September 10, 2021, from https:\/\/github.com\/bitcoin\/bips\/blob\/master\/bip-0039.mediawiki.","key":"10_CR4"},{"unstructured":"Mnemonic code converter. Accessed September 10, 2021, from https:\/\/iancoleman.io\/bip39\/.","key":"10_CR5"},{"doi-asserted-by":"crossref","unstructured":"Brown, D. (2005). On the provable security of ECDSA, pp. 21\u201340. London Mathematical Society Lecture Note Series, Cambridge University Press.","key":"10_CR6","DOI":"10.1017\/CBO9780511546570.004"},{"doi-asserted-by":"crossref","unstructured":"Brown, D. R. (2005). Generic groups, collision resistance, and ecdsa. vol.\u00a035, pp. 119\u2013152. Springer.","key":"10_CR7","DOI":"10.1007\/s10623-003-6154-z"},{"doi-asserted-by":"crossref","unstructured":"Chaum, D., Larangeira, M., Yaksetig, M., & Carter, W. (2021). Wots+ up my sleeve! a hidden secure fallback for cryptocurrency wallets. In International Conference on Applied Cryptography and Network Security (pp. 195\u2013219). Springer.","key":"10_CR8","DOI":"10.1007\/978-3-030-78372-3_8"},{"doi-asserted-by":"crossref","unstructured":"Chen, L. (2022). Recommendation for key derivation using pseudorandom functions-revision 1. NIST special publication. Accessed February 20, 2022, from https:\/\/doi.org\/10.6028\/NIST.SP.800-108r1-draft.","key":"10_CR9","DOI":"10.6028\/NIST.SP.800-108r1-draft"},{"doi-asserted-by":"publisher","unstructured":"Dahmen, E., Okeya, K., Takagi, T., & Vuillaume, C. (2008). Digital signatures out of second-preimage resistant hash functions. In J. Buchmann, & J. Ding (Eds.), Post-quantum Cryptography, Second International Workshop, PQCRYPTO (pp. 109\u2013123). Heidelberg: Springer. https:\/\/doi.org\/10.1007\/978-3-540-88403-3_8.","key":"10_CR10","DOI":"10.1007\/978-3-540-88403-3_8"},{"doi-asserted-by":"publisher","unstructured":"David, B., Gazi, P., Kiayias, A., & Russell, A. (2018). Ouroboros praos: An adaptively-secure, semi-synchronous proof-of-stake blockchain. In: J. B. Nielsen, & V. Rijmen (Eds.), EUROCRYPT, Part\u00a0II. LNCS (vol. 10821, pp. 66\u201398). Heidelberg: Springer. https:\/\/doi.org\/10.1007\/978-3-319-78375-8_3.","key":"10_CR11","DOI":"10.1007\/978-3-319-78375-8_3"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D Dolev","year":"1983","unstructured":"Dolev, D., & Yao, A. (1983). On the security of public key protocols. IEEE Transactions on Information Theory,\u00a029(2), 198\u2013208.","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"crossref","unstructured":"Fersch, M., Kiltz, E., & Poettering, B. (2016). On the provable security of (ec)dsa signatures. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security (pp. 1651\u20131662). New York, NY, USA: CCS \u201916, Association for Computing Machinery.","key":"10_CR13","DOI":"10.1145\/2976749.2978413"},{"doi-asserted-by":"publisher","unstructured":"Fersch, M., Kiltz, E., & Poettering, B. (2017). On the one-per-message unforgeability of (EC)DSA and its variants. In: Y. Kalai, & L. Reyzin (Eds.), TCC\u00a02017, Part\u00a0II. LNCS (vol. 10678, pp. 519\u2013534). Heidelberg: Springer https:\/\/doi.org\/10.1007\/978-3-319-70503-3_17.","key":"10_CR14","DOI":"10.1007\/978-3-319-70503-3_17"},{"unstructured":"Golang implementation of the bip39 spec. Accessed September 10, 2021, from https:\/\/godoc.org\/github.com\/tyler-smith\/go-bip39.","key":"10_CR15"},{"doi-asserted-by":"publisher","unstructured":"H\u00fclsing, A. (2013). W-OTS+ - shorter signatures for hash-based signature schemes. In A. Youssef, A. Nitaj, & A. E. Hassanien (Eds.), AFRICACRYPT 13. LNCS (vol.\u00a07918, pp. 173\u2013188). Heidelberg: Springer. https:\/\/doi.org\/10.1007\/978-3-642-38553-7_10.","key":"10_CR16","DOI":"10.1007\/978-3-642-38553-7_10"},{"doi-asserted-by":"crossref","unstructured":"Ilie, D. I., Karantias, K., & Knottenbelt, W. J. (2020). Bitcoin crypto-bounties for quantum capable adversaries. Cryptology ePrint Archive, Paper 2020\/186. https:\/\/eprint.iacr.org\/2020\/186.","key":"10_CR17","DOI":"10.1007\/978-3-030-53356-4_2"},{"doi-asserted-by":"crossref","unstructured":"Ilie, D. I., Knottenbelt, W. J., & Stewart, I. (2020). Committing to quantum resistance, better: A speed-and-risk-configurable defence for bitcoin against a fast quantum computing attack. Cryptology ePrint Archive, Paper 2020\/187. https:\/\/eprint.iacr.org\/2020\/187.","key":"10_CR18","DOI":"10.1007\/978-3-030-37110-4_9"},{"doi-asserted-by":"publisher","unstructured":"Kiayias, A., Russell, A., David, B., & Oliynykov, R. (2017). Ouroboros: A provably secure proof-of-stake blockchain protocol. In: J. Katz, & H. Shacham (Eds.), CRYPTO\u00a02017, Part\u00a0I. LNCS (vol. 10401, pp. 357\u2013388). Heidelberg: Springer. https:\/\/doi.org\/10.1007\/978-3-319-63688-7_12.","key":"10_CR19","DOI":"10.1007\/978-3-319-63688-7_12"},{"doi-asserted-by":"crossref","unstructured":"Kobeissi, N. (2021). Verifpal: Cryptographic Protocol Analysis for Students and Engineers. Accessed August 5, 2021, from https:\/\/verifpal.com.","key":"10_CR20","DOI":"10.1145\/3411495.3421365"},{"doi-asserted-by":"crossref","unstructured":"Kobeissi, N., Nicolas, G., & Tiwari, M. (2020). Verifpal: Cryptographic protocol analysis for the real world. In Proceedings of the 2020 ACM SIGSAC Conference on Cloud Computing Security Workshop (p.\u00a0159). New York, NY, USA: CCSW\u201920, Association for Computing Machinery.","key":"10_CR21","DOI":"10.1145\/3411495.3421365"},{"unstructured":"Nakamoto, S. (2009). Bitcoin: A peer-to-peer electronic cash system. http:\/\/www.bitcoin.org\/bitcoin.pdf.","key":"10_CR22"},{"unstructured":"Sleeve. (2022). Accessed February 21, 2022, from https:\/\/github.com\/xx-labs\/sleeve\/tree\/main\/verifpal_model.","key":"10_CR23"},{"unstructured":"Trinity attack incident part 1: Summary and next steps. Accessed September 22, 2020, from https:\/\/blog.iota.org\/trinity-attack-incident-part-1-summary-and-next-steps-8c7ccc4d81e8.","key":"10_CR24"},{"key":"10_CR25","first-page":"1","volume":"151","author":"G Wood","year":"2014","unstructured":"Wood, G. (2014). Ethereum: A secure decentralised generalised transaction ledger. Ethereum project yellow paper,\u00a0151, 1\u201332.","journal-title":"Ethereum project yellow paper"}],"container-title":["Lecture Notes in Operations Research","Mathematical Research for Blockchain Economy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18679-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T20:21:59Z","timestamp":1676838119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18679-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031186783","9783031186790"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18679-0_10","relation":{},"ISSN":["2731-040X","2731-0418"],"issn-type":[{"type":"print","value":"2731-040X"},{"type":"electronic","value":"2731-0418"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"19 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MARBLE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The International Conference on Mathematical Research for Blockchain Economy","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vilamoura","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"marble2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.marble-conference.org\/marble2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}