{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T11:25:27Z","timestamp":1745321127837},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Security"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0167-4048(97)82016-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:08:45Z","timestamp":1027598925000},"page":"171-176","source":"Crossref","is-referenced-by-count":17,"title":["On probabilities of hash value matches"],"prefix":"10.1016","volume":"17","author":[{"given":"Mohammad","family":"Peyravian","sequence":"first","affiliation":[]},{"given":"Allen","family":"Roginsky","sequence":"additional","affiliation":[]},{"given":"Ajay","family":"Kshemkalyani","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-4048(97)82016-0_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"issue":"2","key":"10.1016\/S0167-4048(97)82016-0_BIB2","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/322123.322126","article-title":"Optimality Properties of Multiple Key Hash Functions","volume":"26","author":"Bolour","year":"1979","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0167-4048(97)82016-0_BIB3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal Classes of Hash Functions","volume":"18","author":"Carter","year":"1979","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0167-4048(97)82016-0_BIB4","first-page":"203","article-title":"Collision Free Hash Functions and Public Key Signature Schemes","author":"Damgard","year":"1987"},{"key":"10.1016\/S0167-4048(97)82016-0_BIB5","first-page":"416","article-title":"A Design Principle for Hash Functions","author":"Damgard","year":"1989"},{"key":"10.1016\/S0167-4048(97)82016-0_BIB6","series-title":"Proc. 25th IEEE Conf. on Foundations of Computer Science","first-page":"441","article-title":"A Paradoxical Solution to the Signature Problem","author":"Goldwasser","year":"1984"},{"key":"10.1016\/S0167-4048(97)82016-0_BIB7","series-title":"Tables of Integrals, Series, and Products","author":"Gradshtein","year":"1980"},{"issue":"10","key":"10.1016\/S0167-4048(97)82016-0_BIB8","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1145\/362375.362385","article-title":"General Performance Analysis of Key-to-Address Transformation Methods Using an Abstract File Concept","volume":"16","author":"Lum","year":"1973","journal-title":"Communications of the ACM"},{"issue":"1","key":"10.1016\/S0167-4048(97)82016-0_BIB9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/356643.356645","article-title":"Hash Table Methods","volume":"7","author":"Maurer","year":"1975","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"10.1016\/S0167-4048(97)82016-0_BIB10","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/362851.362882","article-title":"Scatter Storage Techniques","volume":"11","author":"Morris","year":"1968","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0167-4048(97)82016-0_BIB11","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1002\/ett.4460050406","article-title":"Cryptographic Hash Functions","volume":"5","author":"Preneel","year":"1994","journal-title":"European Trans. Telecommunications"},{"key":"10.1016\/S0167-4048(97)82016-0_BIB12","series-title":"Applied Cryptography","author":"Schneier","year":"1996"},{"key":"10.1016\/S0167-4048(97)82016-0_BIB13","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0022-0000(05)80007-8","article-title":"Combinatorial Techniques for Universal Hashing","volume":"48","author":"Stinson","year":"1994","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"10.1016\/S0167-4048(97)82016-0_BIB14","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/321707.321722","article-title":"A Note on the Efficiency of Hashing Functions","volume":"19","author":"Ullman","year":"1972","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0167-4048(97)82016-0_BIB15","series-title":"Principles of Database Systems","author":"Ullman","year":"1980"},{"key":"10.1016\/S0167-4048(97)82016-0_BIB16","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","article-title":"New Hash Functions and Their Use in Authentication and Set quality","volume":"22","author":"Wegman","year":"1981","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Computers & Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167404897820160?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167404897820160?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:57:27Z","timestamp":1556672247000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167404897820160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0167404897820160"],"URL":"https:\/\/doi.org\/10.1016\/s0167-4048(97)82016-0","relation":{},"ISSN":["0167-4048"],"issn-type":[{"value":"0167-4048","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}