{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T17:09:04Z","timestamp":1746551344076},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540607595"},{"type":"electronic","value":"9783540493631"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0032359","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:40:51Z","timestamp":1134283251000},"page":"201-214","source":"Crossref","is-referenced-by-count":16,"title":["Keyed hash functions"],"prefix":"10.1007","author":[{"given":"S.","family":"Bakhtiari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Safavi-Naini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Pieprzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,28]]},"reference":[{"key":"17_CR1","first-page":"83","volume-title":"The Classification of Hash Functions","author":"R. Anderson","year":"1995","unstructured":"R. Anderson, \u201cThe Classification of Hash Functions,\u201d in Codes and Cuphers \u2014 Proceedings of Cryptography and Coding IV, (Essex, UK), pp. 83\u201393, Institute of Mathematics and its Applications (IMA), 1995."},{"key":"17_CR2","unstructured":"S. Bakhtiari, R. Safavi-Naini, and J. Pieprzyk, \u201cCryptographic Hash Functions: A Survey,\u201d Tech. Rep. 95-09, Department of Computer Science, University of Wollongong, July 1995."},{"key":"17_CR3","unstructured":"S. Bakhtiari, R. Safavi-Naini, and J. Pieprzyk, \u201cPractical and Secure Message Authentication,\u201d in Series of Annual Workshop on Selected Areas in Cryptography (SAC '95), (Ottawa, Canada), pp. 55\u201368, May 1995."},{"key":"17_CR4","volume-title":"Tech. Rep. (included in) SRI-CSL-94-08","author":"T. A. Berson","year":"1993","unstructured":"T. A. Berson, L. Gong, and T. M. A. Lomas, \u201cSecure, Keyed, and Collisionful Hash Functions,\u201d Tech. Rep. (included in) SRI-CSL-94-08, SRI International Laboratory, Menlo Park, California, Dec. 1993. The revised version (September 2, 1994)."},{"issue":"no.2","key":"17_CR5","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. L. Carter","year":"1979","unstructured":"J. L. Carter and M. N. Wegman, \u201cUniversal Class of Hash Functions,\u201d Journal of Computer and System Sciences, vol. 18, no. 2, pp. 143\u2013154, 1979.","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"C. Charnes and J. Pieprzyk, \u201cLinear Nonequivalence versus Nonlinearity,\u201d in Advances in Cryptology, Proceedings of AUSCRYPT '92, pp. 156\u2013164, Dec. 1992.","DOI":"10.1007\/3-540-57220-1_59"},{"key":"17_CR7","unstructured":"D. Knuth, The Art of Computer Programming: Searching and Sorting, vol. 3. Addison-Wesley, 1973."},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"M. Luby and C. Rackoff, \u201cHow to Construct Pseudorandom Permutations and Pseudorandom Functions,\u201d SIAM Journal on Computing, vol. 17, pp. 373\u2013386, Apr. 1988.","journal-title":"SIAM Journal on Computing"},{"key":"17_CR9","unstructured":"National Bureau of Standard, Data Encryption Standard. FIPS publication 46, June 1977. U. S. Department of Commerce."},{"key":"17_CR10","unstructured":"B. Preneel, Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke University Leuven, Jan. 1993."},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"R. L. Rivest, \u201cThe MD5 Message-Digest Algorithm.\u201d RFC 1321, Apr. 1992. Network Working Group, MIT Laboratory for Computer Science and RSA Data Security, Inc.","DOI":"10.17487\/rfc1321"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"R. Safavi-Naini and L. Tombak, \u201cCombinatorial Characterization of A-Codes with r-Fold Security,\u201d in Advances in Cryptology, Proceedings of ASIACRYPT '94, vol. 917 of Lecture Notes in Computer Science (LNCS), pp. 211\u2013223, Springer-Verlag, 1995.","DOI":"10.1007\/BFb0000436"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"G. J. Simmons, \u201cAuthentication Theory \/ Coding Theory,\u201d in Advances in Cryptology, Proceedings of CRYPTO '84, vol. 196 of Lecture Notes in Computer Science (LNCS), pp. 411\u2013431, Springer-Verlag, 1985.","DOI":"10.1007\/3-540-39568-7_32"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"T. V. Trung, \u201cUniversal Hashing and Unconditional Authentication Codes,\u201d in Proceedings of the IEEE International Symposium on Information Theory, p. 228, 1993.","DOI":"10.1109\/ISIT.1993.748542"},{"key":"17_CR15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. N. Wegman","year":"1981","unstructured":"M. N. Wegman and J. L. Carter, \u201cNew Hash Functions and Their Use in Authentication and Set Equality,\u201d Journal of Computer and System Sciences, vol. 22, pp. 265\u2013279, 1981.","journal-title":"Journal of Computer and System Sciences"},{"key":"17_CR16","unstructured":"Y. Zheng, Principles for Designing Secure Block Ciphers and One-Way Hash Functions. PhD thesis, Electrical and Computer Engineering, Yokohama National University, Dec. 1990."},{"key":"17_CR17","first-page":"83","volume-title":"Lecture Notes in Computer Science (LNCS)","author":"Y. Zheng","year":"1992","unstructured":"Y. Zheng, J. Pieprzyk, and J. Seberry, \u201cHAVAL \u2014 A One-Way Hashing Algorithm with Variable Length of Output,\u201d in Advances in Cryptology, Proceedings of AUSCRYPT '92, vol. 718 of Lecture Notes in Computer Science (LNCS), (Queensland, Australia), pp. 83\u2013104, Springer-Verlag, Dec. 1992."}],"container-title":["Lecture Notes in Computer Science","Cryptography: Policy and Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0032359","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:48:26Z","timestamp":1586612906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032359"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540607595","9783540493631"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0032359","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}