{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T01:03:54Z","timestamp":1772240634753,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":48,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819529605","type":"print"},{"value":"9789819529612","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:00:00Z","timestamp":1760054400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T00:00:00Z","timestamp":1760054400000},"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-981-95-2961-2_5","type":"book-chapter","created":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T14:01:33Z","timestamp":1760364093000},"page":"88-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Electrum: UC Fail-Stop Server-Supported Signatures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1414-2080","authenticated-orcid":false,"given":"Nikita","family":"Snetkov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6398-3663","authenticated-orcid":false,"given":"Jelizaveta","family":"Vakarjuk","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9030-8142","authenticated-orcid":false,"given":"Peeter","family":"Laud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,10]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Alkadri, N.A., D\u00f6ttling, N., Pu, S.: Practical lattice-based distributed signatures for a small number of signers. In: P\u00f6pper, C., Batina, L. (eds.) Applied Cryptography and Network Security, pp. 376\u2013402. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-54770-6_15","DOI":"10.1007\/978-3-031-54770-6_15"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Alnahawi, N., M\u00fcller, J., Oupick\u00fd, J., Wiesmaier, A.: A comprehensive survey on post-quantum TLS. IACR Commun. Cryptol. 1(2) (2024). https:\/\/doi.org\/10.62056\/ahee0iuc","DOI":"10.62056\/ahee0iuc"},{"key":"5_CR3","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":"5_CR4","doi-asserted-by":"publisher","unstructured":"Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 390\u2013399. CCS 2006, Association for Computing Machinery, New York (2006). https:\/\/doi.org\/10.1145\/1180405.1180453","DOI":"10.1145\/1180405.1180453"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/3-540-48519-8_17","volume-title":"Fast Software Encryption","author":"M Bellare","year":"1999","unstructured":"Bellare, M., Rogaway, P.: On the construction of variable-input-length ciphers. In: Knudsen, L. (ed.) FSE 1999. LNCS, vol. 1636, pp. 231\u2013244. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48519-8_17"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-38980-1_14","volume-title":"Applied Cryptography and Network Security","author":"R Bendlin","year":"2013","unstructured":"Bendlin, R., Krehbiel, S., Peikert, C.: How to share a lattice trapdoor: threshold protocols for signatures and (H)IBE. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 218\u2013236. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_14"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s00145-023-09467-1","volume":"37","author":"DJ Bernstein","year":"2023","unstructured":"Bernstein, D.J.: Cryptographic competitions. J. Cryptol. 37(1), 7 (2023). https:\/\/doi.org\/10.1007\/s00145-023-09467-1","journal-title":"J. Cryptol."},{"key":"5_CR8","unstructured":"Bienstock, A., de\u00a0Castro, L., Escudero, D., Polychroniadou, A., Takahashi, A.: Efficient, scalable threshold ML-DSA signatures: an MPC approach. Cryptology ePrint Archive, Paper 2025\/1163 (2025). https:\/\/eprint.iacr.org\/2025\/1163"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-45760-7_9","volume-title":"Topics in Cryptology \u2014 CT-RSA 2002","author":"J Black","year":"2002","unstructured":"Black, J., Rogaway, P.: Ciphers with arbitrary finite domains. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 114\u2013130. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45760-7_9"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-96884-1_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Boneh","year":"2018","unstructured":"Boneh, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 565\u2013596. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19"},{"key":"5_CR11","unstructured":"Borin, G., Celi, S., del Pino, R., Espitau, T., Niot, G., Prest, T.: Threshold signatures reloaded: ML-DSA and enhanced raccoon with identifiable aborts. Cryptology ePrint Archive, Paper 2025\/1166 (2025). https:\/\/eprint.iacr.org\/2025\/1166"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Boschini, C., Dahari, H., Naor, M., Ronen, E.: That\u2019s not my signature! fail-stop signatures for a post-quantum world. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2024, Proceedings, Part I. Lecture Notes in Computer Science, vol. 14920, pp. 107\u2013140. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_4","DOI":"10.1007\/978-3-031-68376-3_4"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Boschini, C., Takahashi, A., Tibouchi, M.: MuSig-L: Lattice-based multi-signature with single-round online phase. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology \u2013 CRYPTO 2022, pp. 276\u2013305. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_10","DOI":"10.1007\/978-3-031-15979-4_10"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-319-66402-6_19","volume-title":"Computer Security \u2013 ESORICS 2017","author":"A Buldas","year":"2017","unstructured":"Buldas, A., Kalu, A., Laud, P., Oruaas, M.: Server-supported RSA signatures for mobile devices. In: Foley, S.N., Gollmann, D., Snekkenes, E. (eds.) ESORICS 2017. LNCS, vol. 10492, pp. 315\u2013333. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66402-6_19"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Buser, M., et al.: A survey on exotic signatures for post-quantum blockchain: challenges and research directions. ACM Comput. Surv. 55(12) (2023). https:\/\/doi.org\/10.1145\/3572771","DOI":"10.1145\/3572771"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14-17 October 2001, Las Vegas, Nevada, USA, pp. 136\u2013145. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Chairattana-Apirom, R., Tessaro, S., Zhu, C.: Partially non-interactive und lattice-based threshold signatures. In: Chung, K.M., Sasaki, Y. (eds.) Advances in Cryptology \u2013 ASIACRYPT 2024, pp. 268\u2013302. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_9","DOI":"10.1007\/978-981-96-0894-2_9"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Chen, Y.: DualMS: efficient lattice-based und multi-signature with trapdoor-free simulation. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology \u2013 CRYPTO 2023, pp. 716\u2013747. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38554-4_23","DOI":"10.1007\/978-3-031-38554-4_23"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-030-35199-1_7","volume-title":"Cryptography and Coding","author":"D Cozzo","year":"2019","unstructured":"Cozzo, D., Smart, N.P.: Sharing the LUOV: threshold post-quantum signatures. In: Albrecht, M. (ed.) IMACC 2019. LNCS, vol. 11929, pp. 128\u2013153. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35199-1_7"},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-022-09425-3","volume":"35","author":"I Damg\u00e5rd","year":"2022","unstructured":"Damg\u00e5rd, I., Orlandi, C., Takahashi, A., Tibouchi, M.: Two-round n-out-of-n and multi-signatures and trapdoor commitment from lattices. J. Cryptol. 35(2), 1\u201356 (2022). https:\/\/doi.org\/10.1007\/s00145-022-09425-3","journal-title":"J. Cryptol."},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings","author":"Y Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 307\u2013315. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34805-0_28"},{"key":"5_CR22","unstructured":"Dufka, A., Kravt\u0161enko, S., Laud, P., Snetkov, N.: Trilithium: efficient and universally composable distributed ML-DSA signing. Cryptology ePrint Archive, Paper 2025\/675 (2025). https:\/\/eprint.iacr.org\/2025\/675"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Espitau, T., Katsumata, S., Takemure, K.: Two-round threshold signature from algebraic one-more learning with errors. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO 2024, pp. 387\u2013424. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_13","DOI":"10.1007\/978-3-031-68394-7_13"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Fleischhacker, N., Herold, G., Simkin, M., Zhang, Z.: Chipmunk: better synchronized multi-signatures from lattices. In: Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, p. 386\u2013400. CCS 2023, Association for Computing Machinery, New York (2023). https:\/\/doi.org\/10.1145\/3576915.3623219","DOI":"10.1145\/3576915.3623219"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Fleischhacker, N., Simkin, M., Zhang, Z.: Squirrel: efficient synchronized multi-signatures from lattices. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, pp. 1109\u20131123. CCS 2022, Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3548606.3560655","DOI":"10.1145\/3548606.3560655"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Gur, K.D., Katz, J., Silde, T.: Two-round threshold lattice-based signatures from threshold homomorphic encryption. In: Saarinen, M.J., Smith-Tone, D. (eds.) Post-Quantum Cryptography. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-62746-0_12","DOI":"10.1007\/978-3-031-62746-0_12"},{"issue":"2","key":"5_CR27","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1515\/JMC.2008.006","volume":"2","author":"MJ Hinek","year":"2008","unstructured":"Hinek, M.J.: On the security of multi-prime RSA. J. Math. Cryptol. 2(2), 117\u2013147 (2008). https:\/\/doi.org\/10.1515\/JMC.2008.006","journal-title":"J. Math. Cryptol."},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"Jonsson, J., Kaliski, B.: Public-key cryptography standards (PKCS) #1: RSA cryptography specifications version 2.1. RFC 3447 (2003). https:\/\/doi.org\/10.17487\/RFC3447","DOI":"10.17487\/RFC3447"},{"key":"5_CR29","doi-asserted-by":"publisher","unstructured":"Katsumata, S., Reichle, M., Takemure, K.: Adaptively secure 5 round threshold signatures from MLWE\/MSIS and DL with rewinding. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology \u2013 CRYPTO 2024, pp. 459\u2013491. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_15","DOI":"10.1007\/978-3-031-68394-7_15"},{"key":"5_CR30","doi-asserted-by":"crossref","unstructured":"Lysyanskaya, A.: Security analysis of RSA-BSSA. In: Boldyreva, A., Kolesnikov, V. (eds.) Public-Key Cryptography - PKC 2023 - 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7-10, 2023, Proceedings, Part I. Lecture Notes in Computer Science, vol. 13940, pp. 251\u2013280. Springer, Cham (2023), https:\/\/doi.org\/10.1007\/978-3-031-31368-4_10","DOI":"10.1007\/978-3-031-31368-4_10"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology: Module-Lattice-Based Digital Signature Standard (2024). https:\/\/doi.org\/10.6028\/nist.fips.204","DOI":"10.6028\/nist.fips.204"},{"key":"5_CR32","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology: Module-Lattice-Based Key-Encapsulation Mechanism Standard (2024). https:\/\/doi.org\/10.6028\/nist.fips.203","DOI":"10.6028\/nist.fips.203"},{"key":"5_CR33","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology: Stateless Hash-Based Digital Signature Standard (2024). https:\/\/doi.org\/10.6028\/nist.fips.205","DOI":"10.6028\/nist.fips.205"},{"key":"5_CR34","doi-asserted-by":"publisher","unstructured":"Nomura, M., Nakamura, K.: On fail-stop signature schemes with H-EUC security. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102-A(1), 125\u2013147 (2019). https:\/\/doi.org\/10.1587\/TRANSFUN.E102.A.125","DOI":"10.1587\/TRANSFUN.E102.A.125"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-030-44223-1_5","volume-title":"Post-Quantum Cryptography","author":"C Paquin","year":"2020","unstructured":"Paquin, C., Stebila, D., Tamvada, G.: Benchmarking post-quantum cryptography in TLS. In: Ding, J., Tillich, J.-P. (eds.) PQCrypto 2020. LNCS, vol. 12100, pp. 72\u201391. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44223-1_5"},{"issue":"2","key":"5_CR36","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1137\/S009753979324557X","volume":"26","author":"TP Pedersen","year":"1997","unstructured":"Pedersen, T.P., Pfitzmann, B.: Fail-stop signatures. SIAM J. Comput. 26(2), 291\u2013330 (1997). https:\/\/doi.org\/10.1137\/S009753979324557X","journal-title":"SIAM J. Comput."},{"key":"5_CR37","doi-asserted-by":"publisher","unstructured":"Pfitzmann, B.: Digital Signature Schemes. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/bfb0024619","DOI":"10.1007\/bfb0024619"},{"key":"5_CR38","unstructured":"Pfitzmann, B., Waidner, M.: Formal Aspects of Fail-Stop Signatures, vol.\u00a022. Univ., Fak. f\u00fcr Informatik (1990)"},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: 2001 IEEE Symposium on Security and Privacy, Oakland, California, USA May 14-16, 2001, pp. 184\u2013200. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/SECPRI.2001.924298","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"5_CR40","unstructured":"del Pino, R., Espitau, T., Niot, G., Prest, T.: Simple and efficient lattice threshold signatures with identifiable aborts. Cryptology ePrint Archive, Paper 2025\/871 (2025). https:\/\/eprint.iacr.org\/2025\/871"},{"key":"5_CR41","doi-asserted-by":"publisher","unstructured":"del Pino, R., Katsumata, S., Maller, M., Mouhartem, F., Prest, T., Saarinen, M.J.: Threshold raccoon: practical threshold signatures from standard lattice assumptions. In: Joye, M., Leander, G. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2024, pp. 219\u2013248. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-58723-8_8","DOI":"10.1007\/978-3-031-58723-8_8"},{"key":"5_CR42","doi-asserted-by":"publisher","unstructured":"del Pino, R., Niot, G.: Finally! a compact lattice-based threshold signature. In: Jager, T., Pan, J. (eds.) Public-Key Cryptography \u2013 PKC 2025, pp. 169\u2013199. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-91826-1_6","DOI":"10.1007\/978-3-031-91826-1_6"},{"issue":"1","key":"5_CR43","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/s10791-024-09449-2","volume":"27","author":"N Snetkov","year":"2024","unstructured":"Snetkov, N., Vakarjuk, J., Laud, P.: TOPCOAT: towards practical two-party Crystals-Dilithium. Discov. Comput. 27(1), 18 (2024). https:\/\/doi.org\/10.1007\/s10791-024-09449-2","journal-title":"Discov. Comput."},{"key":"5_CR44","doi-asserted-by":"crossref","unstructured":"Snetkov, N., Vakarjuk, J., Laud, P.: Universally composable server-supported signatures for smartphones. Cryptology ePrint Archive, Paper 2024\/1941 (2024). https:\/\/eprint.iacr.org\/2024\/1941","DOI":"10.2139\/ssrn.5060104"},{"key":"5_CR45","doi-asserted-by":"crossref","unstructured":"Snetkov, N., Vakarjuk, J., Laud, P.: Electrum: UC fail-stop server-supported signatures. Cryptology ePrint Archive, Paper 2025\/1337 (2025). https:\/\/eprint.iacr.org\/2025\/1337","DOI":"10.1007\/978-981-95-2961-2_5"},{"key":"5_CR46","doi-asserted-by":"publisher","first-page":"4173","DOI":"10.1109\/TIFS.2023.3293408","volume":"18","author":"G Tang","year":"2023","unstructured":"Tang, G., Pang, B., Chen, L., Zhang, Z.: Efficient lattice-based threshold signatures with functional interchangeability. IEEE Trans. Inf. Forensics Secur. 18, 4173\u20134187 (2023). https:\/\/doi.org\/10.1109\/TIFS.2023.3293408","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"5_CR47","doi-asserted-by":"publisher","unstructured":"Vakarjuk, J., Snetkov, N., Laud, P.: Identifying obstacles of PQC migration in E-Estonia. In: 2024 16th International Conference on Cyber Conflict: Over the Horizon (CyCon), pp. 63\u201381 (2024). https:\/\/doi.org\/10.23919\/CyCon62501.2024.10685570","DOI":"10.23919\/CyCon62501.2024.10685570"},{"key":"5_CR48","doi-asserted-by":"publisher","unstructured":"Yaksetig, M.: Extremely simple fail-stop ECDSA signatures. In: Andreoni, M. (ed.) Applied Cryptography and Network Security Workshops, pp. 230\u2013234. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-61489-7_20","DOI":"10.1007\/978-3-031-61489-7_20"}],"container-title":["Lecture Notes in Computer Science","Provable and Practical Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-2961-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T12:47:48Z","timestamp":1772196468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-2961-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,10]]},"ISBN":["9789819529605","9789819529612"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-2961-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,10]]},"assertion":[{"value":"10 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yokohama","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sulab-sever.u-aizu.ac.jp\/provsec2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}