{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:01:56Z","timestamp":1754161316292,"version":"3.41.2"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/icdse47409.2019.8971481","type":"proceedings-article","created":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T23:37:01Z","timestamp":1580427421000},"page":"11-14","source":"Crossref","is-referenced-by-count":1,"title":["An Empirical Study to Detect the Collision Rate in Similarity Hashing Algorithm Using MD5"],"prefix":"10.1109","author":[{"given":"Tushaar","family":"Gangavarapu","sequence":"first","affiliation":[{"name":"Worldwide Deals, Automated Advertising, Amazon.com, Inc.,Bangalore,India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.D.","family":"Jaidhar","sequence":"additional","affiliation":[{"name":"National Institute of Technology Karnataka,Department of Information Technology,Mangalore,India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1320"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_14"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-60865-6_43"},{"journal-title":"Handbook of Applied Cryptography","year":"1996","author":"katz","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900019"},{"journal-title":"Haval a one-way hashing algorithm with variable length of output 1 yuliang zheng josef pieprzyk","year":"1993","author":"seberry","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/509961.509965"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242592"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06811-4_12"},{"journal-title":"SimHash Hash-based Similarity Detection","year":"2007","author":"sadowski","key":"ref19"},{"key":"ref4","article-title":"Lecture 21: Collision-Resistant Hash Functions and General Digital Signature Scheme","author":"pass","year":"2009","journal-title":"Course on Cryptography at Cornell University"},{"article-title":"What do Hash Collisions Really Mean?","year":"2008","author":"floyd","key":"ref3"},{"key":"ref6","article-title":"Secure hash standard","author":"burrows","year":"1995","journal-title":"DEPARTMENT OF COMMERCE WASHINGTON DC Tech Rep"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.17487\/rfc1321"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/11426639_2"},{"key":"ref7","first-page":"199","article-title":"Collisions for hash functions md 4, md 5, haval-128 and ripemd","volume":"2004","author":"wang","year":"2004","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref2","first-page":"1999","article-title":"Lecture notes on cryptography","volume":"1999","author":"goldwasser","year":"1996","journal-title":"Summer course “Cryptography and computer security” at MIT"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.17487\/rfc2104"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2663761.2664221"},{"key":"ref22","first-page":"453","article-title":"Privacy-preserving smart similarity search based on simhash over encrypted data in cloud computing","volume":"16","author":"fu","year":"2015","journal-title":"LL"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063737"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-16657-1_62"},{"key":"ref23","first-page":"93","article-title":"Semi-supervised simhash for efficient document similarity search","author":"jiang","year":"0","journal-title":"Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics Human Language Technologies-Volume 1 Association for Computational Linguistics"},{"key":"ref26","volume":"1","author":"snir","year":"1998","journal-title":"MPI-The Complete Reference The MPI Core"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24289-3_16"}],"event":{"name":"2019 International Conference on Data Science and Engineering (ICDSE)","start":{"date-parts":[[2019,9,26]]},"location":"Patna, India","end":{"date-parts":[[2019,9,28]]}},"container-title":["2019 International Conference on Data Science and Engineering (ICDSE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8961325\/8971471\/08971481.pdf?arnumber=8971481","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,28]],"date-time":"2025-07-28T19:39:52Z","timestamp":1753731592000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8971481\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/icdse47409.2019.8971481","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}