{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T10:35:23Z","timestamp":1720434923161},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2017,11,1]]},"DOI":"10.1109\/tc.2017.2710125","type":"journal-article","created":{"date-parts":[[2017,5,31]],"date-time":"2017-05-31T18:36:21Z","timestamp":1496255781000},"page":"1851-1864","source":"Crossref","is-referenced-by-count":1,"title":["A New Look at Counters: Don\u2019t Run Like Marathon in a Hundred Meter Race"],"prefix":"10.1109","volume":"66","author":[{"given":"Avijit","family":"Dutta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashwin","family":"Jha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mridul","family":"Nandi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68697-5_1"},{"key":"ref38","author":"berendschot","year":"1995","journal-title":"Final Report of RACE Integrity Primitives"},{"key":"ref33","first-page":"409","article-title":"The security of triple encryption and a framework for code-based game-playing proofs","author":"bellare","year":"2006","journal-title":"Proc Int Conf Theory Appl Cryptographic Techn"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74619-5_27"},{"key":"ref31","first-page":"327","article-title":"Message authentication on 64-bit architectures","author":"krovetz","year":"2006","journal-title":"Sel Areas Cryptography 13th Int Workshop SAC"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48405-1_14"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46035-7_25"},{"key":"ref36","article-title":"Message verification and transmission error detection by block chaining","author":"ehrsam","year":"1976"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1694"},{"key":"ref34","article-title":"A short proof of the PRP\/PRF switching lemma","author":"chang","year":"2008","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-012-9672-8"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052345"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1968.227420"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30556-9_27"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.SP.800-38b-2005"},{"key":"ref20","article-title":"Intel advanced encryption standard (AES) new instructions set","author":"gueron","year":"2010"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-5906-5_569","article-title":"Davies&#x2013;Meyer","author":"preneel","year":"2011","journal-title":"Encyclopedia of Cryptography and Security"},{"key":"ref21","first-page":"368","article-title":"Hash functions based on block ciphers: A synthetic approach","author":"preneel","year":"1993","journal-title":"Proc Annu Int Cryptology Conf"},{"key":"ref24","first-page":"430","article-title":"Merkle-Damg&#x00E5;rd revisited: How to construct a hash function","author":"coron","year":"2005","journal-title":"Proc Annu Int Cryptology Conf"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_21"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/PL00003822"},{"key":"ref25","first-page":"1","article-title":"The random oracle model and the ideal cipher model are equivalent","author":"coron","year":"2008","journal-title":"Proc Annu Int Cryptology Conf"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(93)00116-H"},{"key":"ref54","author":"dutta","year":"0"},{"key":"ref53","year":"2001","journal-title":"Announcing the Advanced Encryption Standard (AES)"},{"key":"ref52","article-title":"Formal aspects of mobile code security","author":"dean","year":"1999"},{"key":"ref10","first-page":"428","article-title":"One way hash functions and DES","author":"merkle","year":"1989","journal-title":"Proc Annu Int Cryptology Conf"},{"key":"ref11","first-page":"416","article-title":"A design principle for hash functions","author":"damg\u00e5rd","year":"1989","journal-title":"Proc Annu Int Cryptology Conf"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45661-9_19"},{"key":"ref12","article-title":"Practical hash functions constructions resistant to generic second preimage attacks beyond the birthday bound","author":"bouillaguet","year":"2010"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_10"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90033-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45539-6_32"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-959-0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44750-4_2"},{"key":"ref3","first-page":"373","article-title":"Deterministic authenticated-encryption: A provable-security treatment of the key-wrap problem","author":"rogaway","year":"2006","journal-title":"Proc Int Conf Theory Appl Cryptographic Techn"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-52993-5_3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900051"},{"key":"ref8","first-page":"474","article-title":"Second preimages on n-bit hash functions for much less than 2 ${}^{\\mbox{n}}$ work","author":"kelsey","year":"2005","journal-title":"Proc Int Conf Theory Appl Cryptographic Techn"},{"key":"ref7","article-title":"A framework for iterative hash functions-HAIFA","author":"biham","year":"2006","journal-title":"NIST Hash Function Workshop"},{"key":"ref49","year":"2014","journal-title":"ZIP File Format Specification"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-015-9206-4"},{"key":"ref46","article-title":"The transmission of information","author":"fano","year":"1949"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53018-4_5"},{"key":"ref48","year":"2013","journal-title":"ISO\/IEC 10918-5 2013 Information Technology-Digital Compression and Coding of Continuous-Tone Still Images JPEG File Interchange Format (JFIF)"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(74)80007-3"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13858-4_13"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48405-1_17"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03317-9_21"},{"key":"ref43","article-title":"FRMAC, a proc. fast randomized message authentication code","author":"jaulmes","year":"2004","journal-title":"IACR Cryptology ePrint Archive"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/8060275\/07936672.pdf?arnumber=7936672","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:22:25Z","timestamp":1642004545000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7936672\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,1]]},"references-count":54,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tc.2017.2710125","relation":{},"ISSN":["0018-9340"],"issn-type":[{"value":"0018-9340","type":"print"}],"subject":[],"published":{"date-parts":[[2017,11,1]]}}}