{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T01:51:59Z","timestamp":1773193919452,"version":"3.50.1"},"publisher-location":"Cham","reference-count":70,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031710698","type":"print"},{"value":"9783031710704","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-71070-4_3","type":"book-chapter","created":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:02:41Z","timestamp":1725897761000},"page":"46-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["zk-Bench: A Toolset for\u00a0Comparative Evaluation and\u00a0Performance Benchmarking of\u00a0SNARKs"],"prefix":"10.1007","author":[{"given":"Jens","family":"Ernstberger","sequence":"first","affiliation":[]},{"given":"Stefanos","family":"Chaliasos","sequence":"additional","affiliation":[]},{"given":"George","family":"Kadianakis","sequence":"additional","affiliation":[]},{"given":"Sebastian","family":"Steinhorst","sequence":"additional","affiliation":[]},{"given":"Philipp","family":"Jovanovic","sequence":"additional","affiliation":[]},{"given":"Arthur","family":"Gervais","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Livshits","sequence":"additional","affiliation":[]},{"given":"Michele","family":"Orr\u00f9","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,10]]},"reference":[{"key":"3_CR1","unstructured":"zk-Harness: A Benchmarking Framework for SNARKs, 2023. https:\/\/github.com\/zkCollective\/zk-Harness"},{"key":"3_CR2","unstructured":"Mohammad\u00a0Bagher Abiat. Tinybench, 2023. https:\/\/github.com\/tinylibs\/tinybench"},{"key":"3_CR3","unstructured":"Anoma. Zkp (circuit) compiler shootout, 2023. https:\/\/github.com\/anoma\/zkp-compiler-shootout"},{"key":"3_CR4","unstructured":"arkworks contributors. arkworks zksnark ecosystem, 2022. https:\/\/arkworks.rs"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Baghery, K., Mertens, A., Sedaghat, M.: Benchmarking the setup of updatable Zk-SNARKs. In: Aly, A., Tibouchi, M. (eds.) Progress in Cryptology \u2013 LATINCRYPT 2023. LATINCRYPT 2023. LNCS, vol. 14168, pp. 375\u2013396. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-44469-2_19","DOI":"10.1007\/978-3-031-44469-2_19"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1007\/s00145-018-9280-5","volume":"32","author":"R Barbulescu","year":"2019","unstructured":"Barbulescu, R., Duquesne, S.: Updating key size estimations for pairings. J. Cryptol. 32, 1298\u20131336 (2019)","journal-title":"J. Cryptol."},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-36413-7_19","volume-title":"Security in Communication Networks","author":"PSLM Barreto","year":"2003","unstructured":"Barreto, P.S.L.M., Lynn, B., Scott, M.: Constructing elliptic curves with prescribed embedding degrees. In: Cimato, S., Persiano, G., Galdi, C. (eds.) SCN 2002. LNCS, vol. 2576, pp. 257\u2013267. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36413-7_19"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11693383_22"},{"key":"3_CR9","unstructured":"Ben-Sasson, E.: libstark, 2018. https:\/\/github.com\/elibensasson\/libSTARK"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-030-26954-8_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"E Ben-Sasson","year":"2019","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable zero knowledge with no trusted setup. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 701\u2013732. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_23"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-40084-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"E Ben-Sasson","year":"2013","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: SNARKs for C: verifying program executions succinctly and in zero knowledge. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 90\u2013108. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_6"},{"key":"3_CR12","unstructured":"Benarroch, D., Nicolas, A., Thaler, J., Tromer, E.: Community proposal: a benchmarking framework for (zero-knowledge) proof systems. QEDIT, Tel Aviv-Yafo, Israel, Technical report (2020)"},{"key":"3_CR13","unstructured":"Bernstein, D.J.: Pippenger\u2019s exponentiation algorithm (2002). Preprint. http:\/\/cryp.to\/papers.html"},{"key":"3_CR14","unstructured":"bheisler. Rust criterion, 2023. https:\/\/bheisler.github.io\/criterion.rs\/book\/index.html"},{"issue":"4","key":"3_CR15","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00145-016-9241-9","volume":"30","author":"N Bitansky","year":"2017","unstructured":"Bitansky, N., et al.: The hunting of the SNARK. J. Cryptol. 30(4), 989\u20131066 (2017)","journal-title":"J. Cryptol."},{"key":"3_CR16","unstructured":"Bloemen, R.: Polynomial commitment benchmark, 2023"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Bootle, J., Chiesa, A., Hu, Y., Orr\u00fa, M.: Gemini: elastic SNARKs for diverse environments. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2022. EUROCRYPT 2022. LNCS, vol. 13276, pp. 427\u2013457. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_15","DOI":"10.1007\/978-3-031-07085-3_15"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Botrel, G., El Housni, Y.: Faster Montgomery multiplication and multi-scalar-multiplication for SNARKs. IACR Trans. Cryptogr. Hardw. Embed. Syst. 504\u2013521 (2023)","DOI":"10.46586\/tches.v2023.i3.504-521"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Botrel, G., Piellard, T., Housni, Y.E., Kubjas, I., Tabaie, A.: Consensys\/gnark: v0.8.0, February 2023. https:\/\/doi.org\/10.5281\/zenodo.5819104","DOI":"10.5281\/zenodo.5819104"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Campanelli, M., Gailly, N., Gennaro, R., Jovanovic, P., Mihali, M., Thaler, J.: Testudo: linear time prover SNARKs with constant size proofs and square root size universal setup. In: Aly, A., Tibouchi, M. (eds.) Progress in Cryptology \u2013 LATINCRYPT 2023. LATINCRYPT 2023. LNCS, vol. 14168, pp. 331\u2013351. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-44469-2_17","DOI":"10.1007\/978-3-031-44469-2_17"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) CRYPTO\u201982, pp. 199\u2013203. Plenum Press, New York, USA (1982)","DOI":"10.1007\/978-1-4757-0602-4_18"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201390 (1981)","DOI":"10.1145\/358549.358563"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-030-45721-1_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Chiesa","year":"2020","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 738\u2013768. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26"},{"key":"3_CR24","unstructured":"Lambda Class. lambdaworks, 2023. https:\/\/github.com\/lambdaclass\/lambdaworks"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19(90), 297\u2013301 (1965)","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"3_CR26","unstructured":"Delendum. Zk system benchmarking, 2023. https:\/\/github.com\/delendum-xyz\/zk-benchmarking"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. In: Democratizing Cryptography: The Work of Whitfield Diffie and Martin Hellman, pp. 365\u2013390 (2022)","DOI":"10.1145\/3549993.3550007"},{"key":"3_CR28","unstructured":"El Housni, Y.: Benchmarking pairing-friendly elliptic curves libraries, 2021. https:\/\/hackmd.io\/@gnark\/eccbench"},{"key":"3_CR29","unstructured":"El Housni, Y., Botrel, G.: EdMSM: Multi-Scalar-Multiplication for SNARKs and Faster Montgomery multiplication. Cryptology ePrint Archive, 2022"},{"key":"3_CR30","unstructured":"Privacy &\u00a0Scaling Explorations. halo2 community edition, 2023. https:\/\/github.com\/privacy-scaling-explorations\/halo2"},{"key":"3_CR31","unstructured":"Facebook. winterfell, 2023. https:\/\/github.com\/facebook\/winterfell"},{"key":"3_CR32","unstructured":"Filecoin. bellperson, 2023. https:\/\/github.com\/filecoin-project\/bellperson"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-030-17653-2_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"G Fuchsbauer","year":"2019","unstructured":"Fuchsbauer, G., Orr\u00f9, M., Seurin, Y.: Aggregate cash systems: a cryptographic investigation of mimblewimble. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 657\u2013689. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_22"},{"key":"3_CR34","unstructured":"Gabizon, A., Williamson, Z.J., Ciobotaru, O.: Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive, 2019"},{"key":"3_CR35","doi-asserted-by":"crossref","unstructured":"Galbraith, S.D., Paterson, K.G., Smart, N.P.: Pairings for cryptographers. Discret. Appl. Math. 156(16), 3113\u20133121 (2008)","DOI":"10.1016\/j.dam.2007.12.010"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-42045-0_16","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"R Gennaro","year":"2013","unstructured":"Gennaro, R., Wichs, D.: Fully homomorphic message authenticators. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 301\u2013320. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_16"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC \u201985, pp. 291\u2013304. Association for Computing Machinery (1985)","DOI":"10.1145\/22145.22178"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-662-49896-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"J Groth","year":"2016","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 305\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_11"},{"key":"3_CR39","unstructured":"Hopwood, D., Bowe, S., Hornby, T., Wilcox, N.: Zcash Protocol Specification. GitHub: San Francisco, CA, USA, vol. 4, p. 220 (2016)"},{"key":"3_CR40","unstructured":"iden3. snarkjs, 2021. https:\/\/github.com\/iden3\/snarkjs"},{"key":"3_CR41","unstructured":"iden3. Circom: Circuit compiler for zk proving systems, 2023. https:\/\/github.com\/iden3\/circom"},{"key":"3_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-662-53018-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"T Kim","year":"2016","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 543\u2013571. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_20"},{"key":"3_CR43","unstructured":"Kosba, A.: jsnark, 2022. https:\/\/github.com\/akosba\/jsnark"},{"key":"3_CR44","unstructured":"Matter Labs. bellman community edition, 2023. https:\/\/github.com\/matter-labs\/bellman"},{"key":"3_CR45","unstructured":"Matter Labs. Boojum, 2023. https:\/\/github.com\/matter-labs\/era-boojum"},{"key":"3_CR46","unstructured":"O1\u00a0labs. kimchi, 2023. https:\/\/github.com\/o1-labs\/proof-systems"},{"key":"3_CR47","unstructured":"O1\u00a0labs. snarky, 2023. https:\/\/github.com\/o1-labs\/snarky"},{"key":"3_CR48","unstructured":"O1\u00a0labs. snarkyjs, 2023. https:\/\/github.com\/o1-labs\/snarkyjs"},{"key":"3_CR49","doi-asserted-by":"crossref","unstructured":"Longa, P.: Efficient algorithms for large prime characteristic fields and their application to bilinear pairings. IACR Trans. Cryptogr. Hardw. Embed. Syst. 445\u2013472 (2023)","DOI":"10.46586\/tches.v2023.i3.445-472"},{"key":"3_CR50","doi-asserted-by":"crossref","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: zero-knowledge SNARKs from linear-size universal and updatable structured reference strings. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 2111\u20132128 (2019)","DOI":"10.1145\/3319535.3339817"},{"key":"3_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-61273-7_5","volume-title":"Paradigms in Cryptology \u2013 Mycrypt 2016. Malicious and Exploratory Cryptology","author":"A Menezes","year":"2017","unstructured":"Menezes, A., Sarkar, P., Singh, S.: Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography. In: Phan, R.C.-W., Yung, M. (eds.) Mycrypt 2016. LNCS, vol. 10311, pp. 83\u2013108. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61273-7_5"},{"key":"3_CR52","doi-asserted-by":"publisher","unstructured":"Menezes, A., Vanstone, S., Okamoto, T.: Reducing elliptic curve logarithms to logarithms in a finite field. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC \u201991, pp. 80\u201389, New York, NY, USA, 1991. Association for Computing Machinery (1991). https:\/\/doi.org\/10.1145\/103418.103434","DOI":"10.1145\/103418.103434"},{"key":"3_CR53","unstructured":"Celer Network. The pantheon of zero knowledge proof development frameworks (2023). https:\/\/blog.celer.network\/2023\/07\/14\/the-pantheon-of-zero-knowledge-proof-development-frameworks\/"},{"key":"3_CR54","unstructured":"European\u00a0Network of\u00a0Excellence\u00a0for Cryptology. ebats: Ecrypt benchmarking of asymmetric systems, 2006. https:\/\/www.ecrypt.eu.org\/ebats\/"},{"key":"3_CR55","unstructured":"Michele Orru and George Kadianakis. zkalc, a cryptographic calculator, 2023. https:\/\/zka.lc\/"},{"key":"3_CR56","unstructured":"Ozdemir, A., Wahby, R., Whitehat, B., Boneh, D.: Scaling verifiable computation using efficient set accumulators. In: 29th USENIX Security Symposium (USENIX Security 20), pp. 2075\u20132092 (2020)"},{"key":"3_CR57","doi-asserted-by":"publisher","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: nearly practical verifiable computation. In: 2013 IEEE Symposium on Security and Privacy, pp. 238\u2013252. IEEE Computer Society Press, May 2013. https:\/\/doi.org\/10.1109\/SP.2013.47","DOI":"10.1109\/SP.2013.47"},{"key":"3_CR58","doi-asserted-by":"crossref","unstructured":"Pereira, G.C., Simpl\u00edcio Jr, M.A., Naehrig, M., Barreto, P.S.: A family of implementation-friendly BN elliptic curves. J. Syst. Softw. 84(8), 1319\u20131326 (2011)","DOI":"10.1016\/j.jss.2011.03.083"},{"key":"3_CR59","doi-asserted-by":"publisher","unstructured":"Pippenger, N.: A formula for the determinant. CoRR, abs\/2206.00134, 2022. arXiv:2206.00134, https:\/\/doi.org\/10.48550\/arXiv.2206.00134","DOI":"10.48550\/arXiv.2206.00134"},{"key":"3_CR60","unstructured":"Plonky3. Plonky3, 2023. https:\/\/github.com\/Plonky3\/Plonky3"},{"key":"3_CR61","unstructured":"Mir Protocol. Plonky2, 2023. https:\/\/github.com\/mir-protocol\/plonky2"},{"key":"3_CR62","unstructured":"Sasson, E.B., et al.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 459\u2013474. IEEE (2014)"},{"key":"3_CR63","unstructured":"scipt lab. libsnark, 2020. https:\/\/github.com\/scipr-lab\/libsnark"},{"key":"3_CR64","unstructured":"scipt lab. libiop, 2021. https:\/\/github.com\/scipr-lab\/libiop"},{"key":"3_CR65","unstructured":"Setty, S., Thaler, J., Wahby, R.: Customizable constraint systems for succinct arguments. Cryptology ePrint Archive (2023)"},{"key":"3_CR66","unstructured":"Espresso Systems. jellyfish, 2023. https:\/\/github.com\/EspressoSystems\/jellyfish"},{"key":"3_CR67","doi-asserted-by":"publisher","unstructured":"Vesely, P., et al.: Plumo: an ultralight blockchain client. In: Eyal, I., Garay, J. (eds.) Financial Cryptography and Data Security. FC 2022. LNCS, vol. 13411, pp. 597\u2013614. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-18283-9_30","DOI":"10.1007\/978-3-031-18283-9_30"},{"key":"3_CR68","unstructured":"Washington, L.C.: Elliptic Curves: Number Theory and Cryptography. CRC Press, Boca Raton (2008)"},{"key":"3_CR69","unstructured":"ZCash. halo2, 2023. https:\/\/github.com\/zcash\/halo2"},{"key":"3_CR70","unstructured":"zkcrypto. bellman: zk-snark library, 2023. https:\/\/github.com\/zkcrypto\/bellman"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-71070-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:03:20Z","timestamp":1725897800000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-71070-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031710698","9783031710704"],"references-count":70,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-71070-4_3","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":"10 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Cryptography for Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amalfi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"11 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scn2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/scn.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}