{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:13Z","timestamp":1772283673522,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,1,6]],"date-time":"2018-01-06T00:00:00Z","timestamp":1515196800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s12095-017-0275-0","type":"journal-article","created":{"date-parts":[[2018,1,6]],"date-time":"2018-01-06T04:09:50Z","timestamp":1515211790000},"page":"731-753","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5957-2837","authenticated-orcid":false,"given":"Ashwin","family":"Jha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mridul","family":"Nandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,6]]},"reference":[{"key":"275_CR1","unstructured":"Abed, F., Fluhrer, S.R., Forler, C., List, E., Lucks, S., McGrew, D.A., Wenzel, J.: Pipelineable on-line encryption. In: Fast Software Encryption - 21st International Workshop, FSE 2014, London, UK, March 3-5, 2014. Revised Selected Papers, pp 205\u2013223 (2014)"},{"key":"275_CR2","doi-asserted-by":"crossref","unstructured":"Amanatidis, G., Boldyreva, A., O\u2019Neill, A.: Provably-secure schemes for basic query support in outsourced databases. In: Data and Applications Security XXI, Proceedings of the 21st Annual IFIP WG 11.3 Working Conference on Data and Applications Security - DBSec 2007, pp 14\u201330 (2007)","DOI":"10.1007\/978-3-540-73538-0_2"},{"key":"275_CR3","doi-asserted-by":"crossref","unstructured":"Andreeva, E., Barwell, G., Bhaumik, R., Nandi, M., Page, D., Stam, M.: Turning online ciphers off. IACR Transactions on Symmetric Cryptology 2017(2) (2017)","DOI":"10.46586\/tosc.v2017.i2.105-142"},{"key":"275_CR4","doi-asserted-by":"crossref","unstructured":"Andreeva, E., Bogdanov, A., Luykx, A., Mennink, B., Tischhauser, E., Yasuda, K.: Parallelizable and authenticated online ciphers. In: Proceedings of the Advances in Cryptology - ASIACRYPT 2013, Part I, pp 424\u2013443 (2013)","DOI":"10.1007\/978-3-642-42033-7_22"},{"key":"275_CR5","doi-asserted-by":"crossref","unstructured":"Andreeva, E., Luykx, A., Mennink, B., Yasuda, K.: COBRA: a parallelizable authenticated online cipher without block cipher inverse. In: 21st International Workshop on Fast Software Encryption - FSE 2014. Revised Selected Papers, pp 187\u2013204 (2014)","DOI":"10.1007\/978-3-662-46706-0_10"},{"issue":"4","key":"275_CR6","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1007\/s00145-011-9106-1","volume":"25","author":"M Bellare","year":"2012","unstructured":"Bellare, M., Boldyreva, A., Knudsen, L.R., Namprempre, C.: On-line ciphers and the hash-cbc constructions. J. Cryptol. 25(4), 640\u2013679 (2012)","journal-title":"J. Cryptol."},{"issue":"3","key":"275_CR7","doi-asserted-by":"crossref","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":"275_CR8","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Advances in Cryptology - EUROCRYPT 2006, Proceedings of the 25Th Annual International Conference on the Theory and Applications of Cryptographic Techniques, St. Petersburg, Russia, May 28 - June 1, 2006, pp 409\u2013426 (2006)","DOI":"10.1007\/11761679_25"},{"key":"275_CR9","unstructured":"Bernstein, D.J.: Polynomial evaluation and message authentication. http:\/\/cr.yp.to\/antiforgery\/pema-20071022.pdf. Access date is 27 July (2007)"},{"issue":"2","key":"275_CR10","first-page":"30","volume":"2016","author":"R Bhaumik","year":"2016","unstructured":"Bhaumik, R., Nandi, M.: Olef: an inverse-free online cipher. an online SPRP with an optimal inverse-free construction. IACR Trans. Symmetric Cryptol. 2016(2), 30\u201351 (2016)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"275_CR11","doi-asserted-by":"crossref","unstructured":"Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: UMAC: fast and secure message authentication. In: Proceedings of the Advances in Cryptology - CRYPTO \u201999, pp 216\u2013233 (1999)","DOI":"10.1007\/3-540-48405-1_14"},{"key":"275_CR12","doi-asserted-by":"crossref","unstructured":"Boldyreva, A., Taesombut, N.: Online encryption schemes: new security notions and constructions. In: Topics in Cryptology - CT-RSA 2004, the Cryptographers\u2019 Track at the RSA Conference 2004, San Francisco, CA, USA, February 23\u201327, 2004, Proceedings, pp 1\u201314 (2004)","DOI":"10.1007\/978-3-540-24660-2_1"},{"issue":"11","key":"275_CR13","doi-asserted-by":"crossref","first-page":"3318","DOI":"10.1109\/TC.2016.2529618","volume":"65","author":"L Bossuet","year":"2016","unstructured":"Bossuet, L., Datta, N., Mancillas-L\u00f3pez, C., Nandi, M.: Elmd: a pipelineable authenticated encryption and its hardware implementation. IEEE Trans. Comput. 65 (11), 3318\u20133331 (2016)","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"275_CR14","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L Carter","year":"1979","unstructured":"Carter, L., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"275_CR15","doi-asserted-by":"crossref","first-page":"106","DOI":"10.46586\/tosc.v2017.i1.106-128","volume":"2017","author":"D Chakraborty","year":"2017","unstructured":"Chakraborty, D., Ghosh, S., Sarkar, P.: A fast single-key two-level universal hash function. IACR Trans. Symmetric Cryptol. 2017(1), 106\u2013128 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"275_CR16","doi-asserted-by":"crossref","unstructured":"Datta, N., Nandi, M.: Elme: a misuse resistant parallel authenticated encryption. In: Proceedings of the 19th Australasian Conference on Information Security and Privacy - ACISP 2014, pp 306\u2013321 (2014)","DOI":"10.1007\/978-3-319-08344-5_20"},{"key":"275_CR17","doi-asserted-by":"crossref","unstructured":"Fleischmann, E., Forler, C., Lucks, S.: Mcoe: a family of almost foolproof on-line authenticated encryption schemes. In: Fast Software Encryption - 19th International Workshop, FSE 2012. Revised Selected Papers, pp 196\u2013215 (2012)","DOI":"10.1007\/978-3-642-34047-5_12"},{"key":"275_CR18","unstructured":"Forler, C., List, E., Lucks, S., Wenzel, J.: POEX: a beyond-birthday-bound-secure on-line cipher. ArcticCrypt 2016 (2016). https:\/\/www.researchgate.net\/publication\/299565944_POEx_A_Beyond-Birthday-Bound-Secure_On-Line_Cipher. Access date is 27 July 2017"},{"key":"275_CR19","doi-asserted-by":"publisher","unstructured":"Forler, C., List, E., Lucks, S., Wenzel, J.: POEX: a beyond-birthday-bound-secure on-line cipher. Cryptogr. Commun. (2017). https:\/\/doi.org\/10.1007\/s12095-017-0250-9","DOI":"10.1007\/s12095-017-0250-9"},{"key":"275_CR20","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","volume":"53","author":"EN Gilbert","year":"1974","unstructured":"Gilbert, E.N., MacWilliams, F.J., Sloane, N.J.A.: Codes which detect deception. Bell Syst. Tech. J. 53, 405\u2013424 (1974)","journal-title":"Bell Syst. Tech. J."},{"key":"275_CR21","doi-asserted-by":"crossref","unstructured":"Halevi, S., Krawczyk, H.: MMH: software message authentication in the gbit\/second rates. In: Proceedings of the 4th International Workshop on Fast Software Encryption, FSE \u201997, pp 172\u2013189 (1997)","DOI":"10.1007\/BFb0052345"},{"key":"275_CR22","doi-asserted-by":"crossref","unstructured":"Hoang, V.T., Reyhanitabar, R., Rogaway, P., Viz\u00e1r, D.: Online authenticated-encryption and its nonce-reuse misuse-resistance. In: Proceedings of the 35Th Annual Cryptology Conference on Advances in Cryptology - CRYPTO 2015, Part I, pp 493\u2013517 (2015)","DOI":"10.1007\/978-3-662-47989-6_24"},{"key":"275_CR23","doi-asserted-by":"crossref","unstructured":"Krovetz, T.: Message authentication on 64-bit architectures. In: Selected Areas in Cryptography, 13Th International Workshop, SAC 2006, Revised Selected Papers, pp 327\u2013341 (2006)","DOI":"10.1007\/978-3-540-74462-7_23"},{"issue":"3","key":"275_CR24","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1007\/s00145-010-9073-y","volume":"24","author":"M Liskov","year":"2011","unstructured":"Liskov, M., Rivest, R.L., Wagner, D.A.: Tweakable block ciphers. J. Cryptol. 24(3), 588\u2013613 (2011)","journal-title":"J. Cryptol."},{"key":"275_CR25","doi-asserted-by":"crossref","unstructured":"Luby, M., Rackoff, C.: How to construct pseudo-random permutations from pseudo-random functions (abstract). In: Proceedings of the Advances in Cryptology - CRYPTO \u201985, p 447 (1985)","DOI":"10.1007\/3-540-39799-X_34"},{"key":"275_CR26","unstructured":"Mennink, B.: Insuperability of the standard versus ideal model gap for tweakable blockcipher security. Cryptology ePrint Archive Report 2017\/474 (2017). http:\/\/eprint.iacr.org\/2017\/474"},{"key":"275_CR27","doi-asserted-by":"crossref","unstructured":"Minematsu, K., Iwata, T.: Tweak-length extension for tweakable blockciphers. In: Proceedings of the 15th IMA International Conference on Cryptography and Coding - IMACC 2015, Oxford, UK, December 1517, 2015, pp 77\u201393 (2015)","DOI":"10.1007\/978-3-319-27239-9_5"},{"key":"275_CR28","first-page":"158","volume":"2007","author":"M Nandi","year":"2007","unstructured":"Nandi, M.: A simple security analysis of hash-cbc and a new efficient one-key online cipher. IACR Cryptology ePrint Archive 2007, 158 (2007)","journal-title":"IACR Cryptology ePrint Archive"},{"key":"275_CR29","unstructured":"Nandi, M.: Two new efficient cca-secure online ciphers: MHCBC and MCBC. In: Progress in Cryptology - INDOCRYPT 2008, Proceedings of the 9th International Conference on Cryptology in India, Kharagpur, India, December 14\u201317, 2008, pp 350\u2013362 (2008)"},{"key":"275_CR30","doi-asserted-by":"crossref","unstructured":"Nandi, M.: On the minimum number of multiplications necessary for universal hash functions. In: Fast Software Encryption - 21st International Workshop, FSE 2014. Revised Selected Papers, pp 489\u2013508 (2014)","DOI":"10.1007\/978-3-662-46706-0_25"},{"issue":"4","key":"275_CR31","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/cpa.3160250405","volume":"25","author":"MO Rabin","year":"1972","unstructured":"Rabin, M.O., Winograd, S.: Fast evaluation of polynomials by rational preparation. Commun. Pure Appl. Math. 25(4), 433\u2013458 (1972)","journal-title":"Commun. Pure Appl. Math."},{"key":"275_CR32","doi-asserted-by":"crossref","unstructured":"Rogaway, P., Zhang, H.: Online ciphers from tweakable blockciphers. In: Topics in Cryptology - CT-RSA 2011 - the Cryptographers\u2019 Track at the RSA Conference 2011, San Francisco, CA, USA, February 14\u201318, 2011. Proceedings, pp 237\u2013249 (2011)","DOI":"10.1007\/978-3-642-19074-2_16"},{"issue":"3","key":"275_CR33","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10623-012-9672-8","volume":"69","author":"P Sarkar","year":"2013","unstructured":"Sarkar, P.: A new multi-linear universal hash family. Des. Codes Crypt. 69(3), 351\u2013367 (2013)","journal-title":"Des. Codes Crypt."},{"issue":"2","key":"275_CR34","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0022-0000(05)80007-8","volume":"48","author":"DR Stinson","year":"1994","unstructured":"Stinson, D.R.: Combinatorial techniques for universal hashing. J. Comput. Syst. Sci. 48(2), 337\u2013346 (1994)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"275_CR35","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF01388651","volume":"4","author":"DR Stinson","year":"1994","unstructured":"Stinson, D.R.: Universal hashing and authentication codes. Des. Codes Crypt. 4(4), 369\u2013380 (1994)","journal-title":"Des. Codes Crypt."},{"issue":"3","key":"275_CR36","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"MN Wegman","year":"1981","unstructured":"Wegman, M.N., Carter, L.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22(3), 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."},{"issue":"7","key":"275_CR37","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1109\/TC.1968.227420","volume":"17","author":"S Winograd","year":"1968","unstructured":"Winograd, S.: A new algorithm for inner product. IEEE Trans. Comput. 17(7), 693\u2013694 (1968)","journal-title":"IEEE Trans. Comput."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-017-0275-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0275-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0275-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T22:24:52Z","timestamp":1660256692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-017-0275-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,6]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["275"],"URL":"https:\/\/doi.org\/10.1007\/s12095-017-0275-0","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,6]]}}}