{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:31:38Z","timestamp":1743132698142,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030884277"},{"type":"electronic","value":"9783030884284"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88428-4_14","type":"book-chapter","created":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T06:03:11Z","timestamp":1633068191000},"page":"275-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Moving the Bar on Computationally Sound Exclusive-Or"],"prefix":"10.1007","author":[{"given":"Catherine","family":"Meadows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,2]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of POPL 2001, pp. 104\u2013115. ACM (2001)","DOI":"10.1145\/373243.360213"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/3-540-44929-9_1","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"M Abadi","year":"2000","unstructured":"Abadi, M., Rogaway, P.: Reconciling two views of cryptography. In: van Leeuwen, J., Watanabe, O., Hagiya, M., Mosses, P.D., Ito, T. (eds.) TCS 2000. LNCS, vol. 1872, pp. 3\u201322. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44929-9_1"},{"key":"14_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24597-1_1","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"M Backes","year":"2003","unstructured":"Backes, M., Pfitzmann, B.: A cryptographically sound security proof of the Needham-Schroeder-Lowe public-key protocol. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol. 2914, pp. 1\u201312. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24597-1_1"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-77272-9_9","volume-title":"Cryptography and Coding","author":"GV Bard","year":"2007","unstructured":"Bard, G.V.: Blockwise-adaptive chosen-plaintext attack and online modes of encryption. In: Galbraith, S.D. (ed.) Cryptography and Coding 2007. LNCS, vol. 4887, pp. 129\u2013151. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77272-9_9"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Barthe, G., et al.: Fully automated analysis of padding-based encryption in the computational model. In: ACM Conference on Computer and Communications Security (2013)","DOI":"10.1145\/2508859.2516663"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/11523468_53","volume-title":"Automata, Languages and Programming","author":"M Baudet","year":"2005","unstructured":"Baudet, M., Cortier, V., Kremer, S.: Computationally sound implementations of equational theories against passive adversaries. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 652\u2013663. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_53"},{"key":"14_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\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":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-74143-5_27","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"E Bresson","year":"2007","unstructured":"Bresson, E., Lakhnech, Y., Mazar\u00e9, L., Warinschi, B.: A generalization of DDH with applications to protocol analysis and computational soundness. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 482\u2013499. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_27"},{"issue":"6","key":"14_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1109\/MCOM.1978.1089775","volume":"16","author":"C Campbell","year":"1978","unstructured":"Campbell, C.: Design and specification of cryptographic capabilities. IEEE Commun. Soc. Mag. 16(6), 15\u201319 (1978)","journal-title":"IEEE Commun. Soc. Mag."},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-662-53015-3_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"B Carmer","year":"2016","unstructured":"Carmer, B., Rosulek, M.: Linicrypt: a model for practical cryptography. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 416\u2013445. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_15"},{"issue":"2","key":"14_CR12","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.C.-C.: On the security of public key protocols. IEEE Trans. Inf. Theory 29(2), 198\u2013207 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR13","unstructured":"Ehrsam, W.F., Meyer, C.H., Smith, J.L., Tuchman, W.L.: Message verification and transmission error detection by block chaining, US Patent 4,074,066, 14 February 1978"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10817-015-9341-5","volume":"56","author":"M Gagn\u00e9","year":"2016","unstructured":"Gagn\u00e9, M., Lafourcade, P., Lakhnech, Y., Safavi-Naini, R.: Automated proofs of block cipher modes of operation. J. Autom. Reason. 56(1), 49\u201394 (2016). https:\/\/doi.org\/10.1007\/s10817-015-9341-5","journal-title":"J. Autom. Reason."},{"key":"14_CR15","unstructured":"Gligor, V.D., Donescu, P., Katz, J.: On message integrity in symmetric encryption. In: 1st NIST Workshop on AES Modes of Operation (2000)"},{"key":"14_CR16","unstructured":"Halevi, S.: An observation regarding Jutla\u2019s modes of operation. IACR Cryptol. ePrint Arch. 2001:15 (2001)"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Hoang, V.T., Katz, J., Malozemoff, A.J.: Automated analysis and synthesis of authenticated encryption schemes. In: Proceedings of 22nd ACM CCS, pp. 84\u201395 (2015)","DOI":"10.1145\/2810103.2813636"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45708-9_2","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"A Joux","year":"2002","unstructured":"Joux, A., Martinet, G., Valette, F.: Blockwise-adaptive attackers revisiting the (in)security of some provably secure encryption modes: CBC, GEM, IACBC. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 17\u201330. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_2"},{"key":"14_CR19","unstructured":"Knudsen, L.R.: Block chaining modes of operation. In: Proceedings of Symmetric Key Block Cipher Modes of Operation Workshop (2000)"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/978-3-540-74835-9_40","volume-title":"Computer Security \u2013 ESORICS 2007","author":"S Kremer","year":"2007","unstructured":"Kremer, S., Mazar\u00e9, L.: Adaptive soundness of static equivalence. In: Biskup, J., L\u00f3pez, J. (eds.) ESORICS 2007. LNCS, vol. 4734, pp. 610\u2013625. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74835-9_40"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-030-86205-3_14","volume-title":"Frontiers of Combining Systems","author":"H Lin","year":"2021","unstructured":"Lin, H., et al.: Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems. In: Konev, B., Reger, G. (eds.) FroCoS 2021. LNCS, vol. 12941, pp. 253\u2013270. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-86205-3_14"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Malozemoff, A.J., Katz, J., Green, M.D.: Automated analysis and synthesis of block-cipher modes of operation. In: 2014 IEEE 27th Computer Security Foundations Symposium (CSF), pp. 140\u2013152. IEEE (2014)","DOI":"10.1109\/CSF.2014.18"},{"key":"14_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-030-36030-6_18","volume-title":"Theory of Cryptography","author":"I McQuoid","year":"2019","unstructured":"McQuoid, I., Swope, T., Rosulek, M.: Characterizing collision and second-preimage resistance in Linicrypt. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 451\u2013470. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_18"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-24638-1_8","volume-title":"Theory of Cryptography","author":"D Micciancio","year":"2004","unstructured":"Micciancio, D., Warinschi, B.: Soundness of formal encryption in the presence of active adversaries. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 133\u2013151. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_8"},{"key":"14_CR25","unstructured":"Unruh, D.: The impossibility of computationally sound XOR. IACR Cryptology ePrint Archive, 2010:389 (2010)"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88428-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T06:12:02Z","timestamp":1633068722000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88428-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030884277","9783030884284"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88428-4_14","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":"2 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Darmstadt","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2021.athene-center.de\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"351","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":"71","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":"20% - 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.07","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":"6.06","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":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}