{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:03:56Z","timestamp":1772240636245,"version":"3.50.1"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683756","type":"print"},{"value":"9783031683763","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68376-3_4","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T21:02:07Z","timestamp":1723755727000},"page":"107-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["That\u2019s Not My Signature! Fail-Stop Signatures for\u00a0a\u00a0Post-quantum World"],"prefix":"10.1007","author":[{"given":"Cecilia","family":"Boschini","sequence":"first","affiliation":[]},{"given":"Hila","family":"Dahari","sequence":"additional","affiliation":[]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[]},{"given":"Eyal","family":"Ronen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Adrian, D., et al.: Imperfect forward secrecy: how Diffie-Hellman fails in practice. In: Ray, I., Li, N., Kruegel, C. (eds.) ACM CCS 2015, pp. 5\u201317. ACM Press, October 2015. https:\/\/doi.org\/10.1145\/2810103.2813707","DOI":"10.1145\/2810103.2813707"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status report on the third round of the NIST post-quantum cryptography standardization process (2022). https:\/\/csrc.nist.gov\/publications\/detail\/nistir\/8413\/final, Accessed 10 July 2022","DOI":"10.6028\/NIST.IR.8413"},{"key":"4_CR3","unstructured":"Aumasson, J.P., et al.: $$\\text{SPHINCS}^+$$. submission to NIST\u2019s post-quantum crypto standardization project, v.3 (2022). http:\/\/sphincs.org\/data\/sphincs+-round3-specification.pdf. Accessed 5 Oct 2022"},{"key":"4_CR4","unstructured":"Aviram, N., Dowling, B., Komargodski, I., Paterson, K.G., Ronen, E., Yogev, E.: Practical (post-quantum) key combiners from one-wayness and applications to TLS. IACR Cryptol. ePrint Arch., p.\u00a065 (2022). https:\/\/eprint.iacr.org\/2022\/065"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-69053-0_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"N Bari\u0107","year":"1997","unstructured":"Bari\u0107, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signature schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 480\u2013494. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_33"},{"key":"4_CR6","unstructured":"Ben-Sasson, E., Goldberg, L., Levit, D.: STARK friendly hash \u2013 survey and recommendation. Cryptology ePrint Archive, Report 2020\/948 (2020). https:\/\/eprint.iacr.org\/2020\/948"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J., H\u00fclsing, A., K\u00f6lbl, S., Niederhagen, R., Rijneveld, J., Schwabe, P.: The $$\\text{ SPHINCS}^+$$ signature framework. In: Cavallaro, L., Kinder, J., Wang, X., Katz, J. (eds.) ACM CCS 2019, pp. 2129\u20132146. ACM Press, November 2019. https:\/\/doi.org\/10.1145\/3319535.3363229","DOI":"10.1145\/3319535.3363229"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Beullens, W.: Breaking rainbow takes a weekend on a laptop. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0II. LNCS, vol. 13508, pp. 464\u2013479. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_16","DOI":"10.1007\/978-3-031-15979-4_16"},{"key":"4_CR9","unstructured":"Boschini, C., Dahari, H., Naor, M., Ronen, E.: That\u2019s not my signature! Fail-stop signatures for a post-quantum world. Cryptology ePrint Archive, Paper 2023\/1754 (2023). https:\/\/eprint.iacr.org\/2023\/1754"},{"key":"4_CR10","unstructured":"Boudot, F., Gaudry, P., Guillevic, A., Heninger, N., Thom\u00e9, E., Zimmermann, P.: Factorization of RSA-250 (2020). https:\/\/sympa.inria.fr\/sympa\/arc\/cado-nfs\/2020-02\/msg00001.html"},{"key":"4_CR11","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH (preliminary version). IACR Cryptol. ePrint Arch., p.\u00a0975 (2022). https:\/\/eprint.iacr.org\/2022\/975"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/0-387-34799-2_25","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"D Chaum","year":"1990","unstructured":"Chaum, D., Fiat, A., Naor, M.: Untraceable electronic cash. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 319\u2013327. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_25"},{"key":"4_CR13","unstructured":"Chen, Y.: Quantum algorithms for lattice problems. Cryptology ePrint Archive, Paper 2024\/555 (2024). https:\/\/eprint.iacr.org\/2024\/555"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-48329-2_22","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"IB Damg\u00e5rd","year":"1994","unstructured":"Damg\u00e5rd, I.B., Pedersen, T.P., Pfitzmann, B.: On the existence of statistically hiding bit commitment schemes and fail-stop signatures. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 250\u2013265. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_22"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"4_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC, pp. 212\u2013219. ACM (1996)","DOI":"10.1145\/237814.237866"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Haitner, I., Hoch, J.J., Reingold, O., Segev, G.: Finding collisions in interactive protocols - a tight lower bound on the round complexity of statistically-hiding commitments. In: 48th FOCS, pp. 669\u2013679. IEEE Computer Society Press, October 2007. https:\/\/doi.org\/10.1109\/FOCS.2007.27","DOI":"10.1109\/FOCS.2007.27"},{"key":"4_CR19","doi-asserted-by":"publisher","unstructured":"Haitner, I., Reingold, O.: Statistically-hiding commitment from any one-way function. In: Johnson, D.S., Feige, U. (eds.) 39th ACM STOC, pp. 1\u201310. ACM Press, June 2007. https:\/\/doi.org\/10.1145\/1250790.1250792","DOI":"10.1145\/1250790.1250792"},{"key":"4_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/3-540-68697-5_16","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201996","author":"S Halevi","year":"1996","unstructured":"Halevi, S., Micali, S.: Practical and provably-secure commitment schemes from collision-free hashing. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 201\u2013215. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_16"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-38553-7_10","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2013","author":"A H\u00fclsing","year":"2013","unstructured":"H\u00fclsing, A.: W-OTS+ \u2013 shorter signatures for hash-based signature schemes. In: Youssef, A., Nitaj, A., Hassanien, A.E. (eds.) AFRICACRYPT 2013. LNCS, vol. 7918, pp. 173\u2013188. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38553-7_10"},{"key":"4_CR22","unstructured":"Hulsing, A., et al.: SPHINCS+. Technical report, National Institute of Standards and Technology (2022). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/selected-algorithms-2022"},{"key":"4_CR23","unstructured":"H\u00fclsing, A., Kudinov, M.: Recovering the tight security proof of $${SPHINCS}^{+}$$. Cryptology ePrint Archive, Report 2022\/346 (2022). https:\/\/eprint.iacr.org\/2022\/346"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Kiktenko, E.O., Kudinov, M.A., Bulychev, A.A., Fedorov, A.K.: Proof-of-forgery for hash-based signatures. In: di\u00a0Vimercati, S.D.C., Samarati, P. (eds.) Proceedings of the 18th International Conference on Security and Cryptography, SECRYPT 2021, 6\u20138 July 2021, pp. 333\u2013342. SCITEPRESS (2021)","DOI":"10.5220\/0010579603330342"},{"key":"4_CR25","unstructured":"Lamport, L.: Constructing digital signatures from a one-way function. Technical report SRI-CSL-98, SRI International Computer Science Laboratory, October 1979"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Laurie, B., Messeri, E., Stradling, R.: Certificate transparency version 2.0. RFC\u00a09162, RFC Editor, December 2021","DOI":"10.17487\/RFC9162"},{"key":"4_CR27","unstructured":"Lyubashevsky, V., et al.: CRYSTALS-DILITHIUM. Technical report, National Institute of Standards and Technology (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-3-submissions"},{"key":"4_CR28","unstructured":"Maino, L., Martindale, C.: An attack on SIDH with arbitrary starting curve. IACR Cryptol. ePrint Arch., p.\u00a01026 (2022). https:\/\/eprint.iacr.org\/2022\/1026"},{"key":"4_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-642-24861-0_25","volume-title":"Information Security","author":"A Mashatan","year":"2011","unstructured":"Mashatan, A., Ouafi, K.: Efficient fail-stop signatures from the factoring assumption. In: Lai, X., Zhou, J., Li, H. (eds.) ISC 2011. LNCS, vol. 7001, pp. 372\u2013385. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24861-0_25"},{"key":"4_CR30","unstructured":"MATZOV: Report on the security of LWE: improved dual lattice attack. https:\/\/zenodo.org\/record\/6493704#.Yz_qSUpBxkg. Accessed 7 Oct 2022"},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"RC Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 218\u2013238. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_21"},{"key":"4_CR32","unstructured":"NIST: Call for additional digital signature schemes for the post-quantum cryptography standardization process (2022). https:\/\/csrc.nist.gov\/projects\/pqc-dig-sig\/standardization\/call-for-proposals. Accessed 7 Oct 2022"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Pedersen, T.P., Pfitzmann, B.: Fail-stop signatures. SIAM J. Comput. 26(2), 291\u2013330 (1997). https:\/\/doi.org\/10.1137\/S009753979324557X","DOI":"10.1137\/S009753979324557X"},{"key":"4_CR34","doi-asserted-by":"crossref","unstructured":"Perlner, R., Kelsey, J., Cooper, D.: Breaking category five SPHINCS+ with SHA-256. Cryptology ePrint Archive, Paper 2022\/1061 (2022). https:\/\/eprint.iacr.org\/2022\/1061","DOI":"10.1007\/978-3-031-17234-2_23"},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0024619","volume-title":"Digital Signature Schemes","author":"B Pfitzmann","year":"1996","unstructured":"Pfitzmann, B.: Digital Signature Schemes. LNCS, vol. 1100. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0024619"},{"key":"4_CR36","unstructured":"Prest, T., et al.: FALCON. Technical report, National Institute of Standards and Technology (2020). https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-3-submissions"},{"key":"4_CR37","unstructured":"Rogaway, P.: The moral character of cryptographic work. Cryptology ePrint Archive, Report 2015\/1162 (2015). https:\/\/eprint.iacr.org\/2015\/1162"},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-44495-5_15","volume-title":"Progress in Cryptology \u2014INDOCRYPT 2000","author":"R Safavi-Naini","year":"2000","unstructured":"Safavi-Naini, R., Susilo, W., Wang, H.: Fail-stop signature for long messages (extended abstract). In: Roy, B., Okamoto, E. (eds.) INDOCRYPT 2000. LNCS, vol. 1977, pp. 165\u2013177. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44495-5_15"},{"key":"4_CR39","unstructured":"Safavi-Naini, R., Susilo, W., Wang, H.: An efficient construction for fail-stop signature for long messages. J. Inf. Sci. Eng. 17(6), 879\u2013898 (2001). http:\/\/www.iis.sinica.edu.tw\/page\/jise\/2001\/200111_02.html"},{"key":"4_CR40","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26(5), 1484\u20131509 (1997). https:\/\/doi.org\/10.1137\/S0097539795293172","DOI":"10.1137\/S0097539795293172"},{"key":"4_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1007\/978-3-319-63688-7_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"M Stevens","year":"2017","unstructured":"Stevens, M., Bursztein, E., Karpman, P., Albertini, A., Markov, Y.: The first collision for full SHA-1. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 570\u2013596. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_19"},{"issue":"8\u201310","key":"4_CR42","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1016\/j.tcs.2008.10.025","volume":"410","author":"W Susilo","year":"2009","unstructured":"Susilo, W.: Short fail-stop signature scheme based on factorization and discrete logarithm assumptions. Theor. Comput. Sci. 410(8\u201310), 736\u2013744 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR43","doi-asserted-by":"publisher","unstructured":"Susilo, W., Mu, Y.: Provably secure fail-stop signature schemes based on RSA. Int. J. Wirel. Mob. Comput. 1(1), 53\u201360 (2005). https:\/\/doi.org\/10.1504\/IJWMC.2005.008055","DOI":"10.1504\/IJWMC.2005.008055"},{"key":"4_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-36552-4_5","volume-title":"Information Security and Cryptology \u2014 ICISC 2002","author":"W Susilo","year":"2003","unstructured":"Susilo, W., Safavi-Naini, R.: An efficient fail-stop signature scheme based on factorization. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 62\u201374. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36552-4_5"},{"key":"4_CR45","doi-asserted-by":"publisher","unstructured":"Susilo, W., Safavi-Naini, R., Gysin, M., Seberry, J.: A new and efficient fail-stop signature scheme. Comput. J. 43(5), 430\u2013437 (2000). https:\/\/doi.org\/10.1093\/comjnl\/43.5.430","DOI":"10.1093\/comjnl\/43.5.430"},{"key":"4_CR46","doi-asserted-by":"publisher","unstructured":"Susilo, W., Safavi-Naini, R., Pieprzyk, J.: RSA-based fail-stop signature schemes. In: Proceedings of the 1999 International Conference on Parallel Processing Workshops, ICPPW 1999, Wakamatsu, Japan, 21\u201324 September 1999, pp. 161\u2013166. IEEE Computer Society (1999). https:\/\/doi.org\/10.1109\/ICPPW.1999.800056","DOI":"10.1109\/ICPPW.1999.800056"},{"key":"4_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/3-540-48071-4_2","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 92","author":"E van Heijst","year":"1993","unstructured":"van Heijst, E., Pedersen, T.P., Pfitzmann, B.: New constructions of fail-stop signatures and lower bounds. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 15\u201330. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48071-4_2"},{"key":"4_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/3-540-47555-9_30","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u2019 92","author":"E van Heyst","year":"1993","unstructured":"van Heyst, E., Pedersen, T.P.: How to make efficient fail-stop signatures. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 366\u2013377. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-47555-9_30"},{"key":"4_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1007\/3-540-46885-4_69","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201989","author":"M Waidner","year":"1990","unstructured":"Waidner, M., Pfitzmann, B.: The dining cryptographers in the disco: unconditional sender and recipient untraceability with computationally secure serviceability. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, p. 690. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_69"},{"key":"4_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/11535218_2","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"X Wang","year":"2005","unstructured":"Wang, X., Yin, Y.L., Yu, H.: Finding collisions in the full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 17\u201336. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11535218_2"},{"key":"4_CR51","unstructured":"Wikipedia contributors: Flame (malware) \u2014 Wikipedia, the free encyclopedia (2022). https:\/\/en.wikipedia.org\/w\/index.php?title=Flame_(malware)&oldid=1121984346. Accessed 24 Jan 2023"},{"key":"4_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-319-12475-9_22","volume-title":"Provable Security","author":"T Yamakawa","year":"2014","unstructured":"Yamakawa, T., Kitajima, N., Nishide, T., Hanaoka, G., Okamoto, E.: A short fail-stop signature scheme from factoring. In: Chow, S.S.M., Liu, J.K., Hui, L.C.K., Yiu, S.M. (eds.) ProvSec 2014. LNCS, vol. 8782, pp. 309\u2013316. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-12475-9_22"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68376-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T21:02:41Z","timestamp":1723755761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68376-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683756","9783031683763"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68376-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}