{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T05:06:19Z","timestamp":1755839179571,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030842512"},{"type":"electronic","value":"9783030842529"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-84252-9_2","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T23:04:26Z","timestamp":1628636666000},"page":"33-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["MoSS: Modular Security Specifications Framework"],"prefix":"10.1007","author":[{"given":"Amir","family":"Herzberg","sequence":"first","affiliation":[]},{"given":"Hemi","family":"Leibowitz","sequence":"additional","affiliation":[]},{"given":"Ewa","family":"Syta","sequence":"additional","affiliation":[]},{"given":"Sara","family":"Wr\u00f3tniak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-24638-1_19","volume-title":"Theory of Cryptography","author":"M Backes","year":"2004","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A general composition theorem for secure reactive systems. In: Theory of Cryptography Conference. Springer (2004)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Barbosa, M., et al.: Sok: computer-aided cryptography. In: IEEE Symposium on Security and Privacy (2021)","DOI":"10.1109\/SP40001.2021.00008"},{"key":"2_CR3","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: Annual Cryptology Conference (2011)"},{"key":"2_CR4","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: A modular approach to the design and analysis of authentication and key exchange protocols. IACR Cryptol. ePrint Arch 1998, 9 (1998). http:\/\/eprint.iacr.org\/1998\/009"},{"key":"2_CR5","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption. In: FOCS, pp. 394\u2013403 (1997)"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1006\/jcss.1999.1694","volume":"61","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of the cipher block chaining message authentication code. J. Comput. Syst. Sci. 61(3), 362\u2013399 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-48329-2_21","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"M Bellare","year":"1994","unstructured":"Bellare, M., Rogaway, P.: Entity authentication and key distribution. In: Stinson, D.R. (ed.) Advances in Cryptology\u2013CRYPTO \u201993. Lecture Notes in Computer Science, vol. 773, pp. 232\u2013249. Springer-Verlag (22\u201326 Aug 1993)"},{"key":"2_CR8","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 for code-based game-playing proofs. In: EUROCRYPT (2006)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: A computationally sound mechanized prover for security protocols. IEEE Trans. Depend. Secure Comput. (2008)","DOI":"10.1109\/TDSC.2007.1005"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-34618-8_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"J Camenisch","year":"2019","unstructured":"Camenisch, J., Krenn, S., K\u00fcsters, R., Rausch, D.: iUC: Flexible universal composability made simple. In: EUROCRYPT (2019)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: IEEE Symposium on Foundations of Computer Science (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"5","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3402457","volume":"67","author":"R Canetti","year":"2020","unstructured":"Canetti, R.: Universally composable security. Journal of the ACM (JACM) 67(5), 1\u201394 (2020)","journal-title":"J. ACM (JACM)"},{"key":"2_CR13","unstructured":"Canetti, R., Shahaf, D., Vald, M.: Universally Composable Authentication and Key-exchange with Global PKI. Cryptology ePrint Archive, Report 2014\/432 (2014). https:\/\/eprint.iacr.org\/2014\/432"},{"key":"2_CR14","unstructured":"CCITT, B.B.: Recommendations X. 509 and ISO 9594\u20138. Information Processing Systems-OSI-The Directory Authentication Framework (Geneva: CCITT) (1988)"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1109\/MSP.2010.200","volume":"9","author":"JP Degabriele","year":"2010","unstructured":"Degabriele, J.P., Paterson, K., Watson, G.: Provable security in the real world. IEEE Security & Privacy 9(3), 33\u201341 (2010)","journal-title":"IEEE Secur. Priv."},{"issue":"4","key":"2_CR16","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. Journal of the ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption. Journal of Computer and System Sciences 28(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. (1988)","DOI":"10.1137\/0217017"},{"key":"2_CR19","unstructured":"Herzberg, A., Leibowitz, H., Syta, E., Wr\u00f3tniak, S.: Moss: modular security specifications framework - full version. Cryptology ePrint Archive, Report 2020\/1040 (2020). https:\/\/eprint.iacr.org\/2020\/1040"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Herzberg, A., Yoffe, I.: The layered games framework for specifications and analysis of security protocols. IJACT 1(2), 144\u2013159 (2008). https:\/\/www.researchgate.net\/publication\/220571819_The_layered_games_framework_for_specifications_and_analysis_of_security_protocols","DOI":"10.1504\/IJACT.2008.021087"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Hofheinz, D., Shoup, V.: GNUC: A new universal composability framework. Journal of Cryptology 28(3), 423\u2013508 (2015)","DOI":"10.1007\/s00145-013-9160-y"},{"issue":"3","key":"2_CR22","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00145-012-9127-4","volume":"26","author":"D Hofheinz","year":"2013","unstructured":"Hofheinz, D., Unruh, D., M\u00fcller-Quade, J.: Polynomial runtime and composability. Journal of Cryptology 26(3), 375\u2013441 (2013)","journal-title":"J. Cryptol."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Tuengerthal, M., Rausch, D.: The IITM model: a simple and expressive model for universal composability. J. Cryptol., 1\u2013124 (2020)","DOI":"10.1007\/s00145-020-09352-1"},{"key":"2_CR24","doi-asserted-by":"publisher","unstructured":"Laurie, B., Langley, A., Kasper, E.: Certificate Transparency. RFC 6962 (2013). https:\/\/doi.org\/10.17487\/RFC6962","DOI":"10.17487\/RFC6962"},{"key":"2_CR25","unstructured":"Leibowitz, H., Herzberg, A., Syta, E.: Provable security for PKI schemes. Cryptology ePrint Archive, Report 2019\/807 (2019). https:\/\/eprint.iacr.org\/2019\/807"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Lochbihler, A., Sefidgar, S.R., Basin, D., Maurer, U.: Formalizing constructive cryptography using crypthol. In: Computer Security Foundations (2019)","DOI":"10.1109\/CSF.2019.00018"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Maurer, U.: Constructive cryptography-a new paradigm for security definitions and proofs. In: Workshop on Theory of Security and Applications (2011)","DOI":"10.1007\/978-3-642-27375-9_3"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Meier, S., Schmidt, B., Cremers, C., Basin, D.: The TAMARIN prover for the symbolic analysis of security protocols. In: Computer Aided Verification (2013)","DOI":"10.1007\/978-3-642-39799-8_48"},{"key":"2_CR29","unstructured":"Shoup, V.: Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004\/332 (2004)"},{"key":"2_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-662-49096-9_24","volume-title":"Theory of Cryptography","author":"D Wikstr\u00f6m","year":"2016","unstructured":"Wikstr\u00f6m, Douglas: Simplified l. In: Kushilevitz, Eyal, Malkin, Tal (eds.) TCC 2016. LNCS, vol. 9562, pp. 566\u2013595. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_24"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-84252-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:07:19Z","timestamp":1723334839000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84252-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030842512","9783030842529"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84252-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 August 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2021\/","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":"426","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":"103","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":"24% - 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":"3","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":"20.9","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)"}},{"value":"1 invited paper is also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}