Fetching the paper…
Reading the bibliography…
Recent work has proposed the Lempel-Ziv Jaccard Distance (LZJD) as a method to measure the similarity between binary byte sequences for malware classification.
V. I. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, in: Soviet physics doklady, vol. 10, 707, 1966
1966
Earlier work this paper cites.
J. Ziv, A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory 23 (3) (1977) 337–343, ISSN 0018-9448, doi: 10.1109/TIT.1977.1055714
1977
Earlier work this paper cites.
J. K. Uhlmann, Satisfying general proximity / similarity queries with metric trees, Information Processing Letters 40 (4) (1991) 175–179, ISSN 00200190, doi: 10.1016/0020-0190(91)90074-R
1991
Earlier work this paper cites.
P. Yianilos, Data structures and algorithms for nearest neighbor search in general metric spaces, in: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, Society for Industrial and Applied Mathematics, 311–321, URL http://dl.acm.org/citation.cfm?id=313789 , 1993
1993
Earlier work this paper cites.
A. Z. Broder, On the Resemblance and Containment of Documents, in: Proceedings of the Compression and Complexity of Sequences 1997, SEQUENCES ’97, IEEE Computer Society, Washington, DC, USA, ISBN 0-8186-8132-2, 21–29, URL http://dl.acm.org/citation.cfm?id=829502.830043 , 1997
1997
Earlier work this paper cites.
A. Z. Broder, M. Charikar, A. M. Frieze, M. Mitzenmacher, Min-wise Independent Permutations (Extended Abstract), in: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC ’98, ACM, New York, NY, USA, ISBN 0-89791-962-9, 327–336, doi: 10.1145/276698.276781
1998
Earlier work this paper cites.
D. E. Knuth, The Art of Computer Programming, Volume 3: (2Nd Ed.) Sorting and Searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, ISBN 0-201-89685-0, 1998
1998
Earlier work this paper cites.
D. Dor, U. Zwick, Median Selection Requires (2+ ϵ \epsilon )N Comparisons, SIAM J. Discret. Math. 14 (3) (2001) 312–325, ISSN 0895-4801, doi: 10.1137/S0895480199353895
2001
Earlier work this paper cites.
M. Li, X. Chen, X. Li, B. Ma, P. M. Vitanyi, The Similarity Metric, IEEE Transactions on Information Theory 50 (12) (2004) 3250–3264, ISSN 0018-9448, doi: 10.1109/TIT.2004.838101
2004
Earlier work this paper cites.
M. Cebrián, M. Alfonseca, A. Ortega, others, Common pitfalls using the normalized compression distance: What to watch out for in a compressor, Communications in Information & Systems 5 (4) (2005) 367–384
2005
Earlier work this paper cites.
J. Kornblum, Identifying almost identical files using context triggered piecewise hashing, Digital Investigation 3 (2006) 91–97, ISSN 17422876, doi: 10.1016/j.diin.2006.06.015
2006
Earlier work this paper cites.
W. Wong, M. Stamp, Hunting for metamorphic engines, Journal in Computer Virology 2 (3) (2006) 211–229, ISSN 1772-9904, doi: 10.1007/s11416-006-0028-7
2006
Earlier work this paper cites.
A. Beygelzimer, S. Kakade, J. Langford, Cover trees for nearest neighbor, in: International Conference on Machine Learning, ACM, New York, 97–104, URL http://www.cs.princeton.edu/courses/archive/spr05/cos598E/bib/covertree.pdf , 2006
2006
Earlier work this paper cites.
M. Cebrin, M. Alfonseca, A. Ortega, The Normalized Compression Distance Is Resistant to Noise, IEEE Transactions on Information Theory 53 (5) (2007) 1895–1900, ISSN 0018-9448, doi: 10.1109/TIT.2007.894669
2007
Earlier work this paper cites.
I. Pavlov, LZMA SDK (Software Development Kit), http://www.7-zip.org/sdk.html, URL http://www.7-zip.org/sdk.html , 2007
2007
Cited alongside, same era.
E. Konstantinou, Metamorphic Virus: Analysis and Detection, Tech. Rep., Royal Holloway University of London, URL http://digirep.rhul.ac.uk/items/bde3a9fe-51c0-a19a-e04d-b324c0926a4a/1/ , 2008
2008
Cited alongside, same era.
V. Roussev, Building a Better Similarity Trap with Statistically Improbable Features, in: Proceedings of the 42Nd Hawaii International Conference on System Sciences, HICSS ’09, IEEE Computer Society, Washington, DC, USA, ISBN 978-0-7695-3450-3, 1–10, doi: 10.1109/HICSS.2009.97
2009
Cited alongside, same era.
V. Roussev, Data Fingerprinting with Similarity Digests, in: K.-P. Chow, S. Shenoi (Eds.), Advances in Digital Forensics VI: Sixth IFIP WG 11.9 International Conference on Digital Forensics, Hong Kong, China, January 4-6, 2010, Revised Selected Papers, Springer Berlin Heidelberg, Berlin, Heidelberg, ISBN 978-3-642-15506-2, 207–226, doi: 10.1007/978-3-642-15506-2_15
C. Winter, M. Schneider, Y. Yannikos, F2S2: Fast forensic similarity search through indexing piecewise hash signatures, Digital Investigation 10 (4) (2013a) 361–371, ISSN 17422876, doi: 10.1016/j.diin.2013.08.003
2013
Later among the works it cites.
F. Breitinger, G. Stivaktakis, H. Baier, FRASH: A framework to test algorithms of similarity hashing, Digital Investigation 10 (2013b) S50–S58, ISSN 17422876, doi: 10.1016/j.diin.2013.06.006
2013
Later among the works it cites.
C. Winter, M. Schneider, Y. Yannikos, F2S2: Fast forensic similarity search through indexing piecewise hash signatures, Digital Investigation 10 (4) (2013b) 361–371, ISSN 17422876, doi: 10.1016/j.diin.2013.08.003
2013
Later among the works it cites.
A. Costin, J. Zaddach, A. Francillon, D. Balzarotti, A Large-scale Analysis of the Security of Embedded Firmwares, in: Proceedings of the 23rd USENIX Conference on Security Symposium, SEC’14, USENIX Association, Berkeley, CA, USA, ISBN 978-1-931971-15-7, 95–110, URL http://dl.acm.org/citation.cfm?id=2671225.2671232 , 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2010
Cited alongside, same era.
K. H. Brodersen, C. S. Ong, K. E. Stephan, J. M. Buhmann, The Balanced Accuracy and Its Posterior Distribution, in: Proceedings of the 2010 20th International Conference on Pattern Recognition, ICPR ’10, IEEE Computer Society, Washington, DC, USA, ISBN 978-0-7695-4109-9, 3121–3124, doi: 10.1109/ICPR.2010.764
2010
Cited alongside, same era.
J. Jang, D. Brumley, S. Venkataraman, BitShred: Feature Hashing Malware for Scalable Triage and Semantic Analysis, in: Proceedings of the 18th ACM conference on Computer and communications security - CCS, ACM Press, New York, New York, USA, ISBN 9781450309486, 309–320, doi: 10.1145/2046707.2046742
2011
Cited alongside, same era.
V. Roussev, An evaluation of forensic similarity hashes, Digital Investigation 8 (2011) S34–S41, ISSN 17422876, doi: 10.1016/j.diin.2011.05.005
2011
Cited alongside, same era.
H. Baier, F. Breitinger, Security Aspects of Piecewise Hashing in Computer Forensics, in: 2011 Sixth International Conference on IT Security Incident Management and IT Forensics, IEEE, ISBN 978-1-4577-0146-7, 21–36, doi: 10.1109/IMF.2011.16
2011
Cited alongside, same era.
V. Roussev, C. Quates, Content triage with similarity digests: The M57 case study, Digital Investigation 9 (2012) S60–S68, ISSN 17422876, doi: 10.1016/j.diin.2012.05.012
2012
Cited alongside, same era.
F. Breitinger, H. Baier, J. Beckingham, Security and implementation analysis of the similarity digest sdhash, in: First International Baltic Conference on Network Security & Forensics (NeSeFo), 2012
2012
Cited alongside, same era.
A. Lakhotia, A. Walenstein, C. Miles, A. Singh, VILO: A Rapid Learning Nearest-neighbor Classifier for Malware Triage, Journal in Computer Virology 9 (3) (2013) 109–123, ISSN 1772-9890, doi: 10.1007/s11416-013-0178-3
2013
Cited alongside, same era.
F. Breitinger, K. P. Astebol, H. Baier, C. Busch, mvHash-B - A New Approach for Similarity Preserving Hashing, in: Proceedings of the 2013 Seventh International Conference on IT Security Incident Management and IT Forensics, IMF ’13, IEEE Computer Society, Washington, DC, USA, ISBN 978-0-7695-4955-2, 33–44, doi: 10.1109/IMF.2013.18
2013
Cited alongside, same era.
2014
Later among the works it cites.
D. Arp, M. Spreitzenbarth, H. Malte, H. Gascon, K. Rieck, Drebin: Effective and Explainable Detection of Android Malware in Your Pocket, Symposium on Network and Distributed System Security (NDSS) (February) (2014) 23–26, doi: 10.14722/ndss.2014.23247
2014
Later among the works it cites.
F. Breitinger, H. Baier, D. White, On the database lookup problem of approximate matching, Digital Investigation 11 (2014a) S1–S9, ISSN 17422876, doi: 10.1016/j.diin.2014.03.001
2014
Later among the works it cites.
Y. Li, S. C. Sundaramurthy, A. G. Bardas, X. Ou, D. Caragea, X. Hu, J. Jang, Experimental Study of Fuzzy Hashing in Malware Clustering Analysis, in: 8th Workshop on Cyber Security Experimentation and Test (CSET 15), USENIX Association, Washington, D.C., URL https://www.usenix.org/conference/cset15/workshop-program/presentation/li , 2015
2015
Later among the works it cites.
R. S. Borbely, On normalized compression distance and large malware, Journal of Computer Virology and Hacking Techniques (2015) 1–8ISSN 2263-8733, doi: 10.1007/s11416-015-0260-0
2015
Later among the works it cites.
Microsoft Malware Classification Challenge (BIG 2015), URL https://www.kaggle.com/c/malware-classification/ , 2015
2015
Later among the works it cites.
M. Izbicki, C. R. Shelton, Faster Cover Trees, in: Proceedings of the Thirty-Second International Conference on Machine Learning, vol. 37, 2015
2015
Later among the works it cites.
V. Harichandran, F. Breitinger, I. Baggili, Bytewise Approximate Matching: The Good, The Bad, and The Unknown, Journal of Digital Forensics, Security and Law 11 (2) (2016) 59–78, ISSN 15587223, doi: 10.15394/jdfsl.2016.1379
2016
Later among the works it cites.
E. Raff, C. Nicholas, An Alternative to NCD for Large Sequences, Lempel-Ziv Jaccard Distance, in: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining - KDD ’17, ACM Press, New York, New York, USA, ISBN 9781450348874, 1007–1015, doi: 10.1145/3097983.3098111
2017
Closest in time.
D. Lillis, F. Breitinger, M. Scanlon, Expediting MRSH-v2 Approximate Matching with Hierarchical Bloom Filter Trees, in: 9th EAI International Conference on Digital Forensics and Cyber Crime (ICDF2C 2017), Springer, Prague, Czechia, 2017
2017
Closest in time.