{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:02Z","timestamp":1780783142995,"version":"3.54.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_36","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:06Z","timestamp":1780780446000},"page":"515-530","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Cryptographic Applications of\u00a0Combinatorial Ranking for\u00a0Integer Compositions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6962-9347","authenticated-orcid":false,"given":"Gustavo","family":"Zambonin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1238-2489","authenticated-orcid":false,"given":"Larissa","family":"Gremelmaier Rosa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9611-5694","authenticated-orcid":false,"given":"Ricardo","family":"Cust\u00f3dio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3551-4063","authenticated-orcid":false,"given":"Daniel","family":"Panario","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"36_CR1","doi-asserted-by":"publisher","unstructured":"Andr\u00e9, D.: M\u00e9moire sur les combinaisons r\u00e9guli\u00e8res et leurs applications. Annales scientifiques de l\u2019\u00c9cole Normale Sup\u00e9rieure 5, 155\u2013198 (1876). https:\/\/doi.org\/10.24033\/asens.136. 2e s\u00e9rie","DOI":"10.24033\/asens.136"},{"key":"36_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14764-7","volume-title":"Matters Computational: Ideas, Algorithms, Source Code","author":"J Arndt","year":"2011","unstructured":"Arndt, J.: Matters Computational: Ideas, Algorithms, Source Code, 1st edn. Springer, Heidelberg (2011)","edition":"1"},{"key":"36_CR3","doi-asserted-by":"publisher","unstructured":"Barenghi, A., Pelosi, G.: Constant weight strings in constant time: a building block for code- based post-quantum cryptosystems. In: CF 2020: Proceedings of the 17th ACM International Conference on Computing Frontiers, pp. 132\u2013141 (2020). https:\/\/doi.org\/10.1145\/3387902.3392630","DOI":"10.1145\/3387902.3392630"},{"key":"36_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-05445-7_19","volume-title":"Selected Areas in Cryptography","author":"M Bellare","year":"2009","unstructured":"Bellare, M., Ristenpart, T., Rogaway, P., Stegers, T.: Format-preserving encryption. In: Jacobson, M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 295\u2013312. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05445-7_19"},{"key":"36_CR5","unstructured":"Eger, S.: Stirling\u2019s approximation for central extended binomial coefficients. J. Integer Sequences 16(13.1.3) (2013)"},{"key":"36_CR6","doi-asserted-by":"publisher","unstructured":"Fahssi, N.E.: Polynomial triangles revisited. arXiv:1202.0228v7 (2012). https:\/\/doi.org\/10.48550\/arXiv.1202.0228","DOI":"10.48550\/arXiv.1202.0228"},{"key":"36_CR7","doi-asserted-by":"publisher","unstructured":"Filho, D.L.G., Adj, G., Bettaieb, S., Budroni, A., Ch\u00e1vez-Saab, J., Rodr\u00edguez-Henr\u00edquez, F.: Sota voce: low-noise sampling of sparse fixed-weight vectors. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2026(1), 353\u2013375 (2026). https:\/\/doi.org\/10.46586\/tches.v2026.i1.353-375","DOI":"10.46586\/tches.v2026.i1.353-375"},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics, 1st edn. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511801655"},{"issue":"1","key":"36_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(94)90226-7","volume":"132","author":"P Flajolet","year":"1994","unstructured":"Flajolet, P., Zimmermann, P., Cutsem, B.V.: A calculus for the random generation of labelled combinatorial structures. Theoret. Comput. Sci. 132(1), 1\u201335 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90226-7","journal-title":"Theoret. Comput. Sci."},{"key":"36_CR10","doi-asserted-by":"publisher","unstructured":"Genitrini, A., P\u00e9pin, M.: Lexicographic unranking of combinations revisited. Algorithms 14(3), 97 (2021). https:\/\/doi.org\/10.3390\/a14030097","DOI":"10.3390\/a14030097"},{"key":"36_CR11","doi-asserted-by":"publisher","unstructured":"Honda, M., Kaji, Y.: Optimum fingerprinting function for Winternitz one-time signature. In: 2024 IEEE International Symposium on Information Theory (ISIT), pp. 2898\u20132902 (2024). https:\/\/doi.org\/10.1109\/ISIT57864.2024.10619351","DOI":"10.1109\/ISIT57864.2024.10619351"},{"key":"36_CR12","doi-asserted-by":"publisher","unstructured":"H\u00fclsing, A., Kudinov, M., Ronen, E., Yogev, E.: SPHINCS+C: compressing SPHINCS+ with (almost) no cost. In: 2023 IEEE Symposium on Security and Privacy (S&P), pp. 1435\u20131453 (2023). https:\/\/doi.org\/10.1109\/SP46215.2023.10179381","DOI":"10.1109\/SP46215.2023.10179381"},{"key":"36_CR13","unstructured":"ISO\/IEC JTC 1\/SC 22: Information technology \u2014 Programming languages \u2014 C. Standard 9899:2024, International Organization for Standardization (2024)"},{"key":"36_CR14","doi-asserted-by":"publisher","unstructured":"Khovratovich, D., Kudinov, M., Wagner, B.: At the top of the hypercube \u2013 better size-time tradeoffs for hash- based signatures. In: Kalai, Y.T., Kamara, S.F. (eds.) Advances in Cryptology \u2013 CRYPTO 2025. LNCS, vol. 16005, pp. 93\u2013123 (2025). https:\/\/doi.org\/10.1007\/978-3-032-01887-8_4","DOI":"10.1007\/978-3-032-01887-8_4"},{"key":"36_CR15","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 4A: Combinatorial Algorithms, Part 1, 1st edn. Addison-Wesley Professional (2011)"},{"key":"36_CR16","doi-asserted-by":"publisher","unstructured":"Krausz, M., Land, G., Richter-Brockmann, J., G\u00fcneysu, T.: A holistic approach towards side-channel secure fixed-weight polynomial sampling. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography \u2013 PKC 2023. LNCS, vol. 13941, pp. 94\u2013124 (2023). https:\/\/doi.org\/10.1007\/978-3-031-31371-4_4","DOI":"10.1007\/978-3-031-31371-4_4"},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"Kreher, D.L., Stinson, D.R.: Combinatorial Algorithms: Generation, Enumeration, and Search, 1st edn. CRC Press (1998)","DOI":"10.1145\/309739.309744"},{"key":"36_CR18","doi-asserted-by":"publisher","unstructured":"Lo\u00e8ve, M.: Probability Theory I, Graduate Texts in Mathematics, vol.\u00a045. Springer (1977). https:\/\/doi.org\/10.1007\/978-1-4684-9464-8","DOI":"10.1007\/978-1-4684-9464-8"},{"issue":"3","key":"36_CR19","doi-asserted-by":"publisher","first-page":"3063","DOI":"10.1109\/TDSC.2024.3524626","volume":"22","author":"M L\u00f3pez-Garc\u00eda","year":"2024","unstructured":"L\u00f3pez-Garc\u00eda, M., Farouk-Marei, D.G., Cant\u00f3-Navarro, E.: Converting fixed-length binary strings into constant weight words: application on post-quantum cryptography. IEEE Trans. Dependable Secure Comput. 22(3), 3063\u20133074 (2024). https:\/\/doi.org\/10.1109\/TDSC.2024.3524626","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"3\u20134","key":"36_CR20","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1002\/rsa.10025","volume":"19","author":"C Mart\u00ednez","year":"2001","unstructured":"Mart\u00ednez, C., Molinero, X.: A generic approach for the unranking of labeled combinatorial classes. Random Struct. Alg. 19(3\u20134), 472\u2013497 (2001). https:\/\/doi.org\/10.1002\/rsa.10025","journal-title":"Random Struct. Alg."},{"key":"36_CR21","doi-asserted-by":"publisher","unstructured":"Miracle, S., Yilek, S.: New algorithms and analyses for sum-preserving encryption. In: Agrawal, S., Lin, D. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2022. LNCS, vol. 13793, pp. 3\u201331 (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_1","DOI":"10.1007\/978-3-031-22969-5_1"},{"key":"36_CR22","unstructured":"de\u00a0Moivre, A.: Miscellanea analytica de seriebus et quadraturis, 1st edn. J. Tonson & J. Watts (1730)"},{"key":"36_CR23","unstructured":"Molinero, X.: Ordered generation of classes of combinatorial structures. Ph.D. thesis, Universitat Polit\u00e8cnica de Catalunya (2005)"},{"key":"36_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-030-79876-5_37","volume-title":"Automated Deduction \u2013 CADE 28","author":"L Moura","year":"2021","unstructured":"Moura, L., Ullrich, S.: The lean 4 theorem prover and programming language. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 625\u2013635. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79876-5_37"},{"key":"36_CR25","doi-asserted-by":"publisher","unstructured":"NIST: Stateless Hash-Based Digital Signature Standard. Federal Information Processing Standards Publication\u00a0205. National Institute of Standards and Technology (2024). https:\/\/doi.org\/10.6028\/nist.fips.205","DOI":"10.6028\/nist.fips.205"},{"issue":"4","key":"36_CR26","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s13389-021-00264-9","volume":"11","author":"LP Perin","year":"2021","unstructured":"Perin, L.P., Zambonin, G., Cust\u00f3dio, R., Moura, L., Panario, D.: Improved constant-sum encodings for hash-based signatures. J. Cryptogr. Eng. 11(4), 329\u2013351 (2021). https:\/\/doi.org\/10.1007\/s13389-021-00264-9","journal-title":"J. Cryptogr. Eng."},{"key":"36_CR27","unstructured":"Qin, Z., Sun, S.: Extending the SPHINCS+ framework: varying the tree heights and chain lengths. Cryptology ePrint Archive, Paper 2025\/2236 (2025). https:\/\/eprint.iacr.org\/2025\/2236"},{"issue":"2","key":"36_CR28","doi-asserted-by":"publisher","first-page":"222","DOI":"10.2298\/AADM0802222R","volume":"2","author":"J Ratsaby","year":"2008","unstructured":"Ratsaby, J.: Estimate of the number of restricted integer-partitions. Appl. Anal. Discrete Math. 2(2), 222\u2013233 (2008). https:\/\/doi.org\/10.2298\/AADM0802222R","journal-title":"Appl. Anal. Discrete Math."},{"key":"36_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-45450-0_11","volume-title":"Information Security and Privacy","author":"L Reyzin","year":"2002","unstructured":"Reyzin, L., Reyzin, N.: Better than BiBa: short one-time signatures with fast signing and verifying. In: Batten, L., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 144\u2013153. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45450-0_11"},{"key":"36_CR30","doi-asserted-by":"publisher","unstructured":"Stojmenovi\u0107, I.: Generating all and random instances of a combinatorial object. In: Handbook of Applied Algorithms: Solving Scientific, Engineering and Practical Problems, 1st edn., pp. 1\u201338. Wiley (2007). https:\/\/doi.org\/10.1002\/9780470175668.ch1","DOI":"10.1002\/9780470175668.ch1"},{"key":"36_CR31","doi-asserted-by":"publisher","unstructured":"Tajik, K., et al.: Balancing image privacy and usability with thumbnail-preserving encryption. In: Network and Distributed Systems Security (NDSS) Symposium 2019 (2019). https:\/\/doi.org\/10.14722\/ndss.2019.23432","DOI":"10.14722\/ndss.2019.23432"},{"issue":"13","key":"36_CR32","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.ipl.2011.03.022","volume":"111","author":"V Vajnovszki","year":"2011","unstructured":"Vajnovszki, V., Vernay, R.: Restricted compositions and permutations: from old to new Gray codes. Inf. Process. Lett. 111(13), 650\u2013655 (2011). https:\/\/doi.org\/10.1016\/j.ipl.2011.03.022","journal-title":"Inf. Process. Lett."},{"key":"36_CR33","doi-asserted-by":"publisher","unstructured":"Zambonin, G.: bic. Version 0.2.0 (2026). https:\/\/doi.org\/10.5281\/zenodo.19476406","DOI":"10.5281\/zenodo.19476406"},{"key":"36_CR34","doi-asserted-by":"publisher","unstructured":"Zambonin, G.: bic-proofs. Version 0.2.0 (2026). https:\/\/doi.org\/10.5281\/zenodo.19476432","DOI":"10.5281\/zenodo.19476432"},{"key":"36_CR35","doi-asserted-by":"publisher","unstructured":"Zhang, K., Cui, H., Yu, Y.: Revisiting the constant-sum Winternitz one-time signature with applications to SPHINCS$$^+$$ and XMSS. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023. LNCS, vol. 14085, pp. 455\u2013483 (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_15","DOI":"10.1007\/978-3-031-38554-4_15"},{"key":"36_CR36","doi-asserted-by":"publisher","first-page":"5877","DOI":"10.1109\/tmm.2022.3200310","volume":"25","author":"Y Zhang","year":"2022","unstructured":"Zhang, Y., Zhou, W., Zhao, R., Zhang, X., Cao, X.: F-TPE: flexible thumbnail-preserving encryption based on multi-pixel sum-preserving encryption. IEEE Trans. Multimedia 25, 5877\u20135891 (2022). https:\/\/doi.org\/10.1109\/tmm.2022.3200310","journal-title":"IEEE Trans. Multimedia"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:09Z","timestamp":1780780449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}