{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T08:11:50Z","timestamp":1785831110619,"version":"3.56.0"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032267337","type":"print"},{"value":"9783032267344","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-26734-4_12","type":"book-chapter","created":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T16:24:42Z","timestamp":1779467082000},"page":"355-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Two-Round 2PC ECDSA at\u00a0the\u00a0Cost of\u00a01 OLE: Applications to\u00a0Embedded Cryptocurrency Wallets"],"prefix":"10.1007","author":[{"given":"Michael","family":"Adjedj","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Constantin","family":"Blokh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Geoffroy","family":"Couteau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arik","family":"Galansky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antoine","family":"Joux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikolaos","family":"Makriyannis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,23]]},"reference":[{"key":"12_CR1","unstructured":"Adjedj, M., Blokh, C., Couteau, G., Galansky, A., Joux, A., Makriyannis, N.: Two-Round 2PC ECDSA at the Cost of 1 OLE. Cryptology ePrint Archive, Paper 2024\/1950 (2024). https:\/\/eprint.iacr.org\/2024\/1950"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Barker, E.: Recommendation for Key Management: Part 1 \u2013 General. NIST Special Publication 800-57 Part 1 Rev. 5. National Institute of Standards and Technology (2020). https:\/\/doi.org\/10.6028\/NIST.SP.800-57pt1r5","DOI":"10.6028\/NIST.SP.800-57pt1r5"},{"key":"12_CR3","unstructured":"Blokh, C., Makriyannis, N., Peled, U.: Efficient Asymmetric Threshold ECDSA for MPC-based Cold Storage. Cryptology ePrint Archive, Report 2022\/1296 (2022). https:\/\/eprint.iacr.org\/2022\/1296"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 41\u201355. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_3"},{"key":"12_CR5","unstructured":"Boneh, D., Haitner, I., Lindell, Y., Segev, G.: Exponent-VRFs and Their Applications. Cryptology ePrint Archive, Paper 2024\/397 (2024). https:\/\/eprint.iacr.org\/2024\/397"},{"key":"12_CR6","unstructured":"Boneh, D., Haitner, I., Lindell, Y., Segev, G.: Presentation of \u201cExponent-VRFs and Their Applications\u201d. Talk at Eurocrypt 2025, May 2025. https:\/\/iacr.org\/submit\/files\/slides\/2025\/eurocrypt\/eurocrypt2025\/365\/365_slides.pptx"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., Haitner, I., Lindell, Y., Segev, G.: Private communication regarding \u201cExponent-VRFs and Their Applications\u201d. Personal Communication, May 2025","DOI":"10.1007\/978-3-031-91098-2_8"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Brand\u00e3o, L.T.A.N., Peralta, R.: NIST first call for multi-party threshold schemes. Technical report NIST IR 8214C (Initial Public Draft). Public comment period closed on April 10, 2023. National Institute of Standards and Technology (2023). https:\/\/doi.org\/10.6028\/NIST.IR.8214C.ipd","DOI":"10.6028\/NIST.IR.8214C.ipd"},{"key":"12_CR9","unstructured":"Brown, D.R.L.: Generic Groups, Collision Resistance, and ECDSA. Contributions to IEEE P1363a. Updated version for \u201cThe Exact Security of ECDSA (2002). http:\/\/grouper.ieee.org\/groups\/1363\/"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Brown, D.R.L.: Generic groups, collision resistance, and ECDSA. In: DCC, vol. 35, no. 1, pp. 119\u2013152 (2005). https:\/\/doi.org\/10.1007\/s10623-003-6154-z","DOI":"10.1007\/s10623-003-6154-z"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"B\u00fcnz, B., Bootle, J., Boneh, D., Poelstra, A., Wuille, P., Maxwell, G.: Bulletproofs: short proofs for confidential transactions and more. In: 2018 IEEE Symposium on Security and Privacy, pp. 315\u2013334. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/SP.2018.00020","DOI":"10.1109\/SP.2018.00020"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Canetti, R., Gennaro, R., Goldfeder, S., Makriyannis, N., Peled, U.: UC non-interactive, proactive, threshold ECDSA with identifiable aborts. In: Ligatti, J., Ou, X., Katz, J., Vigna, G. (eds.) ACM CCS 2020, pp. 1769\u2013 1787. ACM Press (2020). https:\/\/doi.org\/10.1145\/3372297.3423367","DOI":"10.1145\/3372297.3423367"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-78372-7_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"P Chaidos","year":"2018","unstructured":"Chaidos, P., Couteau, G.: Efficient designated-verifier non-interactive zero-knowledge proofs of knowledge. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10822, pp. 193\u2013221. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78372-7_7"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Couteau, G., Goudarzi, D., Kloo\u00df, M., Reichle, M.: Sharp: short relaxed range proofs. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) ACM CCS 2022, pp. 609\u2013622. ACM Press (2022). https:\/\/doi.org\/10.1145\/3548606.3560628","DOI":"10.1145\/3548606.3560628"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-77883-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"G Couteau","year":"2021","unstructured":"Couteau, G., Kloo\u00df, M., Lin, H., Reichle, M.: Efficient range proofs with transparent setup from bounded integer commitments. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 247\u2013277. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_9"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-319-56614-6_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"G Couteau","year":"2017","unstructured":"Couteau, G., Peters, T., Pointcheval, D.: Removing the strong RSA assumption from arguments over the integers. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 321\u2013350. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_11"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-36178-2_8","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"I Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 125\u2013142. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_8"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Secure Twoparty Threshold ECDSA from ECDSA Assumptions. Cryptology ePrint Archive, Report 2018\/499 (2018). https:\/\/eprint.iacr.org\/2018\/499","DOI":"10.1109\/SP.2018.00036"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Secure twoparty threshold ECDSA from ECDSA assumptions. In: 2018 IEEE Symposium on Security and Privacy, pp. 980\u2013997. IEEE Computer Society Press (2018). https:\/\/doi.org\/10.1109\/SP.2018.00036","DOI":"10.1109\/SP.2018.00036"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Threshold ECDSA from ECDSA assumptions: the multiparty case. In: 2019 IEEE Symposium on Security and Privacy, pp. 1051\u20131066. IEEE Computer Society Press (2019). https:\/\/doi.org\/10.1109\/SP.2019.00024","DOI":"10.1109\/SP.2019.00024"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Doerner, J., Kondi, Y., Lee, E., Shelat, A.: Threshold ECDSA in three rounds. In: 2024 IEEE Symposium on Security and Privacy, pp. 3053\u20133071. IEEE Computer Society Press (2024). https:\/\/doi.org\/10.1109\/SP54263.2024.00178","DOI":"10.1109\/SP54263.2024.00178"},{"key":"12_CR22","unstructured":"Fireblocks. https:\/\/www.fireblocks.com\/"},{"key":"12_CR23","unstructured":"Fordefi. https:\/\/fordefi.com\/"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/BFb0052225","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"E Fujisaki","year":"1997","unstructured":"Fujisaki, E., Okamoto, T.: Statistical zero knowledge protocols to prove modular polynomial relations. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 16\u201330. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052225"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/3-540-44598-6_29","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"R Gennaro","year":"2000","unstructured":"Gennaro, R.: An improved pseudo-random generator based on discrete log. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 469\u2013481. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_29"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Goldfeder, S.: Fast multiparty threshold ECDSA with fast trustless setup. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 1179\u20131194. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243859","DOI":"10.1145\/3243734.3243859"},{"issue":"2","key":"12_CR27","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"key":"12_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-031-06944-4_13","volume-title":"EUROCRYPT 2022, Part I","author":"J Groth","year":"2022","unstructured":"Groth, J., Shoup, V.: On the security of ECDSA with additive key derivation and presignatures. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part I. LNCS, vol. 13275, pp. 365\u2013396. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_13"},{"key":"12_CR29","unstructured":"Haitner, I., Lindell, Y., Makriyannis, N.: Integer Commitments, Old and New Tools. Cryptology ePrint Archive, Paper 2025\/081 (2025). https:\/\/eprint.iacr.org\/2025\/081"},{"key":"12_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-319-78375-8_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Hohenberger","year":"2018","unstructured":"Hohenberger, S., Waters, B.: Synchronized aggregate signatures from the RSA assumption. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 197\u2013229. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_7"},{"key":"12_CR31","unstructured":"Apple Inc. Local and Remote Notification Programming Guide (2016). https:\/\/developer.apple.com\/library\/archive\/documentation\/NetworkingInternet\/Conceptual\/RemoteNotificationsPG\/. Apple Push Notification payloads are limited to 4096 bytes (4 KB)"},{"key":"12_CR32","unstructured":"Information technology \u2013 Automatic identification and data capture techniques \u2013 QR Code bar code symbology specification. ISO\/IEC 18004:2024.Geneva, Switzerland: International Organization for Standardization (2024)"},{"key":"12_CR33","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-031-68376-3_7","volume-title":"CRYPTO 2024","author":"J Kastner","year":"2024","unstructured":"Kastner, J., Nguyen, K., Reichle, M.: Pairing-free blind signatures from standard assumptions in the ROM. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14920, pp. 210\u2013245. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68376-3_7"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-24632-9_13","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"T Koshiba","year":"2004","unstructured":"Koshiba, T., Kurosawa, K.: Short exponent Diffie-Hellman problems. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 173\u2013186. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24632-9_13"},{"key":"12_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-3-319-63715-0_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"Y Lindell","year":"2017","unstructured":"Lindell, Y.: Fast secure two-party ECDSA signing. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 613\u2013644. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_21"},{"key":"12_CR36","doi-asserted-by":"publisher","unstructured":"Lindell, Y., Nof, A.: Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) ACM CCS 2018, pp. 1837\u20131854. ACM Press (2018). https:\/\/doi.org\/10.1145\/3243734.3243788","DOI":"10.1145\/3243734.3243788"},{"key":"12_CR37","doi-asserted-by":"publisher","unstructured":"Lyu, Y., Li, Z., Zhou, H.-S., Deng, X.: Threshold ECDSA in Two Rounds. Cryptology ePrint Archive, Paper 2025\/1696 (2025). https:\/\/doi.org\/10.1145\/3719027.3765176. https:\/\/eprint.iacrorg\/2025\/1696","DOI":"10.1145\/3719027.3765176"},{"key":"12_CR38","unstructured":"Makriyannis, N., Yomtov, O., Galansky, A.: Practical Key-Extraction Attacks in Leading MPC Wallets. Cryptology ePrint Archive, Report 2023\/1234 (2023). https:\/\/eprint.iacr.org\/2023\/1234"},{"key":"12_CR39","unstructured":"NeuCrypt. mpecdsa (2018). https:\/\/gitlab.com\/neucrypt\/mpecdsa"},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"Pollard, J.M.: Theorems on factorization and primality testing. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 76.3, pp. 521\u2013528. Cambridge University Press (1974)","DOI":"10.1017\/S0305004100049252"},{"key":"12_CR41","doi-asserted-by":"publisher","unstructured":"Schnorr, C.-P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161\u2013174 (1991). https:\/\/doi.org\/10.1007\/BF00196725","DOI":"10.1007\/BF00196725"},{"key":"12_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"12_CR43","unstructured":"Silence Laboratories. silent-shard-dkls-23-ll (2023). https:\/\/github.com\/silence-laboratories\/silent-shard-dkls23-ll"},{"key":"12_CR44","unstructured":"Sodot. https:\/\/www.sodot.dev\/"},{"key":"12_CR45","unstructured":"Unbound Security. blockchain-crypto-mpc (2019). https:\/\/github.com\/unboundsecurity\/blockchain-crypto-mpc"},{"key":"12_CR46","unstructured":"Utila. https:\/\/utila.io\/"},{"key":"12_CR47","doi-asserted-by":"publisher","unstructured":"Xue, H., et al.: Efficient multiplicativeto- additive function from Joye-Libert cryptosystem and its application to threshold ECDSA. In: Meng, W., Jensen, C.D., Cremers, C., Kirda, E. (eds.) ACM CCS 2023, pp. 2974\u20132988. ACM Press (2023). https:\/\/doi.org\/10.1145\/3576915.3616595","DOI":"10.1145\/3576915.3616595"},{"key":"12_CR48","doi-asserted-by":"publisher","unstructured":"Xue, H., Au, M.H., Xie, X., Yuen, T.H., Cui, H.: Efficient online-friendly two-party ECDSA signature. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 558\u2013573. ACM Press (2021). https:\/\/doi.org\/10.1145\/3460120.3484803","DOI":"10.1145\/3460120.3484803"},{"key":"12_CR49","unstructured":"Zengo. https:\/\/zengo.com\/"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-26734-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,22]],"date-time":"2026-05-22T16:24:47Z","timestamp":1779467087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-26734-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032267337","9783032267344"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-26734-4_12","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":"23 May 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":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"West Palm Beach, FL","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pkc.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}