{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T01:10:09Z","timestamp":1768871409255,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T00:00:00Z","timestamp":1712188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T00:00:00Z","timestamp":1712188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper proposes and evaluates a new bipartite post-quantum digital signature protocol based on Winternitz chains and an\u00a0 oracle. Mutually mistrustful Alice and Bob are able to agree and sign a series of documents in a way that makes it impossible (within the assumed security model) to repudiate their signatures. The number of signatures supported by a single public key is still limited, though by a large number. However, the security of the signature scheme is not diminished by repeated application, so when the capacity of a public key is exhausted the last transaction can be used to agree a new key. Some ramifications are discussed, security parameters evaluated and an application area delineated for the proposed concept.<\/jats:p>","DOI":"10.1186\/s42400-024-00225-9","type":"journal-article","created":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T01:02:02Z","timestamp":1712192522000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Winternitz stack protocols for embedded systems and IoT"],"prefix":"10.1186","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8796-6542","authenticated-orcid":false,"given":"Alex","family":"Shafarenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,4]]},"reference":[{"key":"225_CR1","doi-asserted-by":"crossref","unstructured":"Bellare M, Rogaway P (1993) Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM conference on computer and communications security, CCS \u201993. Association for Computing Machinery, New York, pp 62\u201373","DOI":"10.1145\/168588.168596"},{"key":"225_CR2","doi-asserted-by":"crossref","unstructured":"Bernstein DJ, Hopwood D, H\u00fclsing A, Lange T, Niederhagen R, Papachristodoulou L, Schneider M, Schwabe P, Wilcox-O\u2019Hearn Z (2015) SPHINCS: practical stateless hash-based signatures. In: Oswald E, Fischlin N (eds) Advances in cryptology\u2014EUROCRYPT 2015. Springer, Berlin, pp 368\u2013397","DOI":"10.1007\/978-3-662-46800-5_15"},{"key":"225_CR3","doi-asserted-by":"crossref","unstructured":"Fujii H, Aranha DF (2019) Curve25519 for the Cortex-M4 and beyond. In: Progress in cryptology\u2014LATINCRYPT 2017. Springer, Berlin, pp 109\u2013127","DOI":"10.1007\/978-3-030-25283-0_6"},{"issue":"2","key":"225_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"Goldwasser S, Micali S, Rivest RL (1988) A digital signature scheme secure against adaptive chosen-message attacks. SIAM J Comput 17(2):281\u2013308","journal-title":"SIAM J Comput"},{"key":"225_CR5","unstructured":"H\u00fclsing A (2017) WOTS$$+$$\u2014shorter signatures for hash-based signature schemes. Cryptology ePrint Archive, Report 2017\/965"},{"key":"225_CR6","first-page":"1","volume":"8391","author":"A H\u00fclsing","year":"2018","unstructured":"H\u00fclsing A, Butin D, Gazdag S-L, Rijneveld J, Mohaisen A (2018) XMSS: eXtended Merkle signature scheme. RFC 8391:1\u201374","journal-title":"RFC"},{"key":"225_CR7","doi-asserted-by":"crossref","unstructured":"Jackson D, Cremers C, Cohn-Gordon K, Sasse R (2019) Seems legit: automated analysis of subtle attacks on protocols that use signatures. In: Proceedings of the 2019 ACM SIGSAC conference on computer and communications security, CCS \u201919. Association for Computing Machinery, New York, pp 2165\u20132180","DOI":"10.1145\/3319535.3339813"},{"key":"225_CR8","unstructured":"Lamport L (1979) Constructing digital signatures from a one-way function, vol 238. Technical Report CSL-98. Technical report, SRI International"},{"issue":"16","key":"225_CR9","doi-asserted-by":"publisher","first-page":"7350","DOI":"10.3390\/app11167350","volume":"11","author":"J Lee","year":"2021","unstructured":"Lee J, Park Y (2021) HORSIC$$+$$: an efficient post-quantum few-time signature scheme. Appl Sci 11(16):7350","journal-title":"Appl Sci"},{"key":"225_CR10","doi-asserted-by":"crossref","unstructured":"Li L, Lu X, Wang K (2023) eBiBa: a post-quantum hash-based signature with small signature size in the continuous communication of large-scale data. Comput J. bxad068","DOI":"10.1093\/comjnl\/bxad068"},{"key":"225_CR11","unstructured":"Merkle RC (1982) Secrecy, authentication and public-key cryptosystems. UMI Research Press"},{"key":"225_CR12","doi-asserted-by":"crossref","unstructured":"Merkle RC (1988) A digital signature based on a conventional encryption function. In: Pomerance C (ed) Advances in cryptology\u2014CRYPTO \u201987. Springer, Berlin, pp 369\u2013378","DOI":"10.1007\/3-540-48184-2_32"},{"key":"225_CR13","doi-asserted-by":"crossref","unstructured":"Reyzin L, Reyzin N (2002) Better than BiBa: short one-time signatures with fast signing and verifying. In: Batten L, Seberry J (eds) Information security and privacy. Springer, Berlin, pp 144\u2013153","DOI":"10.1007\/3-540-45450-0_11"},{"key":"225_CR14","doi-asserted-by":"crossref","unstructured":"Rogaway P, Shrimpton T (2004) Cryptographic hash-function basics: definitions, implications, and separations for preimage resistance, second-preimage resistance, and collision resistance. In: Roy R, Meier W (eds) Fast software encryption. Springer, Berlin, pp 371\u2013388","DOI":"10.1007\/978-3-540-25937-4_24"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00225-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-024-00225-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00225-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T01:02:44Z","timestamp":1712192564000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-024-00225-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,4]]},"references-count":14,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["225"],"URL":"https:\/\/doi.org\/10.1186\/s42400-024-00225-9","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,4]]},"assertion":[{"value":"28 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"34"}}