{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:18:57Z","timestamp":1725553137364},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540308195"},{"type":"electronic","value":"9783540315988"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11596981_55","type":"book-chapter","created":{"date-parts":[[2006,6,17]],"date-time":"2006-06-17T14:42:27Z","timestamp":1150555347000},"page":"375-380","source":"Crossref","is-referenced-by-count":1,"title":["A Variant of Poly1305 MAC and Its Security Proof"],"prefix":"10.1007","author":[{"given":"Dayin","family":"Wang","sequence":"first","affiliation":[]},{"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Wenling","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/11502760_3","volume-title":"Fast Software Encryption","author":"D.J. Bernstein","year":"2005","unstructured":"Bernstein, D.J.: The Poly1305-AES message-authentication code. In: Gilbert, H., Handschuh, H. (eds.) FSE 2005. LNCS, vol.\u00a03557, pp. 32\u201349. Springer, Heidelberg (2005)"},{"key":"55_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/11426639_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D.J. Bernstein","year":"2005","unstructured":"Bernstein, D.J.: Stronger security bounds for Wegman-Carter-Shoup authenticators. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 164\u2013180. Springer, Heidelberg (2005)"},{"key":"55_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. Carter","year":"1979","unstructured":"Carter, J., Wegman, M.: Universal classes of hash functions. Journal of Computer and System Sciences\u00a018, 143\u2013154 (1979)","journal-title":"Journal of Computer and System Sciences"},{"key":"55_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"Wegman, M., Carter, J.: New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences\u00a022, 265\u2013279 (1981)","journal-title":"Journal of Computer and System Sciences"},{"key":"55_CR5","unstructured":"Black, J.: Message Authentication Codes, \n                    \n                      http:\/\/www.cs.colorado.edu\/~jrblack"},{"key":"55_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-46766-1_5","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D. Stinson","year":"1992","unstructured":"Stinson, D.: Universal hashing and authentication codes. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 74\u201385. Springer, Heidelberg (1992)"},{"key":"55_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-48658-5_15","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"H. Krawczyk","year":"1994","unstructured":"Krawczyk, H.: LFSR-based hashing and authentication. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 129\u2013139. Springer, Heidelberg (1994)"},{"key":"55_CR8","first-page":"7","volume":"114","author":"D. Stinson","year":"1996","unstructured":"Stinson, D.: On the connection between universal hashing, combinatorial designs and error-correcting codes. Proc. Congressus Numerantium\u00a0114, 7\u201327 (1996)","journal-title":"Proc. Congressus Numerantium"},{"key":"55_CR9","unstructured":"Bellare, M., Kilian, J., Rogaway, P.: The security of the cipher block chaining message authentication code, \n                    \n                      http:\/\/www.cs.ucdavis.edu\/~rogaway"},{"issue":"4","key":"55_CR10","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM\u00a033(4), 210\u2013217 (1986)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11596981_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:57:24Z","timestamp":1619506644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11596981_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540308195","9783540315988"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11596981_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}