{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:39:17Z","timestamp":1743136757843,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031533679"},{"type":"electronic","value":"9783031533686"}],"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-53368-6_12","type":"book-chapter","created":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T19:02:15Z","timestamp":1708282935000},"page":"233-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compactly Committing Authenticated Encryption Using Encryptment and\u00a0Tweakable Block Cipher"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6723-722X","authenticated-orcid":false,"given":"Shoichi","family":"Hirose","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3427-6772","authenticated-orcid":false,"given":"Kazuhiko","family":"Minematsu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"key":"12_CR1","unstructured":"Albertini, A., Duong, T., Gueron, S., K\u00f6lbl, S., Luykx, A., Schmieg, S.: How to abuse and fix authenticated encryption without key commitment. In: Butler, K.R.B., Thomas, K. (eds.) 31st USENIX Security Symposium, USENIX Security 2022, pp. 3291\u20133308. USENIX Association (2022). https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/albertini"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Bellare, M., Hoang, V.T.: Efficient schemes for committing authenticated encryption. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13276, pp. 845\u2013875. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_29","DOI":"10.1007\/978-3-031-07085-3_29"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/3-540-44448-3_41","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"M Bellare","year":"2000","unstructured":"Bellare, M., Namprempre, C.: Authenticated encryption: relations among notions and analysis of the generic composition paradigm. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 531\u2013545. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_41"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-030-56784-2_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"D Bellizia","year":"2020","unstructured":"Bellizia, D., et al.: Mode-level vs. implementation-level physical security in symmetric cryptography. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 369\u2013400. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_13"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Berti, F., Guo, C, Pereira, O., Peters, T., Standaert, F-X.,: TEDT, a leakage-resistant AEAD mode for high physical security applications. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2020(1), 256\u2013320 (2020). https:\/\/doi.org\/10.13154\/tches.v2020.i1.256-320","DOI":"10.13154\/tches.v2020.i1.256-320"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-030-23696-0_12","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2019","author":"F Berti","year":"2019","unstructured":"Berti, F., Pereira, O., Standaert, F.-X.: Reducing the cost of authenticity with leakages: a $$\\sf CIML2 {-secure \\sf AE}$$ scheme with one call to a strongly protected tweakable block cipher. In: Buchmann, J., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2019. LNCS, vol. 11627, pp. 229\u2013249. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-23696-0_12"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-60865-6_40","volume-title":"Fast Software Encryption","author":"M Blaze","year":"1996","unstructured":"Blaze, M.: High-bandwidth encryption with low-bandwidth smartcards. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 33\u201340. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60865-6_40"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BFb0054131","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"M Blaze","year":"1998","unstructured":"Blaze, M., Feigenbaum, J., Naor, M.: A formal treatment of remotely keyed encryption. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 251\u2013265. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054131"},{"key":"12_CR9","doi-asserted-by":"publisher","unstructured":"Chan, J., Rogaway, P.: On committing authenticated-encryption. In: Atluri, V., Pietro, R.D., Jensen, C.D., Meng, W. (eds.) ESORICS 2022. LNCS, vol. 13555, pp. 275\u2013294. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-17146-8_14","DOI":"10.1007\/978-3-031-17146-8_14"},{"key":"12_CR10","unstructured":"Chen, L., Tang, Q.: People who live in glass houses should not throw stones: targeted opening message franking schemes. Cryptology ePrint Archive, Report 2018\/994 (2018). https:\/\/eprint.iacr.org\/2018\/994"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Dobraunig, C., et al.: Isap v2.0. IACR Trans. Symm. Cryptol. 2020(S1), 390\u2013416 (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.iS1.390-416","DOI":"10.46586\/tosc.v2020.iS1.390-416"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-39200-9_19","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"Y Dodis","year":"2003","unstructured":"Dodis, Y., An, J.H.: Concealment and its applications to authenticated encryption. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 312\u2013329. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_19"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-319-96884-1_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"Y Dodis","year":"2018","unstructured":"Dodis, Y., Grubbs, P., Ristenpart, T., Woodage, J.: Fast message franking: from invisible salamanders to encryptment. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 155\u2013186. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_6"},{"key":"12_CR14","unstructured":"Dodis, Y., Grubbs, P., Ristenpart, T., Woodage, J.: Fast message franking: from invisible salamanders to encryptment. Cryptology ePrint Archive, Paper 2019\/016 (2019). https:\/\/eprint.iacr.org\/2019\/016"},{"key":"12_CR15","unstructured":"Facebook: Facebook messenger. https:\/\/www.messenger.com. Accessed 09 Oct 2022"},{"key":"12_CR16","unstructured":"Facebook: Messenger secret conversations. Technical Whitepaper (2016). https:\/\/about.fb.com\/wp-content\/uploads\/2016\/07\/messenger-secret-conversations-technical-whitepaper.pdf"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Farshim, P., Orlandi, C., Rosie, R.: Security of symmetric primitives under incorrect usage of keys. IACR Trans. Symm. Cryptol. 2017(1), 449\u2013473 (2017). https:\/\/doi.org\/10.13154\/tosc.v2017.i1.449-473","DOI":"10.13154\/tosc.v2017.i1.449-473"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-63697-9_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"P Grubbs","year":"2017","unstructured":"Grubbs, P., Lu, J., Ristenpart, T.: Message franking via committing authenticated encryption. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 66\u201397. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_3"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Hirose, S.: Compactly committing authenticated encryption using tweakable block cipher. In: Kutylowski, M., Zhang, J., Chen, C. (eds.) NSS 2020. LNCS, vol. 12570, pp. 187\u2013206. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-65745-1_11","DOI":"10.1007\/978-3-030-65745-1_11"},{"issue":"6","key":"12_CR20","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10207-011-0146-1","volume":"10","author":"Q Huang","year":"2011","unstructured":"Huang, Q., Yang, G., Wong, D.S., Susilo, W.: Efficient strong designated verifier signature schemes without random oracle or with non-delegatability. Int. J. Inf. Secur. 10(6), 373\u2013385 (2011). https:\/\/doi.org\/10.1007\/s10207-011-0146-1","journal-title":"Int. J. Inf. Secur."},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-030-88323-2_6","volume-title":"Information Security and Cryptology","author":"L Huguenin-Dumittan","year":"2021","unstructured":"Huguenin-Dumittan, L., Leontiadis, I.: A message franking channel. In: Yu, Yu., Yung, M. (eds.) Inscrypt 2021. LNCS, vol. 13007, pp. 111\u2013128. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88323-2_6"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-68339-9_13","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"M Jakobsson","year":"1996","unstructured":"Jakobsson, M., Sako, K., Impagliazzo, R.: Designated verifier proofs and their applications. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 143\u2013154. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_13"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-48519-8_8","volume-title":"Fast Software Encryption","author":"M Jakobsson","year":"1999","unstructured":"Jakobsson, M., Stern, J.P., Yung, M.: Scramble all, encrypt small. In: Knudsen, L. (ed.) FSE 1999. LNCS, vol. 1636, pp. 95\u2013111. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48519-8_8"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Katz, J., Yung, M.: Complete characterization of security notions for probabilistic private-key encryption. In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 245\u2013254 (2000)","DOI":"10.1145\/335305.335335"},{"key":"12_CR25","unstructured":"Len, J., Grubbs, P., Ristenpart, T.: Partitioning oracle attacks. In: Bailey, M., Greenstadt, R. (eds.) 30th USENIX Security Symposium, USENIX Security 2021, pp. 195\u2013212. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/len"},{"key":"12_CR26","unstructured":"Leontiadis, I., Vaudenay, S.: Private message franking with after opening privacy. Cryptology ePrint Archive, Report 2018\/938 (2018). https:\/\/eprint.iacr.org\/2018\/938"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45708-9_3","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"M Liskov","year":"2002","unstructured":"Liskov, M., Rivest, R.L., Wagner, D.: Tweakable block ciphers. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 31\u201346. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_3"},{"issue":"3","key":"12_CR28","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1007\/s00145-010-9073-y","volume":"24","author":"MD Liskov","year":"2011","unstructured":"Liskov, M.D., Rivest, R.L., Wagner, D.A.: Tweakable block ciphers. J. Cryptol. 24(3), 588\u2013613 (2011). https:\/\/doi.org\/10.1007\/s00145-010-9073-y","journal-title":"J. Cryptol."},{"key":"12_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BFb0052349","volume-title":"Fast Software Encryption","author":"S Lucks","year":"1997","unstructured":"Lucks, S.: On the security of remotely keyed encryption. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 219\u2013229. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052349"},{"key":"12_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-48519-8_9","volume-title":"Fast Software Encryption","author":"S Lucks","year":"1999","unstructured":"Lucks, S.: Accelerated remotely keyed encryption. In: Knudsen, L. (ed.) FSE 1999. LNCS, vol. 1636, pp. 112\u2013123. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48519-8_9"},{"key":"12_CR31","doi-asserted-by":"publisher","unstructured":"Naito, Y., Sasaki, Y., Sugawara, T.: Secret can be public: low-memory AEAD mode for high-order masking. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13509, pp. 315\u2013345. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_11","DOI":"10.1007\/978-3-031-15982-4_11"},{"key":"12_CR32","doi-asserted-by":"publisher","unstructured":"Shen, Y., Peters, T., Standaert, F., Cassiers, G., Verhamme, C.: Triplex: an efficient and one-pass leakage-resistant mode of operation. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2022(4), 135\u2013162 (2022). https:\/\/doi.org\/10.46586\/tches.v2022.i4.135-162","DOI":"10.46586\/tches.v2022.i4.135-162"},{"key":"12_CR33","unstructured":"Signal Foundation: Signal. https:\/\/signal.org\/. Accessed 09 Oct 2022"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-030-26954-8_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"N Tyagi","year":"2019","unstructured":"Tyagi, N., Grubbs, P., Len, J., Miers, I., Ristenpart, T.: Asymmetric message franking: content moderation for metadata-private end-to-end encryption. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 222\u2013250. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_8"},{"key":"12_CR35","unstructured":"WhatsApp: WhatsApp Messenger. https:\/\/www.whatsapp.com. Accessed 09 Oct 2022"},{"key":"12_CR36","doi-asserted-by":"publisher","unstructured":"Yamamuro, H., Hara, K., Tezuka, M., Yoshida, Y., Tanaka, K.: Forward secure message franking. In: Park, J.H., Seo, S. (eds.) ICISC 2021. LNCS, vol. 13218, pp. 339\u2013358. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-031-08896-4_18","DOI":"10.1007\/978-3-031-08896-4_18"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53368-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,18]],"date-time":"2024-02-18T19:03:23Z","timestamp":1708283003000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53368-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031533679","9783031533686"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53368-6_12","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":"19 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fredericton, NB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sac-workshop.github.io\/sac-2023\/index.html","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","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":"21","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":"47% - 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.09","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":"3.56","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)"}}]}}