{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T13:21:35Z","timestamp":1773840095732,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642385520","type":"print"},{"value":"9783642385537","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38553-7_10","type":"book-chapter","created":{"date-parts":[[2013,5,9]],"date-time":"2013-05-09T00:47:12Z","timestamp":1368060432000},"page":"173-188","source":"Crossref","is-referenced-by-count":136,"title":["W-OTS+ \u2013 Shorter Signatures for Hash-Based Signature Schemes"],"prefix":"10.1007","author":[{"given":"Andreas","family":"H\u00fclsing","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-642-21969-6_23","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2011","author":"J. Buchmann","year":"2011","unstructured":"Buchmann, J., Dahmen, E., Ereth, S., H\u00fclsing, A., R\u00fcckert, M.: On the Security of the Winternitz One-Time Signature Scheme. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol.\u00a06737, pp. 363\u2013378. Springer, Heidelberg (2011)"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-25405-5_8","volume-title":"Post-Quantum Cryptography","author":"J. Buchmann","year":"2011","unstructured":"Buchmann, J., Dahmen, E., H\u00fclsing, A.: XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol.\u00a07071, pp. 117\u2013129. Springer, Heidelberg (2011)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-45708-9_21","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.A. Black","year":"2002","unstructured":"Black, J.A., Rogaway, P., Shrimpton, T.: Black-box analysis of the block-cipher-based hash-function constructions from PGV. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 320\u2013335. Springer, Heidelberg (2002)"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11586821_8","volume-title":"Cryptography and Coding","author":"C. Dods","year":"2005","unstructured":"Dods, C., Smart, N.P., Stam, M.: Hash Based Digital Signature Schemes. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol.\u00a03796, pp. 96\u2013115. Springer, Heidelberg (2005)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-35999-6_5","volume-title":"Selected Areas in Cryptography","author":"A. H\u00fclsing","year":"2013","unstructured":"H\u00fclsing, A., Busold, C., Buchmann, J.: Forward Secure Signatures on Smart Cards. In: Knudsen, L.R., Wu, H. (eds.) SAC 2012. LNCS, vol.\u00a07707, pp. 66\u201380. Springer, Heidelberg (2013)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput.\u00a028, 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/3-540-36178-2_24","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"A. Hevia","year":"2002","unstructured":"Hevia, A., Micciancio, D.: The provable security of graph-based one-time signatures and extensions to algebraic signature schemes. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 379\u2013396. Springer, Heidelberg (2002)"},{"key":"10_CR8","unstructured":"Lenstra, A.K.: Key lengths. In: Contribution to The Handbook of Information Security (2004)"},{"key":"10_CR9","first-page":"5658","volume":"27","author":"S. Matyas","year":"1985","unstructured":"Matyas, S., Meyer, C., Oseas, J.: Generating strong one-way functions with cryptographic algorithms. IBM Technical Disclosure Bulletin\u00a027, 5658\u20135659 (1985)","journal-title":"IBM Technical Disclosure Bulletin"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1145\/100216.100269","volume-title":"STOC 1990: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing","author":"J. Rompel","year":"1990","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: STOC 1990: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 387\u2013394. ACM Press, New York (1990)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38553-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T23:40:37Z","timestamp":1557704437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38553-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385520","9783642385537"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38553-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}