{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:02:02Z","timestamp":1772283722228,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540615125","type":"print"},{"value":"9783540686972","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68697-5_24","type":"book-chapter","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T17:10:00Z","timestamp":1194541800000},"page":"313-328","source":"Crossref","is-referenced-by-count":100,"title":["On Fast and Provably Secure Message Authentication Based on Universal Hashing"],"prefix":"10.1007","author":[{"given":"Victor","family":"Shoup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"W. Aiello and R. Venkatesan. Foiling birthday attacks in output-doubling transformations. In Advances in Cryptology\u2014Eurocrypt\u2019 96, 1996. To appear.","DOI":"10.1007\/3-540-68339-9_27"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare, R. Canetti, and H. Krawczyk. Keying hash functions for message authentication. In Advances in Cryptology\u2014Crypto\u2019 96, 1996.","DOI":"10.1007\/3-540-68697-5_1"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"M. Bellare, R. Gu\u00e9rin, and P. Rogaway. XOR MACs: New methods for message authentication using finite pseudorandom functions. In Advances in Cryptology\u2014Crypto\u2019 95, pages 15\u201328, 1995.","DOI":"10.1007\/3-540-44750-4_2"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare, J. Kilian, and P. Rogaway. On the security of cipher block chaining. In Advances in Cryptology Crypto\u2019 94, pages 341\u2013358, 1994.","DOI":"10.1007\/3-540-48658-5_32"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"A. Bosselaers, R. Govaerts, and J. Vandewalle. Fast hashing on the Pentium. In Advances in Cryptology\u2014Crypto\u2019 96, 1996.","DOI":"10.1007\/3-540-68697-5_23"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"G. Brassard. On computationally secure authentication tags requiring short secret shared keys. In Advances in Cryptology-Crypto\u2019 82, pages 79\u201386, 1982.","DOI":"10.1007\/978-1-4757-0602-4_7"},{"issue":"3","key":"24_CR7","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","volume":"53","author":"E. Gilbert","year":"1974","unstructured":"E. Gilbert, F. M. Williams, and N. Sloane. Codes which detect deception. Bell System Technical Journal, 53(3):405\u2013424, 1974.","journal-title":"Bell System Technical Journal"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, and R. Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput., 17:281\u2013308, 1988.","journal-title":"SIAM J. Comput."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1049\/el:19760508","volume":"12","author":"J. Gordon","year":"1976","unstructured":"J. Gordon. Very simple method to find the minimal polynomial of an arbitrary non-zero element of a finite field. Electronic Letters, 12:663\u2013664, 1976.","journal-title":"Electronic Letters"},{"key":"24_CR10","unstructured":"D. How. Fast and portable DES encryption and decryption, 1992. Available from how@isl.stanford.edu."},{"key":"24_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/3-540-54522-0_93","volume-title":"Symp. Applied Algebra, Algebraic Algorithms, Error-Correcting Codes","author":"E. Kaltofen","year":"1991","unstructured":"E. Kaltofen and B. Saunders. On Wiedeman\u2019s method of solving sparse linear systems. In Symp. Applied Algebra, Algebraic Algorithms, Error-Correcting Codes (Lecture Notes in Computer Science no. 539), pages 29\u201338, 1991."},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"H. Krawczyk. LFSR-based hashing and authentication. In Advances in Cryptology\u2014Crypto\u2019 94, pages 129\u2013139, 1994.","DOI":"10.1007\/3-540-48658-5_15"},{"key":"24_CR13","unstructured":"A. K. Lenstra and M. S. Manasse. Compact incremental Gaussian elimination over Z\/2Z. Technical Report 88-16, University of Chicago Dept. of Computer Science, 1988."},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"IT-15","author":"J. Massey","year":"1969","unstructured":"J. Massey. Shift-register synthesis and BCH coding. IEEE Trans. Inf. Theory, IT-15:122\u2013127, 1969.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"D. Parkinson and M. Wunderlich. A compact algorithm for Gaussian elimination over GF(2) implemented on highly parallel computers. Parallel Computing, pages 65\u201373, 1984.","DOI":"10.1016\/S0167-8191(84)90424-1"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"B. Preneel and P. van Oorschot. MDx-MAC and building fast MACs from hash functions. In Advances in Cryptology Crypto\u2019 95, pages 1\u201314, 1995.","DOI":"10.1007\/3-540-44750-4_1"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"P. Rogaway. Bucket hashing and its application to fast message authentication. In Advances in Cryptology-Crypto\u2019 95, pages 29\u201342, 1995.","DOI":"10.1007\/3-540-44750-4_3"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"M. Wegman and L. Carter. New hash functions and their use in authentication and set equality. J. of Computer and System Sciences, 22:265\u2013279, 1981.","journal-title":"J. of Computer and System Sciences"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"IT-32","author":"D. Wiedemann","year":"1986","unstructured":"D. Wiedemann. Solving sparse linear systems over finite fields. IEEE Trans. Inf. Theory, IT-32:54\u201362, 1986.","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO \u201996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68697-5_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T04:27:42Z","timestamp":1556944062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68697-5_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615125","9783540686972"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-68697-5_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]}}}