{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:18:23Z","timestamp":1743139103952,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031547690"},{"type":"electronic","value":"9783031547706"}],"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-54770-6_1","type":"book-chapter","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T09:03:42Z","timestamp":1709197422000},"page":"3-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["CryptoZoo: A Viewer for\u00a0Reduction Proofs"],"prefix":"10.1007","author":[{"given":"Chris","family":"Brzuska","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Egger","sequence":"additional","affiliation":[]},{"given":"Kirthivaasan","family":"Puniamurthy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,1]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Abate, C., et al.: SSProve: a foundational framework for modular cryptographic proofs in coq. In: K\u00fcsters, R., Naumann, D., (eds.) CSF 2021 Computer Security Foundations Symposium, pp. 1\u201315. IEEE Computer Society Press (2021)","DOI":"10.1109\/CSF51468.2021.00048"},{"key":"1_CR2","series-title":"Part I, volume 8269 of LNCS","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-42033-7_16","volume-title":"ASIACRYPT 2013","author":"P Baecher","year":"2013","unstructured":"Baecher, P., Brzuska, C., Fischlin, M.: Notions of black-box reductions, revisited. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. Part I, volume 8269 of LNCS, pp. 296\u2013315. Springer, Heidelberg (2013)"},{"key":"1_CR3","volume-title":"TreeKEM: Asynchronous Decentralized Key Management for Large Dynamic Groups A protocol proposal for Messaging Layer Security (MLS)","author":"K Bhargavan","year":"2018","unstructured":"Bhargavan, K., Barnes, R., Rescorla, E.: TreeKEM: Asynchronous Decentralized Key Management for Large Dynamic Groups A protocol proposal for Messaging Layer Security (MLS). Research report, Inria Paris (2018)"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Brzuska, C., Cornelissen, E., Kohbrok, K.: Security analysis of the MLS key derivation. In: 2022 IEEE Symposium on Security and Privacy, pp. 2535\u20132553. IEEE Computer Society Press (2022)","DOI":"10.1109\/SP46214.2022.9833678"},{"key":"1_CR5","series-title":"Part I, volume 13791 of LNCS","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/978-3-031-22963-3_21","volume-title":"ASIACRYPT 2022","author":"C Brzuska","year":"2022","unstructured":"Brzuska, C., Delignat-Lavaud, A., Egger, C., Fournet, C., Kohbrok, K., Kohlweiss, M.: Key-schedule security for the TLS 1.3 standard. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. Part I, volume 13791 of LNCS, pp. 621\u2013650. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_21"},{"key":"1_CR6","series-title":"Part III, volume 11274 of LNCS","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-030-03332-3_9","volume-title":"ASIACRYPT 2018","author":"C Brzuska","year":"2018","unstructured":"Brzuska, C., Delignat-Lavaud, A., Fournet, C., Kohbrok, K., Kohlweiss, M.: State separation for code-based game-playing proofs. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. Part III, volume 11274 of LNCS, pp. 222\u2013249. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_9"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-10082-1_6","volume-title":"Foundations of Security Analysis and Design VII","author":"G Barthe","year":"2014","unstructured":"Barthe, G., Dupressoir, F., Gr\u00e9goire, B., Kunz, C., Schmidt, B., Strub, P.-Y.: EasyCrypt: a tutorial. In: Aldini, A., Lopez, J., Martinelli, F. (eds.) FOSAD 2012-2013. LNCS, vol. 8604, pp. 146\u2013166. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10082-1_6"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-22792-9_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"G Barthe","year":"2011","unstructured":"Barthe, G., Gr\u00e9goire, B., Heraud, S., B\u00e9guelin, S.Z.: Computer-aided security proofs for the working cryptographer. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 71\u201390. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_5"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: Yu, T., Danezis, G., Gligor, V.D., (eds.) ACM CCS 2012, pp. 784\u2013796. ACM Press (2012)","DOI":"10.1145\/2382196.2382279"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Barnes, R., Millican, J., Omara, E., Cohn-Gordon, K., Robert, R.: The Messaging Layer Security (MLS) Protocol. RFC 9420 (2023)","DOI":"10.17487\/RFC9420"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Brzuska, C., Oechsner, S.: A state-separating proof for yao\u2019s garbling scheme. In: 2023 IEEE 36th Computer Security Foundations Symposium (CSF) (CSF), pp. 127\u2013142. IEEE Computer Society, Los Alamitos, CA, USA (2023)","DOI":"10.1109\/CSF57540.2023.00009"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework\u00a0for\u00a0code-based\u00a0game-playing\u00a0proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 409\u2013426. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11761679_25"},{"key":"1_CR13","unstructured":"B\u00fclow, N.: Proof visualization for the lean 4 theorem prover (2022)"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: 42nd FOCS, pp. 136\u2013145. IEEE Computer Society Press (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.jvlc.2007.05.001","volume":"19","author":"G Cattaneo","year":"2008","unstructured":"Cattaneo, G., De Santis, A., Petrillo, U.F.: Visualization of cryptographic protocols with grace. J. Vis. Lang. Comput. 19(2), 258\u2013290 (2008)","journal-title":"J. Vis. Lang. Comput."},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Carmer, B., Rosulek, M.: Vamonos: embeddable visualizations of advanced algorithms. In: 2015 IEEE Frontiers in Education Conference (FIE), pp. 1\u20138 (2015)","DOI":"10.1109\/FIE.2015.7344263"},{"key":"1_CR17","doi-asserted-by":"publisher","unstructured":"Davis, H., Diemert, D., G\u00fcnther, F., Jager, T.: On the concrete security of TLS 1.3 PSK mode. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2022. EUROCRYPT 2022. Lecture Notes in Computer Science, vol. 13276, pp. 876\u2013906. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_30","DOI":"10.1007\/978-3-031-07085-3_30"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-030-03332-3_19","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"JP Degabriele","year":"2018","unstructured":"Degabriele, J.P., Fischlin, M.: Simulatable Channels: extended security that is universally composable and easier to prove. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 519\u2013550. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_19"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Degabriele, J.P., Govinden, J., G\u00fcnther, F., Paterson, K.G.: The security of ChaCha20-Poly1305 in the multi-user setting. In: Vigna, G., Shi, E., (eds.) ACM CCS 2021, pp. 1981\u20132003. ACM Press (2021)","DOI":"10.1145\/3460120.3484814"},{"key":"1_CR20","series-title":"Part I, volume 13940 of LNCS","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-031-31368-4_3","volume-title":"PKC 2023","author":"J Duman","year":"2023","unstructured":"Duman, J., H\u00f6velmanns, K., Kiltz, E., Lyubashevsky, V., Seiler, G., Unruh, D.: A thorough treatment of highly-efficient NTRU instantiations. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023. Part I, volume 13940 of LNCS, pp. 65\u201394. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_3"},{"key":"1_CR21","series-title":"Part III, volume 13793 of LNCS","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-031-22969-5_5","volume-title":"ASIACRYPT 2022","author":"B Dowling","year":"2022","unstructured":"Dowling, B., Hauck, E., Riepel, D., R\u00f6sler, P.: Strongly anonymous ratcheted key exchange. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. Part III, volume 13793 of LNCS, pp. 119\u2013150. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22969-5_5"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Dupressoir, F., Kohbrok, K., Oechsner, S.: Bringing state-separating proofs to EasyCrypt a security proof for cryptobox. In: CSF 2022 Computer Security Foundations Symposium, pp. 227\u2013242. IEEE Computer Society Press (2022)","DOI":"10.1109\/CSF54842.2022.9919671"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-319-21401-6_26","volume-title":"Automated Deduction - CADE-25","author":"L de Moura","year":"2015","unstructured":"de Moura, L., Kong, S., Avigad, J., van Doorn, F., von Raumer, J.: the lean theorem prover (system description). In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 378\u2013388. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21401-6_26"},{"key":"1_CR24","unstructured":"Egger, C.: On abstraction and modularization in protocol analysis, Doctoral thesis, Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (FAU) (2023)"},{"key":"1_CR25","unstructured":"Elmqvist, N.: Protoviz: a simple security protocol visualization, Tech. Rep., University of Gothenburg (2004)"},{"issue":"4","key":"1_CR26","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"1_CR27","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, UK (2004)"},{"key":"1_CR28","unstructured":"Kohbrok, K.: State-separating proofs and their applications, Doctoral thesis, Aalto University School of Science (2023)"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-27375-9_3","volume-title":"Theory of Security and Applications","author":"U Maurer","year":"2012","unstructured":"Maurer, U.: Constructive cryptography \u2013 a new paradigm for security definitions and proofs. In: M\u00f6dersheim, S., Palamidessi, C. (eds.) TOSCA 2011. LNCS, vol. 6993, pp. 33\u201356. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27375-9_3"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Pit-Claudel, C.: Untangling mechanized proofs. In: L\u00e4mmel, R., Tratt, L., de Lara, J., (eds.) Proceedings of the 13th ACM SIGPLAN International Conference on Software Language Engineering, SLE 2020, Virtual Event, USA, November 16\u201317, 2020, pp. 155\u2013174. ACM (2020)","DOI":"10.1145\/3426425.3426940"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Rescorla, E.: The Transport Layer Security (TLS) Protocol Version 1.3. RFC 8446 (2018)","DOI":"10.17487\/RFC8446"},{"key":"1_CR32","unstructured":"Rosulek, M.: The joy of cryptography. Oregon State University (2021)"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 1\u201320. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_1"},{"key":"1_CR34","unstructured":"Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004\/332 (2004). https:\/\/eprint.iacr.org\/2004\/332"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Schmidt, B., Meier, S., Cremers, C.J.F., Basin, D.A.: Automated analysis of diffie-hellman protocols and advanced security properties. In: Zdancewic, S., Cortier, V., (eds.) CSF 2012 Computer Security Foundations Symposium, pp. 78\u201394. IEEE Computer Society Press (2012)","DOI":"10.1109\/CSF.2012.25"},{"key":"1_CR36","unstructured":"Tews, H.: Prooftrees (2023)"},{"key":"1_CR37","unstructured":"The Coq Development Team: The coq proof assistant, version 8.7.0 (2017)"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp. 162\u2013167. IEEE Computer Society Press (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54770-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:13:14Z","timestamp":1709655194000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54770-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031547690","9783031547706"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54770-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Abu Dhabi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","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":"5 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wp.nyu.edu\/acns2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"230","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4-6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}