{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T15:05:58Z","timestamp":1772809558661,"version":"3.50.1"},"reference-count":29,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2019]]},"DOI":"10.3934\/amc.2019042","type":"journal-article","created":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T23:53:48Z","timestamp":1561161228000},"page":"705-732","source":"Crossref","is-referenced-by-count":3,"title":["<inline-formula><tex-math id=\"M1\">$\\textsf{DWCDM+}$<\/tex-math><\/inline-formula>: A BBB secure nonce based MAC"],"prefix":"10.3934","volume":"13","author":[{"given":"Nilanjan","family":"Datta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avijit","family":"Dutta","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, Kolkata, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mridul","family":"Nandi","sequence":"additional","affiliation":[{"name":"Indian Statistical Institute, Kolkata, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kan","family":"Yasuda","sequence":"additional","affiliation":[{"name":"NTT Secure Platform Laboratories, NTT Corporation, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2019042-1","unstructured":"

M. Bellare and R. Impagliazzo, A tool for obtaining tighter security analyses of pseudorandom function based constructions, with applications to PRP to PRF conversion, preprint, ePrint: 1999\/024.ps<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019042-2","unstructured":"

M. Bellare, O. Goldreich and A. Mityagin, The power of verification queries in message authentication and authenticated encryption, preprint, ePrint: 2004\/309.ps<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019042-3","doi-asserted-by":"crossref","unstructured":"

S. Chen and J. Steinberger, Tight Security Bounds for Key-Alternating Ciphers, in Advances in Cryptology - EUROCRYPT 2014<\/i>, Academic Press, 8441<\/b> (2014), 327\u2013350.<\/p>","DOI":"10.1007\/978-3-642-55220-5_19"},{"key":"key-10.3934\/amc.2019042-4","doi-asserted-by":"crossref","unstructured":"

S. Chen, R. Lampe, J, Lee, Ya. Seurin and J. Steinberger, Minimizing the two-round even-Mansour cipher, in Advances in Cryptology - CRYPTO 2014<\/i>, Academic Press, 8616<\/b> (2014), 39\u201356.<\/p>","DOI":"10.1007\/978-3-662-44371-2_3"},{"key":"key-10.3934\/amc.2019042-5","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-018-0470-9"},{"key":"key-10.3934\/amc.2019042-6","doi-asserted-by":"crossref","unstructured":"

B. Cogliati and Y. Seurin, EWCDM: An efficient, beyond-birthday secure, nonce-misuse resistant MAC, in Advances in Cryptology - CRYPTO 2016<\/i>, Academic Press, 9814<\/b> (2016), 121\u2013149.<\/p>","DOI":"10.1007\/978-3-662-53018-4_5"},{"key":"key-10.3934\/amc.2019042-7","doi-asserted-by":"crossref","unstructured":"

W. Dai, V. T. Hoang and S. Tessaro, Information-theoretic indistinguishability via the chi-squared method, in Advances in Cryptology - CRYPTO 2017<\/i>, Academic Press, 10403<\/b> (2017), 497\u2013523.<\/p>","DOI":"10.1007\/978-3-319-63697-9_17"},{"key":"key-10.3934\/amc.2019042-8","doi-asserted-by":"crossref","unstructured":"

N. Datta, A. Dutta, M. Nandi and K. Yasuda, Encrypt or decrypt? To make a single-key beyond birthday secure nonce-based MAC, in Advances in Cryptology - CRYPTO 2018<\/i>, Academic Press, 10991<\/b> (2018), 631\u2013661.<\/p>","DOI":"10.1007\/978-3-319-96884-1_21"},{"key":"key-10.3934\/amc.2019042-9","doi-asserted-by":"crossref","unstructured":"

N. Datta, A. Dutta, M. Nandi, G. Paul and L. Zhang, Single key variant of PMAC_plus, IACR Trans. Symmetric Cryptol.<\/i>, 2017<\/b> (2017), 268\u2013305.<\/p>","DOI":"10.46586\/tosc.v2017.i4.268-305"},{"key":"key-10.3934\/amc.2019042-10","doi-asserted-by":"crossref","unstructured":"

N. Datta, A. Dutta, M. Nandi and G. Paul, Double-block hash-then-sum: A paradigm for constructing BBB secure PRF, IACR Trans. Symmetric Cryptol.<\/i>, 2018<\/b> (2018), 36\u201392.<\/p>","DOI":"10.46586\/tosc.v2018.i3.36-92"},{"key":"key-10.3934\/amc.2019042-11","doi-asserted-by":"crossref","unstructured":"

A. Dutta, A. Jha and M. Nandi, Tight security analysis of ehtm MAC, IACR Trans. Symmetric Cryptol.<\/i>, 2017<\/b> (2017), 130\u2013150.<\/p>","DOI":"10.46586\/tosc.v2017.i3.130-150"},{"key":"key-10.3934\/amc.2019042-12","doi-asserted-by":"crossref","unstructured":"

B. Gilles, On computationally secure authentication tags requiring short secret shared keys, in Advances in Cryptology - CRYPTO '82<\/i>, Academic Press, (1983), 79\u201386.<\/p>","DOI":"10.1007\/978-1-4757-0602-4_7"},{"key":"key-10.3934\/amc.2019042-13","doi-asserted-by":"crossref","unstructured":"

O. Goldreich, S. Goldwasser and S. Micali, On the cryptographic applications of random functions, in Advances in Cryptology - CRYPTO '84<\/i>, Academic Press, 196<\/b> (1984), 276\u2013288.<\/p>","DOI":"10.1007\/3-540-39568-7_22"},{"key":"key-10.3934\/amc.2019042-14","doi-asserted-by":"crossref","unstructured":"

P. Jacques, The \"Coefficients H\" technique, in Selected Areas in Cry. ptography<\/i>, Academic Press, 5381<\/b> (2008), 328\u2013345.<\/p>","DOI":"10.1007\/978-3-642-04159-4_21"},{"key":"key-10.3934\/amc.2019042-15","unstructured":"

P. Jacques, Introduction to mirror theory: Analysis of systems of linear equalities and linear non equalities for cryptography, preprint, https:\/\/eprint.iacr.org\/2010\/287.pdf<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019042-16","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-017-0326-y"},{"key":"key-10.3934\/amc.2019042-17","doi-asserted-by":"crossref","unstructured":"

S. Lucks, The sum of PRPs is a secure PRF, in Advances in Cryptology - EUROCRYPT 2000(Bruges)<\/i>, Academic Press, 1807<\/b> (2000), 470\u2013484.<\/p>","DOI":"10.1007\/3-540-45539-6_34"},{"key":"key-10.3934\/amc.2019042-18","doi-asserted-by":"crossref","unstructured":"

B. Mennink and S. Neves, Encrypted davies-meyer and its dual: Towards optimal security using mirror theory, in Advances in cryptology - CRYPTO 2017<\/i>, Academic Press, 10403<\/b> (2017), 556\u2013583.<\/p>","DOI":"10.1007\/978-3-319-63697-9_19"},{"key":"key-10.3934\/amc.2019042-19","doi-asserted-by":"crossref","unstructured":"

B. Mihir, K. Ted and R. Phillip, Luby-Rackoff backwards: Increasing security by making block ciphers non-invertible, in Advances in Cryptology - EUROCRYPT '98<\/i>, Academic Press, 1403<\/b> (1998), 266\u2013280.<\/p>","DOI":"10.1007\/BFb0054132"},{"key":"key-10.3934\/amc.2019042-20","doi-asserted-by":"crossref","unstructured":"

K. Minematsu and T. Iwata, Building blockcipher from tweakable blockcipher: Extending FSE 2009 proposal, in Cryptography and Coding<\/i>, Academic Press, 7089<\/b> (2011), 391\u2013412.<\/p>","DOI":"10.1007\/978-3-642-25516-8_24"},{"key":"key-10.3934\/amc.2019042-21","doi-asserted-by":"crossref","unstructured":"

Y. Naito, Blockcipher-based MACs: Beyond the birthday bound without message length, in ASIACRYPT 2017<\/i>, Academic Press, 10626<\/b> (2017), 446\u2013470.<\/p>","DOI":"10.1007\/978-3-319-70700-6_16"},{"key":"key-10.3934\/amc.2019042-22","doi-asserted-by":"crossref","unstructured":"

J. Patarin, A proof of security in O(2n) for the Benes scheme, in Progress in Cryptology - AFRICACRYPY 2008<\/i>, Academic Press, 5023<\/b> (2008), 209\u2013220.<\/p>","DOI":"10.1007\/978-3-540-68164-9_14"},{"key":"key-10.3934\/amc.2019042-23","unstructured":"

J. Patarin, Security in O(2n<\/sup>) for the xor of two random permutations - proof with the standard H technique, preprint, https:\/\/eprint.iacr.org\/2013\/368.pdf<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019042-24","doi-asserted-by":"crossref","unstructured":"

B. Srimanta and N. Mridul, Revisiting variable output length xor pseudorandom function, IACR Trans. Symmetric Cryptol.<\/i>, 2018<\/b> (2018), 314\u2013335.<\/p>","DOI":"10.46586\/tosc.v2018.i1.314-335"},{"key":"key-10.3934\/amc.2019042-25","unstructured":"

I. Tetsu, M. Bart and V. Damian, CENC is Optimally Secure<\/i>, preprint, https:\/\/eprint.iacr.org\/2016\/1087.pdf<\/a>.<\/p>"},{"key":"key-10.3934\/amc.2019042-26","doi-asserted-by":"crossref","unstructured":"

I. Tetsu, New blockcipher modes of operation with beyond the birthday bound security, in Fast Software Encryption<\/i>, Academic Press, 4047<\/b> (2006), 310\u2013327.<\/p>","DOI":"10.1007\/11799313_20"},{"key":"key-10.3934\/amc.2019042-27","doi-asserted-by":"crossref","unstructured":"

S. Victor, On fast and provably secure message authentication based on universal hashing, in Advances in Cryptology - CRYPTO '96<\/i>, Academic Press, 1109<\/b> (1996), 313\u2013328.<\/p>","DOI":"10.1007\/3-540-68697-5_24"},{"key":"key-10.3934\/amc.2019042-28","doi-asserted-by":"crossref","unstructured":"

K. Yasuda, A new variant of PMAC: Beyond the birthday bound, in Advances in Cryptology - CRYPTO 2011<\/i>, Academic Press, 6841<\/b> (2011), 596\u2013609.<\/p>","DOI":"10.1007\/978-3-642-22792-9_34"},{"key":"key-10.3934\/amc.2019042-29","doi-asserted-by":"crossref","unstructured":"

L. Zhang, W. L. Wu, H. Sui and P. Wang, 3kf9: Enhancing 3GPP-MAC beyond the birthday bound, in Advances in Cryptology - ASIACRYPT 2012<\/i>, Academic Press, 7658<\/b> (2012), 296\u2013312.<\/p>","DOI":"10.1007\/978-3-642-34961-4_19"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:08:34Z","timestamp":1772791714000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2019042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2019042","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}