Evaluation of Network Traffic Analysis Using Approximate Matching Algorithms

[1]  Davide Balzarotti,et al.  Beyond Precision and Recall: Understanding Uses (and Misuses) of Similarity Hashes in Binary Analysis , 2018, CODASPY.

[2]  Ibrahim M. Baggili,et al.  Bytewise Approximate Matching: The Good, The Bad, and The Unknown , 2016, J. Digit. Forensics Secur. Law.

[3]  Kaloyan Petrov,et al.  Reducing the Time Required for Hashing Operations , 2013, IFIP Int. Conf. Digital Forensics.

[4]  Vikas Gupta,et al.  How Cuckoo Filter Can Improve Existing Approximate Matching Techniques , 2015, ICDF2C.

[5]  Harald Baier,et al.  Towards a Process Model for Hash Functions in Digital Forensics , 2013, ICDF2C.

[6]  Jonathan Oliver,et al.  TLSH -- A Locality Sensitive Hash , 2013, 2013 Fourth Cybercrime and Trustworthy Computing Workshop.

[7]  Christoph Busch,et al.  mvHash-B - A New Approach for Similarity Preserving Hashing , 2013, 2013 Seventh International Conference on IT Security Incident Management and IT Forensics.

[8]  Donghoon Chang,et al.  FbHash: A New Similarity Hashing Scheme for Digital Forensics , 2019, Digit. Investig..

[9]  Bin Fan,et al.  Cuckoo Filter: Practically Better Than Bloom , 2014, CoNEXT.

[10]  Harald Baier,et al.  Similarity Preserving Hashing: Eligible Properties and a New Algorithm MRSH-v2 , 2012, ICDF2C.

[11]  Mehmet Hadi Gunes,et al.  IoT Traffic Flow Identification using Locality Sensitive Hashes , 2020, ICC 2020 - 2020 IEEE International Conference on Communications (ICC).

[12]  Harald Baier,et al.  A Fuzzy Hashing Approach Based on Random Sequences and Hamming Distance , 2012 .

[13]  Golden G. Richard,et al.  Multi-resolution similarity hashing , 2007, Digit. Investig..

[14]  Ibrahim M. Baggili,et al.  File Detection On Network Traffic Using Approximate Matching , 2014, J. Digit. Forensics Secur. Law.

[15]  Harald Baier,et al.  Security Aspects of Piecewise Hashing in Computer Forensics , 2011, 2011 Sixth International Conference on IT Security Incident Management and IT Forensics.

[16]  Vassil Roussev.  Building a Better Similarity Trap with Statistically Improbable Features , 2009 .

[17]  Ernesto Damiani,et al.  An Open Digest-based Technique for Spam Detection , 2004, PDCS.

[18]  Donghoon Chang,et al.  Security Analysis of mvHash-B Similarity Hashing , 2016, J. Digit. Forensics Secur. Law.

[19]  Víctor Gayoso Martínez,et al.  An Improved Bytewise Approximate Matching Algorithm Suitable for Files of Dissimilar Sizes , 2020, Mathematics.

[20]  Alex D. Breslow,et al.  Morton filters: fast, compressed sparse cuckoo filters , 2019, The VLDB Journal.

[21]  Thomas Mueller Graf,et al.  Xor Filters , 2019, ACM J. Exp. Algorithmics.

[22]  Simson L. Garfinkel,et al.  Bringing science to digital forensics with standardized forensic corpora , 2009, Digit. Investig..

[23]  Frank Breitinger,et al.  Expediting MRSH-v2 Approximate Matching with Hierarchical Bloom Filter Trees , 2017, ICDF2C.

[24]  Vassil Roussev,et al.  Approximate Matching: Definition and Terminology , 2014 .

[25]  Vassil Roussev,et al.  An evaluation of forensic similarity hashes , 2011, Digit. Investig..

[26]  Travis Atkison,et al.  A Comparison of Fuzzy Hashes: Evaluation, Guidelines, and Future Suggestions , 2017, ACM Southeast Regional Conference.

[27]  Vallipuram Muthukkumarasamy,et al.  A survey on data leakage prevention systems , 2016, J. Netw. Comput. Appl..

[28]  Vassil Roussev,et al.  Data Fingerprinting with Similarity Digests , 2010, IFIP Int. Conf. Digital Forensics.

[29]  Jesse D. Kornblum.  Identifying almost identical files using context triggered piecewise hashing , 2006, Digit. Investig..